{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s118356706", "group_id": "codeNet:p00009", "input_text": "let for_range s e step f =\n  let rec loop i =\n    if i > e then ()\n    else\n      begin f i;loop (i + step) end\n  in loop s;;\n\nlet a =\n  let num = 1000000 in\n  let p = Array.init (num+1) (fun x -> 1) in\n  let rec loop i =\n    if i*i < num then\n      begin\n        for_range (i+i) num i (fun x -> p.(x) <- 0);\n        loop (i+2)\n      end\n  in\n  p.(0) <- 0; p.(1)<-(0);\n  for_range 4 num 2 (fun x -> p.(x) <- 0);\n  loop 3;\n  let rec read () =\n    try let n = read_int () in\n        Printf.printf \"%d\\n\" (Array.fold_left (+) 0 (Array.sub p 0 (n+1)));\n        read ()\n    with End_of_file -> ()\n  in read ();;", "language": "OCaml", "metadata": {"date": 1468676687, "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/s118356706.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s118356706", "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 ()\n    else\n      begin f i;loop (i + step) end\n  in loop s;;\n\nlet a =\n  let num = 1000000 in\n  let p = Array.init (num+1) (fun x -> 1) in\n  let rec loop i =\n    if i*i < num then\n      begin\n        for_range (i+i) num i (fun x -> p.(x) <- 0);\n        loop (i+2)\n      end\n  in\n  p.(0) <- 0; p.(1)<-(0);\n  for_range 4 num 2 (fun x -> p.(x) <- 0);\n  loop 3;\n  let rec read () =\n    try let n = read_int () in\n        Printf.printf \"%d\\n\" (Array.fold_left (+) 0 (Array.sub p 0 (n+1)));\n        read ()\n    with End_of_file -> ()\n  in read ();;", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 140, "memory_kb": 75108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s987217713", "group_id": "codeNet:p00009", "input_text": "module Cache = struct\n  let create size = Array.make size None\n                                 \n  let find_or_add tbl n f =\n    match tbl.(n) with\n    | Some v -> v\n    | None -> \n       let v = f n in\n       tbl.(n) <- Some v;\n       v\nend\n\nlet is_prime n memo =\n  let rec is_prime_inner n r =\n    match r with\n      1 -> true\n    | _ -> \n       match n mod r with\n         0 -> false\n       | _ -> is_prime_inner n (r-1)\n  in\n  match memo.(n) with\n  | Some v -> v\n  | None ->\n     let a = is_prime_inner n (int_of_float (floor (sqrt (float_of_int n)))) in\n     memo.(n) <- Some a;\n     a\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  make_list_inner f t []\n\nlet map f l = List.rev (List.rev_map f l)\n\nlet solve = function\n  | 1 -> 0\n  | 2 -> 1\n  | n ->\n     let memo = Cache.create 1000000 in\n     List.fold_left (fun x y -> x + y) 0 (map (fun x -> if is_prime x memo then 1 else 0) (make_list 3 n 2))\n\nlet () =\n  let rec read () =\n    try let n = read_int() in\n        Printf.printf \"%d\\n\" (solve n);\n        read ()\n    with End_of_file -> ()\n  in read ()\n;;", "language": "OCaml", "metadata": {"date": 1469338008, "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/s987217713.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s987217713", "user_id": "u827122710"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "module Cache = struct\n  let create size = Array.make size None\n                                 \n  let find_or_add tbl n f =\n    match tbl.(n) with\n    | Some v -> v\n    | None -> \n       let v = f n in\n       tbl.(n) <- Some v;\n       v\nend\n\nlet is_prime n memo =\n  let rec is_prime_inner n r =\n    match r with\n      1 -> true\n    | _ -> \n       match n mod r with\n         0 -> false\n       | _ -> is_prime_inner n (r-1)\n  in\n  match memo.(n) with\n  | Some v -> v\n  | None ->\n     let a = is_prime_inner n (int_of_float (floor (sqrt (float_of_int n)))) in\n     memo.(n) <- Some a;\n     a\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  make_list_inner f t []\n\nlet map f l = List.rev (List.rev_map f l)\n\nlet solve = function\n  | 1 -> 0\n  | 2 -> 1\n  | n ->\n     let memo = Cache.create 1000000 in\n     List.fold_left (fun x y -> x + y) 0 (map (fun x -> if is_prime x memo then 1 else 0) (make_list 3 n 2))\n\nlet () =\n  let rec read () =\n    try let n = read_int() in\n        Printf.printf \"%d\\n\" (solve 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1150, "cpu_time_ms": 20000, "memory_kb": 54068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s525551429", "group_id": "codeNet:p00042", "input_text": "let id x = x\n\nlet rec iteri f s t = if s > t then () else begin f s; iteri f (s + 1) t end\n\nlet rec read n = if n <= 0 then ([],[])\n                 else let x, y = Scanf.scanf \"%d,%d\\n\" (fun x y -> (x, y)) in \n                      let (xs, ys) = read (n - 1) in (x::xs, y::ys)\n\nlet solve dp vs ws n w =\n  iteri (fun i -> \n         iteri (fun j -> \n                if j >= ws.(i) then dp.(i+1).(j) <- max dp.(i).(j) (dp.(i).(j - ws.(i)) + vs.(i)) \n                else dp.(i+1).(j) <- dp.(i).(j)) 0 w) 0 (n - 1)\n\nlet rec min_w dp i j v = \n  if dp.(i).(j) = v then min_w dp i (j - 1) v else j + 1\n\nlet _ =\n  let cnt = ref 0 in\n  try\n    while true do\n      let w = Scanf.scanf \"%d\\n\" id in\n      if w = 0 then \n        raise End_of_file\n      else\n        let n = Scanf.scanf \"%d\\n\" id in\n        let dp = Array.make_matrix (n + 1) (w + 1) 0 in\n        let vs', ws' = read n in\n        let vs = Array.of_list vs' in\n        let ws = Array.of_list ws' in\n        solve dp vs ws n w;\n        incr cnt;\n        Printf.printf \"Case %d:\\n\" !cnt;\n        Printf.printf \"%d\\n\" (dp.(n).(w));\n        Printf.printf \"%d\\n\" (min_w dp n w dp.(n).(w))\n    done\n  with\n    End_of_file -> ()", "language": "OCaml", "metadata": {"date": 1445496482, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00042.html", "problem_id": "p00042", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00042/input.txt", "sample_output_relpath": "derived/input_output/data/p00042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00042/OCaml/s525551429.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525551429", "user_id": "u049242937"}, "prompt_components": {"gold_output": "Case 1:\n220\n49\nCase 2:\n220\n49\n", "input_to_evaluate": "let id x = x\n\nlet rec iteri f s t = if s > t then () else begin f s; iteri f (s + 1) t end\n\nlet rec read n = if n <= 0 then ([],[])\n                 else let x, y = Scanf.scanf \"%d,%d\\n\" (fun x y -> (x, y)) in \n                      let (xs, ys) = read (n - 1) in (x::xs, y::ys)\n\nlet solve dp vs ws n w =\n  iteri (fun i -> \n         iteri (fun j -> \n                if j >= ws.(i) then dp.(i+1).(j) <- max dp.(i).(j) (dp.(i).(j - ws.(i)) + vs.(i)) \n                else dp.(i+1).(j) <- dp.(i).(j)) 0 w) 0 (n - 1)\n\nlet rec min_w dp i j v = \n  if dp.(i).(j) = v then min_w dp i (j - 1) v else j + 1\n\nlet _ =\n  let cnt = ref 0 in\n  try\n    while true do\n      let w = Scanf.scanf \"%d\\n\" id in\n      if w = 0 then \n        raise End_of_file\n      else\n        let n = Scanf.scanf \"%d\\n\" id in\n        let dp = Array.make_matrix (n + 1) (w + 1) 0 in\n        let vs', ws' = read n in\n        let vs = Array.of_list vs' in\n        let ws = Array.of_list ws' in\n        solve dp vs ws n w;\n        incr cnt;\n        Printf.printf \"Case %d:\\n\" !cnt;\n        Printf.printf \"%d\\n\" (dp.(n).(w));\n        Printf.printf \"%d\\n\" (min_w dp n w dp.(n).(w))\n    done\n  with\n    End_of_file -> ()", "problem_context": "泥棒\n\n宝物がたくさん収蔵されている博物館に、泥棒が大きな風呂敷を一つだけ持って忍び込みました。盗み出したいものはたくさんありますが、風呂敷が耐えられる重さが限られており、これを超えると風呂敷が破れてしまいます。そこで泥棒は、用意した風呂敷を破らず且つ最も価値が高くなるようなお宝の組み合わせを考えなくてはなりません。\n\n風呂敷が耐えられる重さ W、および博物館にある個々のお宝の価値と重さを読み込んで、重さの総和が W を超えない範囲で価値の総和が最大になるときの、お宝の価値総和と重さの総和を出力するプログラムを作成してください。ただし、価値の総和が最大になる組み合わせが複数あるときは、重さの総和が小さいものを出力することとします。\n\nInput\n\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\n\nW\nN\nv1,w1\nv2,w2\n:\nvN,wN\n\n１行目に風呂敷の耐えられる重さを表す整数 W (W ≤ 1,000)、２行目にお宝の数 N (1 ≤ N ≤ 1,000) が与えられます。続く N 行に i 番目のお宝の価値を表す整数 vi (0 ≤ vi ≤ 10,000) とその重さを表す整数 wi (0 ≤ wi ≤ W) の組がそれぞれ１行に与えられます。\n\nW が 0 のとき入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対して以下のように出力して下さい。\n\nCase データセットの番号:\n風呂敷に入れたお宝の価値総和\nそのときのお宝の重さの総和\n\nSample Input\n\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n0\n\nOutput for the Sample Input\n\nCase 1:\n220\n49\nCase 2:\n220\n49", "sample_input": "50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n0\n"}, "reference_outputs": ["Case 1:\n220\n49\nCase 2:\n220\n49\n"], "source_document_id": "p00042", "source_text": "泥棒\n\n宝物がたくさん収蔵されている博物館に、泥棒が大きな風呂敷を一つだけ持って忍び込みました。盗み出したいものはたくさんありますが、風呂敷が耐えられる重さが限られており、これを超えると風呂敷が破れてしまいます。そこで泥棒は、用意した風呂敷を破らず且つ最も価値が高くなるようなお宝の組み合わせを考えなくてはなりません。\n\n風呂敷が耐えられる重さ W、および博物館にある個々のお宝の価値と重さを読み込んで、重さの総和が W を超えない範囲で価値の総和が最大になるときの、お宝の価値総和と重さの総和を出力するプログラムを作成してください。ただし、価値の総和が最大になる組み合わせが複数あるときは、重さの総和が小さいものを出力することとします。\n\nInput\n\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\n\nW\nN\nv1,w1\nv2,w2\n:\nvN,wN\n\n１行目に風呂敷の耐えられる重さを表す整数 W (W ≤ 1,000)、２行目にお宝の数 N (1 ≤ N ≤ 1,000) が与えられます。続く N 行に i 番目のお宝の価値を表す整数 vi (0 ≤ vi ≤ 10,000) とその重さを表す整数 wi (0 ≤ wi ≤ W) の組がそれぞれ１行に与えられます。\n\nW が 0 のとき入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対して以下のように出力して下さい。\n\nCase データセットの番号:\n風呂敷に入れたお宝の価値総和\nそのときのお宝の重さの総和\n\nSample Input\n\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n0\n\nOutput for the Sample Input\n\nCase 1:\n220\n49\nCase 2:\n220\n49", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1176, "cpu_time_ms": 10, "memory_kb": 10852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s911447467", "group_id": "codeNet:p00185", "input_text": "open List\nlet m3_cycle_length = 30\nlet m3_primes = [5; 3; 2]\nlet m3_cycle = [6; 4; 2; 4; 2; 4; 6; 2]\n\nlet wheel_fact limit =\n  let slimit = limit in\n  let rec wheel_loop limit n nxt result =\n  let get_m3_cycle n =\n      nth m3_cycle (n mod ((length m3_cycle)))\n  in\n  if nxt > limit then tl (sort (fun x y -> if x == 0 then 0\n                            else if x > y then 1\n                            else -1) (rev (result @ m3_primes)))\n  else wheel_loop limit (n + 1) (nxt + (get_m3_cycle n)) (nxt :: result)\n  in wheel_loop slimit 0 1 []\n\nlet sieve xs =\n  let rec sieve_loop xs ys =\n    let comp_filter n xs = \n      List.filter (fun x -> x mod n != 0 && n != x) xs \n    in \n    match xs with\n      [] -> ys\n    | x :: xs -> sieve_loop (comp_filter x xs) (x :: ys)\n  in\n  sieve_loop xs []\n\nlet split xs n =\n  let rec split_loop xs n ys =\n    if n <= 0 then (ys, xs)\n    else split_loop (tl xs) (n - 1) (hd xs :: ys)\n  in\n  split_loop xs n []\n\nlet uniq xs =\n  let rec uniq_loop xs ys =\n    match xs with\n      [] -> ys\n    | x :: xs -> uniq_loop (filter (fun (l1, l2) -> l1 != fst x && l2 != snd x) xs) (x :: ys)\n  in uniq_loop xs []\n\nlet goldbach n =\n  let rec gold_loop xs ys zs = \n    let rec bach_loop x ys =\n      match ys with \n        [] -> (0, 0)\n      | y :: ys -> if n == y + x then \n                      if x < y then (x, y) else (y, x)\n                   else bach_loop x ys\n    in\n    match xs with\n      [] -> zs\n    | x :: xs -> gold_loop xs ys ((bach_loop x ys) :: zs)\n  in\n  let sieved = sieve (wheel_fact n) in\n  let (sieved1, _) = split sieved ((length sieved) / 2) in\n  uniq(filter (fun (x, y) -> x != 0 && y != 0) (gold_loop sieved1 sieved []))\n\nlet goldbach_length n = length (goldbach n)\n\nlet () =\n  let rec echo_sub () =\n    print_int (goldbach_length(int_of_string(read_line ())));\n    print_newline ();\n    echo_sub ()\n  in\n    try echo_sub () with End_of_file -> ()", "language": "OCaml", "metadata": {"date": 1463992886, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00185.html", "problem_id": "p00185", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00185/input.txt", "sample_output_relpath": "derived/input_output/data/p00185/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00185/OCaml/s911447467.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s911447467", "user_id": "u887837052"}, "prompt_components": {"gold_output": "6\n72\n274\n607\n", "input_to_evaluate": "open List\nlet m3_cycle_length = 30\nlet m3_primes = [5; 3; 2]\nlet m3_cycle = [6; 4; 2; 4; 2; 4; 6; 2]\n\nlet wheel_fact limit =\n  let slimit = limit in\n  let rec wheel_loop limit n nxt result =\n  let get_m3_cycle n =\n      nth m3_cycle (n mod ((length m3_cycle)))\n  in\n  if nxt > limit then tl (sort (fun x y -> if x == 0 then 0\n                            else if x > y then 1\n                            else -1) (rev (result @ m3_primes)))\n  else wheel_loop limit (n + 1) (nxt + (get_m3_cycle n)) (nxt :: result)\n  in wheel_loop slimit 0 1 []\n\nlet sieve xs =\n  let rec sieve_loop xs ys =\n    let comp_filter n xs = \n      List.filter (fun x -> x mod n != 0 && n != x) xs \n    in \n    match xs with\n      [] -> ys\n    | x :: xs -> sieve_loop (comp_filter x xs) (x :: ys)\n  in\n  sieve_loop xs []\n\nlet split xs n =\n  let rec split_loop xs n ys =\n    if n <= 0 then (ys, xs)\n    else split_loop (tl xs) (n - 1) (hd xs :: ys)\n  in\n  split_loop xs n []\n\nlet uniq xs =\n  let rec uniq_loop xs ys =\n    match xs with\n      [] -> ys\n    | x :: xs -> uniq_loop (filter (fun (l1, l2) -> l1 != fst x && l2 != snd x) xs) (x :: ys)\n  in uniq_loop xs []\n\nlet goldbach n =\n  let rec gold_loop xs ys zs = \n    let rec bach_loop x ys =\n      match ys with \n        [] -> (0, 0)\n      | y :: ys -> if n == y + x then \n                      if x < y then (x, y) else (y, x)\n                   else bach_loop x ys\n    in\n    match xs with\n      [] -> zs\n    | x :: xs -> gold_loop xs ys ((bach_loop x ys) :: zs)\n  in\n  let sieved = sieve (wheel_fact n) in\n  let (sieved1, _) = split sieved ((length sieved) / 2) in\n  uniq(filter (fun (x, y) -> x != 0 && y != 0) (gold_loop sieved1 sieved []))\n\nlet goldbach_length n = length (goldbach n)\n\nlet () =\n  let rec echo_sub () =\n    print_int (goldbach_length(int_of_string(read_line ())));\n    print_newline ();\n    echo_sub ()\n  in\n    try echo_sub () with End_of_file -> ()", "problem_context": "ゴールドバッハ予想\n\nゴールドバッハ予想とは「6 以上のどんな偶数も、2 つの素数 (*1) の和として表わすことができる」というものです。\n\nたとえば、偶数の 12 は 12 = 5 + 7 、18 は 18 = 5 + 13 = 7 + 11 などと表すことができます。\n\n和が 134 となる 2 つの素数の組み合せをすべて書き出すと、以下の通りとなります。\n\n134 = 3+131 = 7+127 = 31+103 = 37+97 = 61+73 = 67+67\n\n= 131+3 = 127+7 = 103+31 = 97+37 = 73+61\n\n与えられた数が大きくなると、いくらでも素数の組み合せが見つかるような気がします。しかし、現代数学をもってしてもこの予想を証明することも、反例を作ることもできません(*2)。ちょっと不思議な感じがしますね。\n\nそこで、ゴールドバッハ予想を鑑賞するために、偶数 n を入力とし、和が n となる 2 つの素数の組み合せの数を求めるプログラムを作成してください。\n\n和が n となる素数の組み合せの数とは n = p + q かつ p ≤ q であるような正の素数 p, q の組み合せの数です。上の例からわかるように和が 134 となる素数の組み合せは6 個です。\n\n(*1) 素数とは、1 または自分自身以外に約数を持たない整数のことである。なお、1 は素数ではない。\n\n(*2) 2007 年 2 月現在、5×1017 までの全ての偶数について成り立つことが確かめられている。(Wikipedia)\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットとして、１つの偶数 n (6 ≤ n ≤ 1000000) が１行に与えられます。\n\nデータセットの数は 500 を超えません。\n\nOutput\n\nデータセット毎に素数の組み合せの数を１行に出力します。\n\nSample Input\n\n134\n4330\n34808\n98792\n0\n\nOutput for the Sample Input\n\n6\n72\n274\n607", "sample_input": "134\n4330\n34808\n98792\n0\n"}, "reference_outputs": ["6\n72\n274\n607\n"], "source_document_id": "p00185", "source_text": "ゴールドバッハ予想\n\nゴールドバッハ予想とは「6 以上のどんな偶数も、2 つの素数 (*1) の和として表わすことができる」というものです。\n\nたとえば、偶数の 12 は 12 = 5 + 7 、18 は 18 = 5 + 13 = 7 + 11 などと表すことができます。\n\n和が 134 となる 2 つの素数の組み合せをすべて書き出すと、以下の通りとなります。\n\n134 = 3+131 = 7+127 = 31+103 = 37+97 = 61+73 = 67+67\n\n= 131+3 = 127+7 = 103+31 = 97+37 = 73+61\n\n与えられた数が大きくなると、いくらでも素数の組み合せが見つかるような気がします。しかし、現代数学をもってしてもこの予想を証明することも、反例を作ることもできません(*2)。ちょっと不思議な感じがしますね。\n\nそこで、ゴールドバッハ予想を鑑賞するために、偶数 n を入力とし、和が n となる 2 つの素数の組み合せの数を求めるプログラムを作成してください。\n\n和が n となる素数の組み合せの数とは n = p + q かつ p ≤ q であるような正の素数 p, q の組み合せの数です。上の例からわかるように和が 134 となる素数の組み合せは6 個です。\n\n(*1) 素数とは、1 または自分自身以外に約数を持たない整数のことである。なお、1 は素数ではない。\n\n(*2) 2007 年 2 月現在、5×1017 までの全ての偶数について成り立つことが確かめられている。(Wikipedia)\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットとして、１つの偶数 n (6 ≤ n ≤ 1000000) が１行に与えられます。\n\nデータセットの数は 500 を超えません。\n\nOutput\n\nデータセット毎に素数の組み合せの数を１行に出力します。\n\nSample Input\n\n134\n4330\n34808\n98792\n0\n\nOutput for the Sample Input\n\n6\n72\n274\n607", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1897, "cpu_time_ms": 20000, "memory_kb": 29588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s003306369", "group_id": "codeNet:p00185", "input_text": "open List\nlet m3_cycle_length = 30\nlet m3_primes = [5; 3; 2]\nlet m3_cycle = [6; 4; 2; 4; 2; 4; 6; 2]\n\nlet wheel_fact limit =\n  let slimit = limit in\n  let rec wheel_loop limit n nxt result =\n  let get_m3_cycle n =\n      nth m3_cycle (n mod ((length m3_cycle)))\n  in\n  if nxt > limit then tl (sort (fun x y -> if x == 0 then 0\n                            else if x > y then 1\n                            else -1) (rev (result @ m3_primes)))\n  else wheel_loop limit (n + 1) (nxt + (get_m3_cycle n)) (nxt :: result)\n  in wheel_loop slimit 0 1 []\n\nlet sieve xs =\n  let rec sieve_loop xs ys =\n    let comp_filter n xs = \n      List.filter (fun x -> x mod n != 0 && n != x) xs \n    in \n    match xs with\n      [] -> ys\n    | x :: xs -> sieve_loop (comp_filter x xs) (x :: ys)\n  in\n  sieve_loop xs []\n\nlet split xs n =\n  let rec split_loop xs n ys =\n    if n <= 0 then (ys, xs)\n    else split_loop (tl xs) (n - 1) (hd xs :: ys)\n  in\n  split_loop xs n []\n\nlet uniq xs =\n  let rec uniq_loop xs ys =\n    match xs with\n      [] -> ys\n    | x :: xs -> uniq_loop (filter (fun (l1, l2) -> l1 != fst x && l2 != snd x) xs) (x :: ys)\n  in uniq_loop xs []\n\nlet goldbach n =\n  let rec gold_loop xs y =\n    match xs with\n      []      -> y\n    | z :: zs -> try\n                   if (z * 2) >= n then \n                     if n - z == (find (fun x -> x + z == n) xs)\n                     then gold_loop zs (y + 1)\n                     else gold_loop zs y\n                   else y\n                 with\n                   Not_found -> gold_loop zs y\n  in\n  let sieved = sieve (wheel_fact n) in\n  gold_loop sieved 0\n\nlet () =\n  let rec echo_sub () =\n    print_int (goldbach(int_of_string(read_line ())));\n    print_newline ();\n    echo_sub ()\n  in\n    try echo_sub () with End_of_file -> ()", "language": "OCaml", "metadata": {"date": 1463995751, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00185.html", "problem_id": "p00185", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00185/input.txt", "sample_output_relpath": "derived/input_output/data/p00185/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00185/OCaml/s003306369.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s003306369", "user_id": "u887837052"}, "prompt_components": {"gold_output": "6\n72\n274\n607\n", "input_to_evaluate": "open List\nlet m3_cycle_length = 30\nlet m3_primes = [5; 3; 2]\nlet m3_cycle = [6; 4; 2; 4; 2; 4; 6; 2]\n\nlet wheel_fact limit =\n  let slimit = limit in\n  let rec wheel_loop limit n nxt result =\n  let get_m3_cycle n =\n      nth m3_cycle (n mod ((length m3_cycle)))\n  in\n  if nxt > limit then tl (sort (fun x y -> if x == 0 then 0\n                            else if x > y then 1\n                            else -1) (rev (result @ m3_primes)))\n  else wheel_loop limit (n + 1) (nxt + (get_m3_cycle n)) (nxt :: result)\n  in wheel_loop slimit 0 1 []\n\nlet sieve xs =\n  let rec sieve_loop xs ys =\n    let comp_filter n xs = \n      List.filter (fun x -> x mod n != 0 && n != x) xs \n    in \n    match xs with\n      [] -> ys\n    | x :: xs -> sieve_loop (comp_filter x xs) (x :: ys)\n  in\n  sieve_loop xs []\n\nlet split xs n =\n  let rec split_loop xs n ys =\n    if n <= 0 then (ys, xs)\n    else split_loop (tl xs) (n - 1) (hd xs :: ys)\n  in\n  split_loop xs n []\n\nlet uniq xs =\n  let rec uniq_loop xs ys =\n    match xs with\n      [] -> ys\n    | x :: xs -> uniq_loop (filter (fun (l1, l2) -> l1 != fst x && l2 != snd x) xs) (x :: ys)\n  in uniq_loop xs []\n\nlet goldbach n =\n  let rec gold_loop xs y =\n    match xs with\n      []      -> y\n    | z :: zs -> try\n                   if (z * 2) >= n then \n                     if n - z == (find (fun x -> x + z == n) xs)\n                     then gold_loop zs (y + 1)\n                     else gold_loop zs y\n                   else y\n                 with\n                   Not_found -> gold_loop zs y\n  in\n  let sieved = sieve (wheel_fact n) in\n  gold_loop sieved 0\n\nlet () =\n  let rec echo_sub () =\n    print_int (goldbach(int_of_string(read_line ())));\n    print_newline ();\n    echo_sub ()\n  in\n    try echo_sub () with End_of_file -> ()", "problem_context": "ゴールドバッハ予想\n\nゴールドバッハ予想とは「6 以上のどんな偶数も、2 つの素数 (*1) の和として表わすことができる」というものです。\n\nたとえば、偶数の 12 は 12 = 5 + 7 、18 は 18 = 5 + 13 = 7 + 11 などと表すことができます。\n\n和が 134 となる 2 つの素数の組み合せをすべて書き出すと、以下の通りとなります。\n\n134 = 3+131 = 7+127 = 31+103 = 37+97 = 61+73 = 67+67\n\n= 131+3 = 127+7 = 103+31 = 97+37 = 73+61\n\n与えられた数が大きくなると、いくらでも素数の組み合せが見つかるような気がします。しかし、現代数学をもってしてもこの予想を証明することも、反例を作ることもできません(*2)。ちょっと不思議な感じがしますね。\n\nそこで、ゴールドバッハ予想を鑑賞するために、偶数 n を入力とし、和が n となる 2 つの素数の組み合せの数を求めるプログラムを作成してください。\n\n和が n となる素数の組み合せの数とは n = p + q かつ p ≤ q であるような正の素数 p, q の組み合せの数です。上の例からわかるように和が 134 となる素数の組み合せは6 個です。\n\n(*1) 素数とは、1 または自分自身以外に約数を持たない整数のことである。なお、1 は素数ではない。\n\n(*2) 2007 年 2 月現在、5×1017 までの全ての偶数について成り立つことが確かめられている。(Wikipedia)\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットとして、１つの偶数 n (6 ≤ n ≤ 1000000) が１行に与えられます。\n\nデータセットの数は 500 を超えません。\n\nOutput\n\nデータセット毎に素数の組み合せの数を１行に出力します。\n\nSample Input\n\n134\n4330\n34808\n98792\n0\n\nOutput for the Sample Input\n\n6\n72\n274\n607", "sample_input": "134\n4330\n34808\n98792\n0\n"}, "reference_outputs": ["6\n72\n274\n607\n"], "source_document_id": "p00185", "source_text": "ゴールドバッハ予想\n\nゴールドバッハ予想とは「6 以上のどんな偶数も、2 つの素数 (*1) の和として表わすことができる」というものです。\n\nたとえば、偶数の 12 は 12 = 5 + 7 、18 は 18 = 5 + 13 = 7 + 11 などと表すことができます。\n\n和が 134 となる 2 つの素数の組み合せをすべて書き出すと、以下の通りとなります。\n\n134 = 3+131 = 7+127 = 31+103 = 37+97 = 61+73 = 67+67\n\n= 131+3 = 127+7 = 103+31 = 97+37 = 73+61\n\n与えられた数が大きくなると、いくらでも素数の組み合せが見つかるような気がします。しかし、現代数学をもってしてもこの予想を証明することも、反例を作ることもできません(*2)。ちょっと不思議な感じがしますね。\n\nそこで、ゴールドバッハ予想を鑑賞するために、偶数 n を入力とし、和が n となる 2 つの素数の組み合せの数を求めるプログラムを作成してください。\n\n和が n となる素数の組み合せの数とは n = p + q かつ p ≤ q であるような正の素数 p, q の組み合せの数です。上の例からわかるように和が 134 となる素数の組み合せは6 個です。\n\n(*1) 素数とは、1 または自分自身以外に約数を持たない整数のことである。なお、1 は素数ではない。\n\n(*2) 2007 年 2 月現在、5×1017 までの全ての偶数について成り立つことが確かめられている。(Wikipedia)\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットとして、１つの偶数 n (6 ≤ n ≤ 1000000) が１行に与えられます。\n\nデータセットの数は 500 を超えません。\n\nOutput\n\nデータセット毎に素数の組み合せの数を１行に出力します。\n\nSample Input\n\n134\n4330\n34808\n98792\n0\n\nOutput for the Sample Input\n\n6\n72\n274\n607", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1769, "cpu_time_ms": 20000, "memory_kb": 26864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s022095016", "group_id": "codeNet:p00424", "input_text": "let read_lines n =\n  let rec read_lines n acc =\n    if n = 0 then List.rev acc\n    else read_lines (pred n) ((read_line ()) :: acc) in\n  read_lines n []\n\nlet rec solve () =\n  let n_conversion_table = int_of_string @@ read_line () in\n  if n_conversion_table = 0 then ()\n  else\n    let create_conversion_map pairs =\n      let hash = Hashtbl.create n_conversion_table in\n      List.iter\n        (fun (from, to_) -> Hashtbl.add hash from to_)\n        pairs;\n      hash in\n    let conversion_table =\n      create_conversion_map\n      @@ List.map\n           (fun line ->\n            Scanf.sscanf line \"%c %c\" (fun from to_ -> (from, to_)))\n           (read_lines n_conversion_table) in\n    let convert c =\n      try Hashtbl.find conversion_table c with Not_found -> c in\n    let n_input = int_of_string @@ read_line () in\n    List.iter\n      (fun line -> print_char @@ convert line.[0])\n      (read_lines n_input);\n    print_newline ();\n    solve ()\n\nlet () = solve ()", "language": "OCaml", "metadata": {"date": 1439642839, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00424.html", "problem_id": "p00424", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00424/input.txt", "sample_output_relpath": "derived/input_output/data/p00424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00424/OCaml/s022095016.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s022095016", "user_id": "u093524693"}, "prompt_components": {"gold_output": "aBC5144aba\naBC5144aba\n", "input_to_evaluate": "let read_lines n =\n  let rec read_lines n acc =\n    if n = 0 then List.rev acc\n    else read_lines (pred n) ((read_line ()) :: acc) in\n  read_lines n []\n\nlet rec solve () =\n  let n_conversion_table = int_of_string @@ read_line () in\n  if n_conversion_table = 0 then ()\n  else\n    let create_conversion_map pairs =\n      let hash = Hashtbl.create n_conversion_table in\n      List.iter\n        (fun (from, to_) -> Hashtbl.add hash from to_)\n        pairs;\n      hash in\n    let conversion_table =\n      create_conversion_map\n      @@ List.map\n           (fun line ->\n            Scanf.sscanf line \"%c %c\" (fun from to_ -> (from, to_)))\n           (read_lines n_conversion_table) in\n    let convert c =\n      try Hashtbl.find conversion_table c with Not_found -> c in\n    let n_input = int_of_string @@ read_line () in\n    List.iter\n      (fun line -> print_char @@ convert line.[0])\n      (read_lines n_input);\n    print_newline ();\n    solve ()\n\nlet () = solve ()", "problem_context": "与えられた変換表にもとづき，データを変換するプログラムを作成しなさい．\n\nデータに使われている文字は英字か数字で，英字は大文字と小文字を区別する．変換表に現れる文字の順序に規則性はない．\n\n変換表は空白をはさんで前と後ろの 2 つの文字がある(文字列ではない)．変換方法は，変換表のある行の前の文字がデータに現れたら，そのたびにその文字を後ろの文字に変換し出力する．変換は 1 度だけで，変換した文字がまた変換対象の文字になっても変換しない．変換表に現れない文字は変換せず，そのまま出力する．\n\n入力ファイルには，変換表（最初の n + 1 行）に続き変換するデータ（n + 2 行目以降）が書いてある． 1 行目に変換表の行数 n，続く n 行の各行は，空白をはさんで 2 つの文字，さらに続けて， n + 2 行目に変換するデータの行数 m，続く m 行の各行は 1 文字である． m ≤ 105 とする．出力は，出力例のように途中に空白や改行は入れず 1 行とせよ．\n\n入力例\n\n3\n\nA a\n\n0 5\n\n5 4\n\n10\n\nA\n\nB\n\nC\n\n0\n\n1\n\n4\n\n5\n\na\n\nb\n\nA\n\n　\n\n出力例\n\naBC5144aba\n\n入力\n\n入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、変換後の文字列を１行に出力する．\n\n入力例\n\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n0\n\n出力例\n\naBC5144aba\naBC5144aba\n\n各データセットの出力（変換後の文字列）の後に改行を入れること．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n0\n"}, "reference_outputs": ["aBC5144aba\naBC5144aba\n"], "source_document_id": "p00424", "source_text": "与えられた変換表にもとづき，データを変換するプログラムを作成しなさい．\n\nデータに使われている文字は英字か数字で，英字は大文字と小文字を区別する．変換表に現れる文字の順序に規則性はない．\n\n変換表は空白をはさんで前と後ろの 2 つの文字がある(文字列ではない)．変換方法は，変換表のある行の前の文字がデータに現れたら，そのたびにその文字を後ろの文字に変換し出力する．変換は 1 度だけで，変換した文字がまた変換対象の文字になっても変換しない．変換表に現れない文字は変換せず，そのまま出力する．\n\n入力ファイルには，変換表（最初の n + 1 行）に続き変換するデータ（n + 2 行目以降）が書いてある． 1 行目に変換表の行数 n，続く n 行の各行は，空白をはさんで 2 つの文字，さらに続けて， n + 2 行目に変換するデータの行数 m，続く m 行の各行は 1 文字である． m ≤ 105 とする．出力は，出力例のように途中に空白や改行は入れず 1 行とせよ．\n\n入力例\n\n3\n\nA a\n\n0 5\n\n5 4\n\n10\n\nA\n\nB\n\nC\n\n0\n\n1\n\n4\n\n5\n\na\n\nb\n\nA\n\n　\n\n出力例\n\naBC5144aba\n\n入力\n\n入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、変換後の文字列を１行に出力する．\n\n入力例\n\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n0\n\n出力例\n\naBC5144aba\naBC5144aba\n\n各データセットの出力（変換後の文字列）の後に改行を入れること．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 962, "cpu_time_ms": 10, "memory_kb": 11072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s612264166", "group_id": "codeNet:p00430", "input_text": "let solve n =\n  let rec solve n max =\n    if n = 0 then [[]]\n    else\n      let rec loop i acc =\n        if i > (min n max) then acc\n        else\n          let cdrs = solve (n - i) i in\n          let acc = List.rev_append\n                      (List.rev_map (fun cdr -> i :: cdr) cdrs)\n                      acc in\n          loop (i + 1) acc in\n      loop 1 [] in\n  solve n n\n\nlet () =\n  let rec loop () =\n    let n = int_of_string @@ read_line () in\n    if n = 0 then ()\n    else\n      let answers = solve n in\n      List.iter\n        (fun seq ->\n         print_endline @@ String.concat \" \" @@ List.map string_of_int seq)\n        answers;\n      loop () in\n  loop ()", "language": "OCaml", "metadata": {"date": 1439821369, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00430.html", "problem_id": "p00430", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00430/input.txt", "sample_output_relpath": "derived/input_output/data/p00430/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00430/OCaml/s612264166.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612264166", "user_id": "u093524693"}, "prompt_components": {"gold_output": "5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n", "input_to_evaluate": "let solve n =\n  let rec solve n max =\n    if n = 0 then [[]]\n    else\n      let rec loop i acc =\n        if i > (min n max) then acc\n        else\n          let cdrs = solve (n - i) i in\n          let acc = List.rev_append\n                      (List.rev_map (fun cdr -> i :: cdr) cdrs)\n                      acc in\n          loop (i + 1) acc in\n      loop 1 [] in\n  solve n n\n\nlet () =\n  let rec loop () =\n    let n = int_of_string @@ read_line () in\n    if n = 0 then ()\n    else\n      let answers = solve n in\n      List.iter\n        (fun seq ->\n         print_endline @@ String.concat \" \" @@ List.map string_of_int seq)\n        answers;\n      loop () in\n  loop ()", "problem_context": "同じ大きさの正方形の紙が n 枚ある.これらの紙の下部を水平に揃えて何列かに並べる.ただし,隣り合う列は左側が右側より低くならないように並べなければならない.例えば, n = 5 のときは,次のような 7 通りの並べ方が可能である.\n\nこれらを,各列に並んだ正方形の個数の列で表すことにする.例えば, n = 5 の\nときは,それぞれ,\n\n(5) (4, 1) (3, 2) (3, 1, 1) (2, 2, 1) (2, 1, 1, 1) (1, 1, 1, 1, 1)\n\nと表わされる.\n\nn を入力したとき, 辞書式順序で全て出力するプログラムを作成せよ.n ≤30\nとする.ただし, 辞書式順序とは2つの並べ方 (a1, a2 , ..., as) が並べ方 (b1, b2, ..., bt ) に対して, a1 > b1 または, ある整数 i > 1 が存在して a1 = b1 , ..., ai-1 = bi-1 かつ ai > bi が成り立つとき (a1, a2, ..., as) が (b1 , b2, ..., bt) より先に出力されるように並べることである.\n\n入力データ は 1 行からなり,1 行目に n が書かれている.\n\n出力には並べ方を辞書式順序で 1 行に1通りずつ書き最後に改行を入れること. 並べ方は (a1, a2, ..., as) の出力は整数 a1, a2, . . . , as をこの順番に空白で区切って出力すること.\n\n入力例１\n\n5\n\n　\n\n出力例１\n\n5\n\n4 1\n\n3 2\n\n3 1 1\n\n2 2 1\n\n2 1 1 1\n\n1 1 1 1 1\n\n入力\n\n入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、辞書式順序で全て出力する．\n\n入力例\n\n5\n5\n0\n\n出力例\n\n5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5\n5\n0\n"}, "reference_outputs": ["5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n"], "source_document_id": "p00430", "source_text": "同じ大きさの正方形の紙が n 枚ある.これらの紙の下部を水平に揃えて何列かに並べる.ただし,隣り合う列は左側が右側より低くならないように並べなければならない.例えば, n = 5 のときは,次のような 7 通りの並べ方が可能である.\n\nこれらを,各列に並んだ正方形の個数の列で表すことにする.例えば, n = 5 の\nときは,それぞれ,\n\n(5) (4, 1) (3, 2) (3, 1, 1) (2, 2, 1) (2, 1, 1, 1) (1, 1, 1, 1, 1)\n\nと表わされる.\n\nn を入力したとき, 辞書式順序で全て出力するプログラムを作成せよ.n ≤30\nとする.ただし, 辞書式順序とは2つの並べ方 (a1, a2 , ..., as) が並べ方 (b1, b2, ..., bt ) に対して, a1 > b1 または, ある整数 i > 1 が存在して a1 = b1 , ..., ai-1 = bi-1 かつ ai > bi が成り立つとき (a1, a2, ..., as) が (b1 , b2, ..., bt) より先に出力されるように並べることである.\n\n入力データ は 1 行からなり,1 行目に n が書かれている.\n\n出力には並べ方を辞書式順序で 1 行に1通りずつ書き最後に改行を入れること. 並べ方は (a1, a2, ..., as) の出力は整数 a1, a2, . . . , as をこの順番に空白で区切って出力すること.\n\n入力例１\n\n5\n\n　\n\n出力例１\n\n5\n\n4 1\n\n3 2\n\n3 1 1\n\n2 2 1\n\n2 1 1 1\n\n1 1 1 1 1\n\n入力\n\n入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、辞書式順序で全て出力する．\n\n入力例\n\n5\n5\n0\n\n出力例\n\n5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n5\n4 1\n3 2\n3 1 1\n2 2 1\n2 1 1 1\n1 1 1 1 1\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 666, "cpu_time_ms": 10, "memory_kb": 6064}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s042653082", "group_id": "codeNet:p00447", "input_text": "open Printf\nopen Scanf\n\nmodule Pos = struct\n    type t = int * int\n    let compare = compare\nend\n\nmodule PosSet = MoreLabels.Set.Make(Pos)\n\nlet get_trans sign pict =\n    let (ox, oy) = List.hd sign in\n    let converted = ListLabels.map sign ~f:(fun (x, y) ->\n        (x - ox, y - oy)) in\n    let (dx, dy) = PosSet.choose (PosSet.filter pict ~f:(fun (px, py) ->\n        ListLabels.for_all converted ~f:(fun (x, y) ->\n            PosSet.mem (px + x, py + y) pict))) in\n    (dx - ox, dy - oy)\n\nlet read_npos () = scanf \"%d\\n\" (fun line ->\n    let rec loop acc = function\n        | 0 -> acc\n        | i -> scanf \"%d %d\\n\" (fun x y ->\n                loop ((x, y) :: acc) (i - 1)) in\n    List.rev (loop [] line))\n\nlet _ =\n    let rec loop () =\n        let sign = read_npos () in\n        match sign with\n        | [] -> ()\n        | _ ->\n                let pict = PosSet.of_list (read_npos ()) in\n                let (tx, ty) = get_trans sign pict in\n                printf \"%d %d\\n\" tx ty;\n                loop () in\n    loop ()", "language": "OCaml", "metadata": {"date": 1448883822, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00447.html", "problem_id": "p00447", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00447/input.txt", "sample_output_relpath": "derived/input_output/data/p00447/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00447/OCaml/s042653082.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s042653082", "user_id": "u935017581"}, "prompt_components": {"gold_output": "2 -3\n-384281 179674\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nmodule Pos = struct\n    type t = int * int\n    let compare = compare\nend\n\nmodule PosSet = MoreLabels.Set.Make(Pos)\n\nlet get_trans sign pict =\n    let (ox, oy) = List.hd sign in\n    let converted = ListLabels.map sign ~f:(fun (x, y) ->\n        (x - ox, y - oy)) in\n    let (dx, dy) = PosSet.choose (PosSet.filter pict ~f:(fun (px, py) ->\n        ListLabels.for_all converted ~f:(fun (x, y) ->\n            PosSet.mem (px + x, py + y) pict))) in\n    (dx - ox, dy - oy)\n\nlet read_npos () = scanf \"%d\\n\" (fun line ->\n    let rec loop acc = function\n        | 0 -> acc\n        | i -> scanf \"%d %d\\n\" (fun x y ->\n                loop ((x, y) :: acc) (i - 1)) in\n    List.rev (loop [] line))\n\nlet _ =\n    let rec loop () =\n        let sign = read_npos () in\n        match sign with\n        | [] -> ()\n        | _ ->\n                let pict = PosSet.of_list (read_npos ()) in\n                let (tx, ty) = get_trans sign pict in\n                printf \"%d %d\\n\" tx ty;\n                loop () in\n    loop ()", "problem_context": "星座探し\n\n問題\n\nあなたは星空の写真の中から星座を探している．写真には必ず，探したい星座と同じ形・向き・大きさの図形がちょうど一つ含まれている．ただし，写真の中には星座を構成する星以外に余分な星が写っている可能性がある．\n\n例えば，図 1 の星座は図 2 の写真に含まれている（丸で囲んで示した）．与えられた星座の星の座標を x 方向に 2， y 方向に −3 だけ平行移動すると写真の中の位置になる．\n\n探したい星座の形と写真に写っている星の位置が与えられたとき，星座の座標を写真の中の座標に変換するために平行移動するべき量を答えるプログラムを書け．\n\n図 1: 探したい星座\n\n図 2: 星空の写真\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n入力の 1 行目には探したい星座を構成する星の個数 m が書かれている．続く m 行には探したい星座を構成する m 個の星の x 座標と y 座標を示す整数が空白区切りで書かれている． m+2 行目には写真に写っている星の個数 n が書かれている．続く n 行には写真に写っている n 個の星の x 座標と y 座標を示す整数が空白区切りで書かれている．\n\n星座を構成する m 個の星の位置はすべて異なる．また，写真に写っている n 個の星の位置はすべて異なる． 1 ≤ m ≤ 200， 1 ≤ n ≤ 1000 である．星の x 座標と y 座標はすべて 0 以上 1000000 以下である．\n\nm が 0　のとき入力の終わりを示す. データセットの数は 5 を超えない．\n\n出力\n\n各データセットの出力は 1 行からなり， 2 個の整数を空白区切りで書く．これらは探したい星座の座標をどれだけ平行移動すれば写真の中の座標になるかを表す．最初の整数が x 方向に平行移動する量，次の整数が y 方向に平行移動する量である．\n\n入出力例\n\n入力例\n\n5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700\n254125 362183\n50795 541942\n0\n\n出力例\n\n2 -3\n-384281 179674\n\n入出力例の１つ目は上の図に対応している．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700\n254125 362183\n50795 541942\n0\n"}, "reference_outputs": ["2 -3\n-384281 179674\n"], "source_document_id": "p00447", "source_text": "星座探し\n\n問題\n\nあなたは星空の写真の中から星座を探している．写真には必ず，探したい星座と同じ形・向き・大きさの図形がちょうど一つ含まれている．ただし，写真の中には星座を構成する星以外に余分な星が写っている可能性がある．\n\n例えば，図 1 の星座は図 2 の写真に含まれている（丸で囲んで示した）．与えられた星座の星の座標を x 方向に 2， y 方向に −3 だけ平行移動すると写真の中の位置になる．\n\n探したい星座の形と写真に写っている星の位置が与えられたとき，星座の座標を写真の中の座標に変換するために平行移動するべき量を答えるプログラムを書け．\n\n図 1: 探したい星座\n\n図 2: 星空の写真\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n入力の 1 行目には探したい星座を構成する星の個数 m が書かれている．続く m 行には探したい星座を構成する m 個の星の x 座標と y 座標を示す整数が空白区切りで書かれている． m+2 行目には写真に写っている星の個数 n が書かれている．続く n 行には写真に写っている n 個の星の x 座標と y 座標を示す整数が空白区切りで書かれている．\n\n星座を構成する m 個の星の位置はすべて異なる．また，写真に写っている n 個の星の位置はすべて異なる． 1 ≤ m ≤ 200， 1 ≤ n ≤ 1000 である．星の x 座標と y 座標はすべて 0 以上 1000000 以下である．\n\nm が 0　のとき入力の終わりを示す. データセットの数は 5 を超えない．\n\n出力\n\n各データセットの出力は 1 行からなり， 2 個の整数を空白区切りで書く．これらは探したい星座の座標をどれだけ平行移動すれば写真の中の座標になるかを表す．最初の整数が x 方向に平行移動する量，次の整数が y 方向に平行移動する量である．\n\n入出力例\n\n入力例\n\n5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700\n254125 362183\n50795 541942\n0\n\n出力例\n\n2 -3\n-384281 179674\n\n入出力例の１つ目は上の図に対応している．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1024, "cpu_time_ms": 10, "memory_kb": 4728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s107050246", "group_id": "codeNet:p00491", "input_text": "\nlet (n,k) = Scanf.sscanf (read_line ()) \"%d %d\" (fun w h -> (w, h))\n;;\n\nlet table = Array.make (n+4) 0\n;;\n\nlet rec get_input () =\n  let (a, b) = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b)) in\n  table.(a+1) <- b;\n  get_input ()\n;;\n\ntry get_input ()\nwith End_of_file -> ()\n;;\n\nlet is_valid x m1 m2 p1 p2 =\n  if x = m1 then\n    not (x = m2 || x = p1)\n  else\n    not (x = p1 && x = p2)\n;;\n\nlet rec ans index m1 m2 p1 p2 k' =\n  if table.(index) <> 0 then\n    ans (index+1) table.(index) m1 p2 table.(index+3) k'\n  else\n    let aux x =\n      if is_valid x m1 m2 p1 p2 then\n        if k' = n - k - 1 then\n          1\n        else\n          ans (index+1) x m1 p2 table.(index + 3) (k'+1)\n      else\n        0\n    in\n    ((aux 1 + aux 2) mod 10000 + aux 3) mod 10000\n;;\n\nans 2 table.(1) table.(0) table.(3) table.(4) 0 |> string_of_int |> print_string\n;;\nprint_string \"\\n\";;\n\n", "language": "OCaml", "metadata": {"date": 1517257428, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00491.html", "problem_id": "p00491", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00491/input.txt", "sample_output_relpath": "derived/input_output/data/p00491/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00491/OCaml/s107050246.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s107050246", "user_id": "u428253383"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "\nlet (n,k) = Scanf.sscanf (read_line ()) \"%d %d\" (fun w h -> (w, h))\n;;\n\nlet table = Array.make (n+4) 0\n;;\n\nlet rec get_input () =\n  let (a, b) = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b)) in\n  table.(a+1) <- b;\n  get_input ()\n;;\n\ntry get_input ()\nwith End_of_file -> ()\n;;\n\nlet is_valid x m1 m2 p1 p2 =\n  if x = m1 then\n    not (x = m2 || x = p1)\n  else\n    not (x = p1 && x = p2)\n;;\n\nlet rec ans index m1 m2 p1 p2 k' =\n  if table.(index) <> 0 then\n    ans (index+1) table.(index) m1 p2 table.(index+3) k'\n  else\n    let aux x =\n      if is_valid x m1 m2 p1 p2 then\n        if k' = n - k - 1 then\n          1\n        else\n          ans (index+1) x m1 p2 table.(index + 3) (k'+1)\n      else\n        0\n    in\n    ((aux 1 + aux 2) mod 10000 + aux 3) mod 10000\n;;\n\nans 2 table.(1) table.(0) table.(3) table.(4) 0 |> string_of_int |> print_string\n;;\nprint_string \"\\n\";;\n\n", "problem_context": "パスタ (Pasta)\n\n問題\n\nあなたはパスタが大好物であり，毎日，晩御飯にパスタを作って食べている．あなたはトマトソース，クリームソース，バジルソースの 3 種類のパスタを作ることができる．\n\nN 日間の晩御飯の予定を考えることにした．それぞれの日に 3 種類のパスタから 1 種類を選ぶ．ただし，同じパスタが続くと飽きてしまうので，3 日以上連続して同じパスタを選んではいけない．また，N 日のうちの K 日分のパスタはすでに決めてある．\n\n入力として N の値と，K 日分のパスタの情報が与えられたとき，条件をみたす予定が何通りあるかを 10000 で割った余りを求めるプログラムを作成せよ．\n\n入力\n\n入力は K + 1 行からなる．\n\n1 行目には 2 つの整数 N, K (3 ≦ N ≦ 100，1 ≦ K ≦ N) が空白を区切りとして書かれている．\n\n1 + i 行目 (1 ≦ i ≦ K) には 2 つの整数 Ai, Bi (1 ≦ Ai ≦ N，1 ≦ Bi ≦ 3) が空白を区切りとして書かれている．これは，Ai 日目のパスタはすでに決まっており，Bi = 1 のときはトマトソースであり，Bi = 2 のときはクリームソースであり，Bi = 3 のときはバジルソースであることを表す．Ai (1 ≦ i ≦ K) は全て異なる．与えられる入力データにおいて，条件をみたす予定は 1 通り以上あることが保証されている．\n\n出力\n\n条件をみたす予定が何通りあるかを 10000 で割った余りを 1 行で出力せよ．\n\n入出力例\n\n入力例 1\n\n5 3\n3 1\n1 1\n4 2\n\n出力例 1\n\n6\n\n入出力例 1 において，あなたは 5 日間の予定を考える．1 日目と 3 日目はトマトソースであり，4 日目はクリームソースである．また，3 日以上連続して同じパスタを選んではいけない．これらの条件をみたす予定は 6 通りある．\n\n 1日目 \n\n 2日目 \n\n 3日目 \n\n 4日目 \n\n 5日目 \n\n予定 1   \n\n1\n\n2\n\n1\n\n2\n\n1\n\n予定 2   \n\n1\n\n2\n\n1\n\n2\n\n2\n\n予定 3   \n\n1\n\n2\n\n1\n\n2\n\n3\n\n予定 4   \n\n1\n\n3\n\n1\n\n2\n\n1\n\n予定 5   \n\n1\n\n3\n\n1\n\n2\n\n2\n\n予定 6   \n\n1\n\n3\n\n1\n\n2\n\n3\n\nこの表では，1 はトマトソースを，2 はクリームソースを，3 はバジルソースを表す．\n\n入力例 2\n\n20 5\n10 2\n4 3\n12 1\n13 2\n9 1\n\n出力例 2\n\n2640\n\n入出力例 2 において，条件をみたす予定は全部で 4112640 通りある．それを 10000 で割った余りである 2640 を出力する．\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5 3\n3 1\n1 1\n4 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p00491", "source_text": "パスタ (Pasta)\n\n問題\n\nあなたはパスタが大好物であり，毎日，晩御飯にパスタを作って食べている．あなたはトマトソース，クリームソース，バジルソースの 3 種類のパスタを作ることができる．\n\nN 日間の晩御飯の予定を考えることにした．それぞれの日に 3 種類のパスタから 1 種類を選ぶ．ただし，同じパスタが続くと飽きてしまうので，3 日以上連続して同じパスタを選んではいけない．また，N 日のうちの K 日分のパスタはすでに決めてある．\n\n入力として N の値と，K 日分のパスタの情報が与えられたとき，条件をみたす予定が何通りあるかを 10000 で割った余りを求めるプログラムを作成せよ．\n\n入力\n\n入力は K + 1 行からなる．\n\n1 行目には 2 つの整数 N, K (3 ≦ N ≦ 100，1 ≦ K ≦ N) が空白を区切りとして書かれている．\n\n1 + i 行目 (1 ≦ i ≦ K) には 2 つの整数 Ai, Bi (1 ≦ Ai ≦ N，1 ≦ Bi ≦ 3) が空白を区切りとして書かれている．これは，Ai 日目のパスタはすでに決まっており，Bi = 1 のときはトマトソースであり，Bi = 2 のときはクリームソースであり，Bi = 3 のときはバジルソースであることを表す．Ai (1 ≦ i ≦ K) は全て異なる．与えられる入力データにおいて，条件をみたす予定は 1 通り以上あることが保証されている．\n\n出力\n\n条件をみたす予定が何通りあるかを 10000 で割った余りを 1 行で出力せよ．\n\n入出力例\n\n入力例 1\n\n5 3\n3 1\n1 1\n4 2\n\n出力例 1\n\n6\n\n入出力例 1 において，あなたは 5 日間の予定を考える．1 日目と 3 日目はトマトソースであり，4 日目はクリームソースである．また，3 日以上連続して同じパスタを選んではいけない．これらの条件をみたす予定は 6 通りある．\n\n 1日目 \n\n 2日目 \n\n 3日目 \n\n 4日目 \n\n 5日目 \n\n予定 1   \n\n1\n\n2\n\n1\n\n2\n\n1\n\n予定 2   \n\n1\n\n2\n\n1\n\n2\n\n2\n\n予定 3   \n\n1\n\n2\n\n1\n\n2\n\n3\n\n予定 4   \n\n1\n\n3\n\n1\n\n2\n\n1\n\n予定 5   \n\n1\n\n3\n\n1\n\n2\n\n2\n\n予定 6   \n\n1\n\n3\n\n1\n\n2\n\n3\n\nこの表では，1 はトマトソースを，2 はクリームソースを，3 はバジルソースを表す．\n\n入力例 2\n\n20 5\n10 2\n4 3\n12 1\n13 2\n9 1\n\n出力例 2\n\n2640\n\n入出力例 2 において，条件をみたす予定は全部で 4112640 通りある．それを 10000 で割った余りである 2640 を出力する．\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 879, "cpu_time_ms": 20000, "memory_kb": 4472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s177291171", "group_id": "codeNet:p01096", "input_text": "let dbg = Printf.printf \"[debug]%s\"\n\nlet max_num = 1_000_000_000\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\nlet succ x = x + 1\nlet pred x = x - 1\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 scan fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scan_line n =\n  let b = Scanf.Scanning.from_string (read_line ()) in\n  List.map (fun _ -> Scanf.bscanf b \" %d\" id) (0++^n)\n\nlet scan_lines n fmt f =\n  List.map (fun _ -> scan fmt f) (0++^n)\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 string_to_list s =\n  List.map (String.get s) (0 ++^ String.length s)\n\nlet solve arr =\n  let len = Array.length arr  in\n  let memo = Array.make_matrix len len None in\n  let rec aux n m =\n    if n >= m then 0\n    else\n      match memo.(n).(m) with\n      | Some v -> v\n      | None ->\n        let v =\n          (let x = aux (succ n) (pred m) in\n           (if x + 2 = m - n +1\n            then x + (if abs @@ arr.(n) - arr.(m) <= 1 then 2 else 0)\n            else x))\n          :: List.map (fun i ->\n              aux n i + aux (succ i) m)\n            (n ++^ m) |> List.fold_left max 0 in\n        memo.(n).(m) <- Some v; v\n  in\n  aux 0 @@ pred len\n\nlet () =\n  let rec aux () =\n    let n = scan \"%d\" id in\n    if n = 0 then ()\n    else\n      let arr = Array.of_list @@ scan_line n in\n      solve arr |> Printf.printf \"%d\\n\";\n      aux () in\n  aux ()\n\n", "language": "OCaml", "metadata": {"date": 1588652889, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p01096.html", "problem_id": "p01096", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p01096/input.txt", "sample_output_relpath": "derived/input_output/data/p01096/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01096/OCaml/s177291171.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177291171", "user_id": "u827214117"}, "prompt_components": {"gold_output": "4\n4\n2\n12\n0\n", "input_to_evaluate": "let dbg = Printf.printf \"[debug]%s\"\n\nlet max_num = 1_000_000_000\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\nlet succ x = x + 1\nlet pred x = x - 1\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 scan fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scan_line n =\n  let b = Scanf.Scanning.from_string (read_line ()) in\n  List.map (fun _ -> Scanf.bscanf b \" %d\" id) (0++^n)\n\nlet scan_lines n fmt f =\n  List.map (fun _ -> scan fmt f) (0++^n)\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 string_to_list s =\n  List.map (String.get s) (0 ++^ String.length s)\n\nlet solve arr =\n  let len = Array.length arr  in\n  let memo = Array.make_matrix len len None in\n  let rec aux n m =\n    if n >= m then 0\n    else\n      match memo.(n).(m) with\n      | Some v -> v\n      | None ->\n        let v =\n          (let x = aux (succ n) (pred m) in\n           (if x + 2 = m - n +1\n            then x + (if abs @@ arr.(n) - arr.(m) <= 1 then 2 else 0)\n            else x))\n          :: List.map (fun i ->\n              aux n i + aux (succ i) m)\n            (n ++^ m) |> List.fold_left max 0 in\n        memo.(n).(m) <- Some v; v\n  in\n  aux 0 @@ pred len\n\nlet () =\n  let rec aux () =\n    let n = scan \"%d\" id in\n    if n = 0 then ()\n    else\n      let arr = Array.of_list @@ scan_line n in\n      solve arr |> Printf.printf \"%d\\n\";\n      aux () in\n  aux ()\n\n", "problem_context": "Daruma Otoshi\n\nYou are playing a variant of a game called \"Daruma Otoshi (Dharma Block Striking)\".\n\nAt the start of a game, several wooden blocks of the same size but with varying weights\nare stacked on top of each other, forming a tower.\nAnother block symbolizing Dharma is placed atop.\nYou have a wooden hammer with its head thicker than the height of a block,\nbut not twice that.\n\nYou can choose any two adjacent blocks, except Dharma on the top,\ndiffering at most 1 in their weight,\nand push both of them out of the stack with a single blow of your hammer.\nThe blocks above the removed ones then fall straight down,\nwithout collapsing the tower.\n\nYou cannot hit a block pair with weight difference of 2 or more,\nfor that makes too hard to push out blocks while keeping the balance of the tower.\nThere is no chance in hitting three blocks out at a time,\nfor that would require superhuman accuracy.\n\nThe goal of the game is to remove as many blocks as you can.\nYour task is to decide the number of blocks that can be removed\nby repeating the blows in an optimal order.\n\nFigure D1. Striking out two blocks at a time\n\nIn the above figure, with a stack of four blocks weighing 1, 2, 3, and\n1, in this order from the bottom, you can hit middle\ntwo blocks, weighing 2 and 3, out from the stack. The blocks above will\nthen fall down, and two blocks weighing 1 and the Dharma block will remain.\nYou can then push out the remaining pair of weight-1 blocks after that.\n\nInput\n\nThe input consists of multiple datasets.\nThe number of datasets is at most 50.\nEach dataset is in the following format.\n\nn\n\nw1 w2 … wn\n\nn is the number of blocks, except Dharma on the top.\nn is a positive integer not exceeding 300.\nwi gives the weight of the i-th block counted from the bottom.\nwi is an integer between 1 and 1000, inclusive.\n\nThe end of the input is indicated by a line containing a zero.\n\nOutput\n\nFor each dataset, output in a line the maximum number of blocks you can remove.\n\nSample Input\n\n4\n1 2 3 4\n4\n1 2 3 1\n5\n5 1 2 3 6\n14\n8 7 1 4 3 5 4 1 6 8 10 4 6 5\n5\n1 3 5 1 3\n0\n\nOutput for the Sample Input\n\n4\n4\n2\n12\n0", "sample_input": "4\n1 2 3 4\n4\n1 2 3 1\n5\n5 1 2 3 6\n14\n8 7 1 4 3 5 4 1 6 8 10 4 6 5\n5\n1 3 5 1 3\n0\n"}, "reference_outputs": ["4\n4\n2\n12\n0\n"], "source_document_id": "p01096", "source_text": "Daruma Otoshi\n\nYou are playing a variant of a game called \"Daruma Otoshi (Dharma Block Striking)\".\n\nAt the start of a game, several wooden blocks of the same size but with varying weights\nare stacked on top of each other, forming a tower.\nAnother block symbolizing Dharma is placed atop.\nYou have a wooden hammer with its head thicker than the height of a block,\nbut not twice that.\n\nYou can choose any two adjacent blocks, except Dharma on the top,\ndiffering at most 1 in their weight,\nand push both of them out of the stack with a single blow of your hammer.\nThe blocks above the removed ones then fall straight down,\nwithout collapsing the tower.\n\nYou cannot hit a block pair with weight difference of 2 or more,\nfor that makes too hard to push out blocks while keeping the balance of the tower.\nThere is no chance in hitting three blocks out at a time,\nfor that would require superhuman accuracy.\n\nThe goal of the game is to remove as many blocks as you can.\nYour task is to decide the number of blocks that can be removed\nby repeating the blows in an optimal order.\n\nFigure D1. Striking out two blocks at a time\n\nIn the above figure, with a stack of four blocks weighing 1, 2, 3, and\n1, in this order from the bottom, you can hit middle\ntwo blocks, weighing 2 and 3, out from the stack. The blocks above will\nthen fall down, and two blocks weighing 1 and the Dharma block will remain.\nYou can then push out the remaining pair of weight-1 blocks after that.\n\nInput\n\nThe input consists of multiple datasets.\nThe number of datasets is at most 50.\nEach dataset is in the following format.\n\nn\n\nw1 w2 … wn\n\nn is the number of blocks, except Dharma on the top.\nn is a positive integer not exceeding 300.\nwi gives the weight of the i-th block counted from the bottom.\nwi is an integer between 1 and 1000, inclusive.\n\nThe end of the input is indicated by a line containing a zero.\n\nOutput\n\nFor each dataset, output in a line the maximum number of blocks you can remove.\n\nSample Input\n\n4\n1 2 3 4\n4\n1 2 3 1\n5\n5 1 2 3 6\n14\n8 7 1 4 3 5 4 1 6 8 10 4 6 5\n5\n1 3 5 1 3\n0\n\nOutput for the Sample Input\n\n4\n4\n2\n12\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1689, "cpu_time_ms": 4500, "memory_kb": 12012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s463121327", "group_id": "codeNet:p01138", "input_text": "module ArrayL = ArrayLabels\nmodule ListL = ListLabels\n\nlet dbg = Printf.printf \"[debug]%s\"\n\nlet max_num = 100_000_000_000\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\nlet tuple3 x y z = (x,y,z)\nlet succ x = x + 1\nlet pred x = x - 1\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 scan fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scan_lines n fmt f =\n  List.map (fun _ -> scan fmt f) (0++^n)\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 string_to_list s =\n  List.map (String.get s) (0 ++^ String.length s)\n\nlet split_on_char s c =\n  Str.split (Str.regexp (String.make 1 c)) s\n\nlet () =\n  let rec aux () =\n    let n = scan \"%d\" id in\n    if n <> 0 then\n      begin\n        let ls = scan_lines n \"%s %s\" tuple2 in\n        let arr = Array.make (24*60*60+60*60+2) 0 in\n        ListL.iter ls ~f:(fun (s0, s1) ->\n            (match List.map int_of_string @@ split_on_char s0 ':' with\n             | a::b::c:: _ ->arr.(60*60*a+60*b+c) <- succ arr.(60*60*a+60*b+c)\n             |_ -> ());\n            match List.map int_of_string @@ split_on_char s1 ':' with\n            | a::b::c::_ -> arr.(60*60*a+60*b+c) <- pred arr.(60*60*a+60*b+c)\n            | _ -> ());\n        ListL.iter (1 ++^ (24*60*60+60*60+2)) ~f:(fun  i->\n            arr.(i) <- arr.(pred i) + arr.(i));\n        Array.fold_left max 0 arr |> Printf.printf \"%d\\n\";\n        aux()\n      end\n  in\n  aux ()\n\n", "language": "OCaml", "metadata": {"date": 1590211342, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p01138.html", "problem_id": "p01138", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p01138/input.txt", "sample_output_relpath": "derived/input_output/data/p01138/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01138/OCaml/s463121327.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463121327", "user_id": "u827214117"}, "prompt_components": {"gold_output": "1\n3\n", "input_to_evaluate": "module ArrayL = ArrayLabels\nmodule ListL = ListLabels\n\nlet dbg = Printf.printf \"[debug]%s\"\n\nlet max_num = 100_000_000_000\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\nlet tuple3 x y z = (x,y,z)\nlet succ x = x + 1\nlet pred x = x - 1\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 scan fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scan_lines n fmt f =\n  List.map (fun _ -> scan fmt f) (0++^n)\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 string_to_list s =\n  List.map (String.get s) (0 ++^ String.length s)\n\nlet split_on_char s c =\n  Str.split (Str.regexp (String.make 1 c)) s\n\nlet () =\n  let rec aux () =\n    let n = scan \"%d\" id in\n    if n <> 0 then\n      begin\n        let ls = scan_lines n \"%s %s\" tuple2 in\n        let arr = Array.make (24*60*60+60*60+2) 0 in\n        ListL.iter ls ~f:(fun (s0, s1) ->\n            (match List.map int_of_string @@ split_on_char s0 ':' with\n             | a::b::c:: _ ->arr.(60*60*a+60*b+c) <- succ arr.(60*60*a+60*b+c)\n             |_ -> ());\n            match List.map int_of_string @@ split_on_char s1 ':' with\n            | a::b::c::_ -> arr.(60*60*a+60*b+c) <- pred arr.(60*60*a+60*b+c)\n            | _ -> ());\n        ListL.iter (1 ++^ (24*60*60+60*60+2)) ~f:(fun  i->\n            arr.(i) <- arr.(pred i) + arr.(i));\n        Array.fold_left max 0 arr |> Printf.printf \"%d\\n\";\n        aux()\n      end\n  in\n  aux ()\n\n", "problem_context": "Osaki\n\n大崎\n\nEnglish text is not available in this practice contest.\n\n山手線は東京 23 区内に敷設されている環状鉄道路線である．総路線距離は 34.5km であり，1 周にはおよそ 1 時間を要する．駅は全部で 29 駅存在する．ラインカラーはウグイス色である．ピーク時の混雑率は 200% を超え，日本の鉄道路線の中で最も混雑している路線の 1 つである．最も混雑する時間帯では 3 分に 1 本の列車が走っており，東京に初めて来た人々はその光景に驚くものである．\n\n鉄子さんは山手線を愛してやまない生粋の鉄道好きである．ある日，彼女は愛読書である JR 時刻表を読みながら次の疑問に至った．「山手線では一日に何台の車両が使われているのだろう？」\n\n彼女は時刻表から運行に最低限必要な車両の台数を割り出そうとした．しかし，列車の本数が非常に多かったので，彼女一人の力では到底数え切れそうにない．そこで彼女は優秀なプログラマーであるあなたに助けを求めた．\n\nあなたの仕事は与えられた時刻表から山手線の運行に要する車両の最低台数を求めるプログラムを書くことである．山手線は環状路線であることから，その時刻表は便宜上「大崎駅」を始発駅および終着駅として表記されることが多い．そのため，彼女から渡された時刻表にも各列車の大崎駅における発時刻および着時刻のみが記されている．\n\nなお，実際の山手線では起こりえないが，状況設定を簡単にするため，ここでは大崎駅の到着直後に列車が大崎駅を出発可能であると考えることにする．また，鉄子さんが写した時刻に誤りがあったり，鉄子さんの妄想によって勝手に加えられた列車が時刻表に紛れ込んだりしている場合もあるが，あなたはそれらを見抜くことができないので，あくまでも書かれたとおりの時刻に対して台数を求めなければならない．\n\nきちんと動作するプログラムを書けば，彼女が列車内デートに誘ってくれるかもしれない．もっとも，誘いに乗るか断るかはあなた次第であるが．\n\nInput\n\n入力は複数のデータセットから構成される．各データセットは次の形式になっている．\n\nn\n\nhh:mm:ss hh:mm:ss\n\nhh:mm:ss hh:mm:ss\n\n...\n\nhh:mm:ss hh:mm:ss\n\n1 行目の整数 n は時刻表に含まれる列車の本数である．この値は 10,000 を超えないことが保証されている．2 行目から n + 1 行目までの n 行には各列車の大崎駅の発時刻および着時刻がこの順番で与えられ，発時刻と着時刻の間は 1 つの空白で区切られている．各時刻は hh:mm:ss の形式で表現され，hh が時，mm が分，ss が秒を表している．それぞれの値の範囲は 0 ≦ hh < 24, 0 ≦ mm < 60, 0 ≦ ss < 60である．これらの数値は全て 2 桁となるように，必要に応じて先頭に 0 が付け加えられている．\n\n夜の 24:00 をまたいで運行されるような列車は含まれない．したがって，常に発時刻は常に着時刻よりも前の時刻である．\n\n入力の終了は n = 0 によって示される．これはデータセットには含まれない．\n\nOutput\n\n各データセットに対して，最低限必要となる車両の台数を 1 行に出力しなさい．\n\nSample Input\n\n3\n05:47:15 09:54:40\n12:12:59 12:13:00\n16:30:20 21:18:53\n6\n00:00:00 03:00:00\n01:00:00 03:00:00\n02:00:00 03:00:00\n03:00:00 04:00:00\n03:00:00 05:00:00\n03:00:00 06:00:00\n0\n\nOutput for the Sample Input\n\n1\n3", "sample_input": "3\n05:47:15 09:54:40\n12:12:59 12:13:00\n16:30:20 21:18:53\n6\n00:00:00 03:00:00\n01:00:00 03:00:00\n02:00:00 03:00:00\n03:00:00 04:00:00\n03:00:00 05:00:00\n03:00:00 06:00:00\n0\n"}, "reference_outputs": ["1\n3\n"], "source_document_id": "p01138", "source_text": "Osaki\n\n大崎\n\nEnglish text is not available in this practice contest.\n\n山手線は東京 23 区内に敷設されている環状鉄道路線である．総路線距離は 34.5km であり，1 周にはおよそ 1 時間を要する．駅は全部で 29 駅存在する．ラインカラーはウグイス色である．ピーク時の混雑率は 200% を超え，日本の鉄道路線の中で最も混雑している路線の 1 つである．最も混雑する時間帯では 3 分に 1 本の列車が走っており，東京に初めて来た人々はその光景に驚くものである．\n\n鉄子さんは山手線を愛してやまない生粋の鉄道好きである．ある日，彼女は愛読書である JR 時刻表を読みながら次の疑問に至った．「山手線では一日に何台の車両が使われているのだろう？」\n\n彼女は時刻表から運行に最低限必要な車両の台数を割り出そうとした．しかし，列車の本数が非常に多かったので，彼女一人の力では到底数え切れそうにない．そこで彼女は優秀なプログラマーであるあなたに助けを求めた．\n\nあなたの仕事は与えられた時刻表から山手線の運行に要する車両の最低台数を求めるプログラムを書くことである．山手線は環状路線であることから，その時刻表は便宜上「大崎駅」を始発駅および終着駅として表記されることが多い．そのため，彼女から渡された時刻表にも各列車の大崎駅における発時刻および着時刻のみが記されている．\n\nなお，実際の山手線では起こりえないが，状況設定を簡単にするため，ここでは大崎駅の到着直後に列車が大崎駅を出発可能であると考えることにする．また，鉄子さんが写した時刻に誤りがあったり，鉄子さんの妄想によって勝手に加えられた列車が時刻表に紛れ込んだりしている場合もあるが，あなたはそれらを見抜くことができないので，あくまでも書かれたとおりの時刻に対して台数を求めなければならない．\n\nきちんと動作するプログラムを書けば，彼女が列車内デートに誘ってくれるかもしれない．もっとも，誘いに乗るか断るかはあなた次第であるが．\n\nInput\n\n入力は複数のデータセットから構成される．各データセットは次の形式になっている．\n\nn\n\nhh:mm:ss hh:mm:ss\n\nhh:mm:ss hh:mm:ss\n\n...\n\nhh:mm:ss hh:mm:ss\n\n1 行目の整数 n は時刻表に含まれる列車の本数である．この値は 10,000 を超えないことが保証されている．2 行目から n + 1 行目までの n 行には各列車の大崎駅の発時刻および着時刻がこの順番で与えられ，発時刻と着時刻の間は 1 つの空白で区切られている．各時刻は hh:mm:ss の形式で表現され，hh が時，mm が分，ss が秒を表している．それぞれの値の範囲は 0 ≦ hh < 24, 0 ≦ mm < 60, 0 ≦ ss < 60である．これらの数値は全て 2 桁となるように，必要に応じて先頭に 0 が付け加えられている．\n\n夜の 24:00 をまたいで運行されるような列車は含まれない．したがって，常に発時刻は常に着時刻よりも前の時刻である．\n\n入力の終了は n = 0 によって示される．これはデータセットには含まれない．\n\nOutput\n\n各データセットに対して，最低限必要となる車両の台数を 1 行に出力しなさい．\n\nSample Input\n\n3\n05:47:15 09:54:40\n12:12:59 12:13:00\n16:30:20 21:18:53\n6\n00:00:00 03:00:00\n01:00:00 03:00:00\n02:00:00 03:00:00\n03:00:00 04:00:00\n03:00:00 05:00:00\n03:00:00 06:00:00\n0\n\nOutput for the Sample Input\n\n1\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1719, "cpu_time_ms": 650, "memory_kb": 14424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s492209440", "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": 1479563438, "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/s492209440.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s492209440", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 170, "memory_kb": 18596}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s926647959", "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  for _ = 0 to q - 1 do\n    Scanf.scanf \"%s\\n%s\\n\" (fun x y -> (x, y)) |> lcs |> Printf.printf \"%d\\n\"\n  done", "language": "OCaml", "metadata": {"date": 1500197236, "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/s926647959.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926647959", "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  for _ = 0 to q - 1 do\n    Scanf.scanf \"%s\\n%s\\n\" (fun x y -> (x, y)) |> lcs |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 180, "memory_kb": 18680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s875483938", "group_id": "codeNet:p02235", "input_text": "let lcs (x, y) =\n  let n = String.length x in\n  let m = String.length y in\n  let dp = Array.make_matrix (n + 1) (m + 1) 0 in\n  for i = 1 to n do\n    for j = 1 to m do\n      dp.(i).(j) <-\n        if x.[i-1] = y.[j-1] then dp.(i-1).(j-1) + 1\n        else\n          let a = dp.(i-1).(j) in\n          let b = dp.(i).(j-1) in\n          if a > b then a else b;\n    done\n  done;\n  dp.(n).(m)\n\nlet () =\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    Scanf.scanf \"%s\\n%s\\n\" (fun x y -> (x, y))\n    |> lcs\n    |> Printf.printf \"%d\\n\"\n  done", "language": "OCaml", "metadata": {"date": 1500349036, "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/s875483938.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s875483938", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n3\n2\n", "input_to_evaluate": "let lcs (x, y) =\n  let n = String.length x in\n  let m = String.length y in\n  let dp = Array.make_matrix (n + 1) (m + 1) 0 in\n  for i = 1 to n do\n    for j = 1 to m do\n      dp.(i).(j) <-\n        if x.[i-1] = y.[j-1] then dp.(i-1).(j-1) + 1\n        else\n          let a = dp.(i-1).(j) in\n          let b = dp.(i).(j-1) in\n          if a > b then a else b;\n    done\n  done;\n  dp.(n).(m)\n\nlet () =\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    Scanf.scanf \"%s\\n%s\\n\" (fun x y -> (x, y))\n    |> lcs\n    |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 170, "memory_kb": 18588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s555281052", "group_id": "codeNet:p02240", "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 f () = List.map int_of_string (split (read_line ()) ' ')\n\nlet dfs g n =\n  let v = Array.make n (-1) in\n  let rec dudu j = function\n    | [] -> ()\n    | hd :: tl when v.(hd) = (-1) -> (wa hd j; dudu j tl)\n    | _ :: tl -> dudu j tl\n  and wa i j = v.(i) <- j; dudu j g.(i)\n  and doit i =\n    if i < n then (if v.(i) = (-1) then wa i i; doit (i + 1))\n  in\n  doit 0;\n  v\n\nlet () =\n  match f () with\n  | [n;m] -> begin\n      let g = Array.make n [] in\n      let rec read i =\n        if i < m then\n          match f () with\n          | [s;t] -> begin\n              g.(s) <- t :: g.(s);\n              g.(t) <- s :: g.(t);\n              read (i + 1)\n            end\n          | _ -> exit 1\n      in\n      read 0;\n      let v = dfs g n in\n      let q = read_int () in\n      let rec read_q i =\n        if i < q then begin\n          match f () with\n          | [s;t] -> begin\n              print_endline (if v.(s) = v.(t) then \"yes\" else \"no\");\n              read_q (i + 1)\n            end\n          | _ -> exit 1\n        end\n      in\n      read_q 0\n    end\n  | _ -> exit 1", "language": "OCaml", "metadata": {"date": 1475148666, "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/s555281052.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s555281052", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nno\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 f () = List.map int_of_string (split (read_line ()) ' ')\n\nlet dfs g n =\n  let v = Array.make n (-1) in\n  let rec dudu j = function\n    | [] -> ()\n    | hd :: tl when v.(hd) = (-1) -> (wa hd j; dudu j tl)\n    | _ :: tl -> dudu j tl\n  and wa i j = v.(i) <- j; dudu j g.(i)\n  and doit i =\n    if i < n then (if v.(i) = (-1) then wa i i; doit (i + 1))\n  in\n  doit 0;\n  v\n\nlet () =\n  match f () with\n  | [n;m] -> begin\n      let g = Array.make n [] in\n      let rec read i =\n        if i < m then\n          match f () with\n          | [s;t] -> begin\n              g.(s) <- t :: g.(s);\n              g.(t) <- s :: g.(t);\n              read (i + 1)\n            end\n          | _ -> exit 1\n      in\n      read 0;\n      let v = dfs g n in\n      let q = read_int () in\n      let rec read_q i =\n        if i < q then begin\n          match f () with\n          | [s;t] -> begin\n              print_endline (if v.(s) = v.(t) then \"yes\" else \"no\");\n              read_q (i + 1)\n            end\n          | _ -> exit 1\n        end\n      in\n      read_q 0\n    end\n  | _ -> exit 1", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1390, "cpu_time_ms": 40, "memory_kb": 14028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s809436895", "group_id": "codeNet:p02240", "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 ->\n      let s1 = sub s 0 i in\n      doit s1 (sub s (i + 1) (length s - length s1 - 1) :: acc)\n  in doit str []\n\nlet read_ints () = List.map int_of_string (split (read_line ()) ' ')\n\nlet dfs g n =\n  let v = Array.make n (-1) in\n  let rec doit i =\n    if i < n then (if v.(i) = (-1) then dudu i i; doit (i + 1))\n  and dudu i j =\n    v.(i) <- j;\n    wa j g.(i)\n  and wa j = function\n    | [] -> ()\n    | hd :: tl when v.(hd) = (-1) -> (dudu hd j; wa j tl)\n    | _ :: tl -> wa j tl\n  in doit 0;\n  v\n\nlet solve n m =\n  let g = Array.make n [] in\n  let rec read i =\n    if i < m then\n      begin match read_ints () with\n      | [s;t] ->\n        g.(s) <- t :: g.(s);\n        g.(t) <- s :: g.(t);\n        read (i + 1)\n      | _ -> exit 1\n      end in\n  read 0;\n  let v = dfs g n in\n  let q = read_int () in\n  let rec read_q i =\n    if i < q then\n      begin match read_ints () with\n      | [s;t] ->\n        print_endline (if v.(s) = v.(t) then \"yes\" else \"no\");\n        read_q (i + 1)\n      | _ -> exit 1\n      end in\n  read_q 0\n\nlet () =\n  match read_ints () with\n  | [n;m] -> solve n m\n  | _ -> exit 1", "language": "OCaml", "metadata": {"date": 1475493494, "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/s809436895.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s809436895", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nno\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 ->\n      let s1 = sub s 0 i in\n      doit s1 (sub s (i + 1) (length s - length s1 - 1) :: acc)\n  in doit str []\n\nlet read_ints () = List.map int_of_string (split (read_line ()) ' ')\n\nlet dfs g n =\n  let v = Array.make n (-1) in\n  let rec doit i =\n    if i < n then (if v.(i) = (-1) then dudu i i; doit (i + 1))\n  and dudu i j =\n    v.(i) <- j;\n    wa j g.(i)\n  and wa j = function\n    | [] -> ()\n    | hd :: tl when v.(hd) = (-1) -> (dudu hd j; wa j tl)\n    | _ :: tl -> wa j tl\n  in doit 0;\n  v\n\nlet solve n m =\n  let g = Array.make n [] in\n  let rec read i =\n    if i < m then\n      begin match read_ints () with\n      | [s;t] ->\n        g.(s) <- t :: g.(s);\n        g.(t) <- s :: g.(t);\n        read (i + 1)\n      | _ -> exit 1\n      end in\n  read 0;\n  let v = dfs g n in\n  let q = read_int () in\n  let rec read_q i =\n    if i < q then\n      begin match read_ints () with\n      | [s;t] ->\n        print_endline (if v.(s) = v.(t) then \"yes\" else \"no\");\n        read_q (i + 1)\n      | _ -> exit 1\n      end in\n  read_q 0\n\nlet () =\n  match read_ints () with\n  | [n;m] -> solve n m\n  | _ -> exit 1", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1264, "cpu_time_ms": 30, "memory_kb": 14076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s536317773", "group_id": "codeNet:p02243", "input_text": "module MakeBinaryHeap (M : sig type t val compare : t -> t -> int end) = struct\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 ret = t.node.(1) in\n    t.node.(1) <- t.node.(t.size);\n    t.size <- t.size - 1;\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 begin\n        let tmp = t.node.(i) in t.node.(i) <- t.node.(m); t.node.(m) <- tmp;\n        max_heapify m\n      end in\n    max_heapify 1;\n    ret\n\n  let push x t =\n    t.size <- t.size + 1;\n    t.node.(t.size) <- x;\n    let parent i = int_of_float (floor (float_of_int i) /. 2.) in\n    let rec doit i =\n      if i > 1 && M.compare t.node.(parent i) t.node.(i) < 0 then begin\n        let tmp = t.node.(i) in t.node.(i) <- t.node.(parent i); t.node.(parent i) <- tmp;\n        doit (parent i)\n      end in\n    doit t.size\nend\n\nmodule H = MakeBinaryHeap(struct type t = (int * int) let compare x y = fst x - fst y end)\n\nlet dijkstra g n =\n  let h = H.make 100000 (0, 0) in\n  let d = Array.make n max_int in\n  let b = Array.make n false in\n  d.(0) <- 0;\n  b.(0) <- true;\n  H.push (0, 0) h;\n  let rec doit () =\n    if not (H.empty_p h) then begin\n      let (x, u) = H.pop h in\n      b.(u) <- true;\n      if d.(u) >= (-x) then duduwa u g.(u);\n      doit ()\n    end\n  and duduwa u = function\n    | [] -> ()\n    | (v, _) :: tl when b.(v) = true -> duduwa u tl\n    | (v, c) :: tl when d.(v) <= d.(u) + c -> duduwa u tl\n    | (v, c) :: tl ->\n      begin\n        d.(v) <- d.(u) + c;\n        H.push ((-d.(v)), v) h;\n        duduwa u tl\n      end in\n  doit ();\n  d\n\nlet rec make_pair acc = function\n  | [] -> acc\n  | f :: t :: tl -> make_pair ((f, t) :: acc) tl\n  | _ -> exit 1\n\nlet () =\n  let n = read_int () in\n  let g = Array.make n [] in\n  let rec read i =\n    if i < n then\n      match List.map int_of_string (Str.split (Str.regexp \" \") (read_line ())) with\n      | u :: _ :: l -> (g.(u) <- make_pair [] l; read (i + 1))\n      | _ -> exit 1\n  in read 0;\n  Array.iteri (fun i e -> Printf.printf \"%d %d\\n\" i e) (dijkstra g n)", "language": "OCaml", "metadata": {"date": 1475571057, "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/s536317773.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536317773", "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  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 ret = t.node.(1) in\n    t.node.(1) <- t.node.(t.size);\n    t.size <- t.size - 1;\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 begin\n        let tmp = t.node.(i) in t.node.(i) <- t.node.(m); t.node.(m) <- tmp;\n        max_heapify m\n      end in\n    max_heapify 1;\n    ret\n\n  let push x t =\n    t.size <- t.size + 1;\n    t.node.(t.size) <- x;\n    let parent i = int_of_float (floor (float_of_int i) /. 2.) in\n    let rec doit i =\n      if i > 1 && M.compare t.node.(parent i) t.node.(i) < 0 then begin\n        let tmp = t.node.(i) in t.node.(i) <- t.node.(parent i); t.node.(parent i) <- tmp;\n        doit (parent i)\n      end in\n    doit t.size\nend\n\nmodule H = MakeBinaryHeap(struct type t = (int * int) let compare x y = fst x - fst y end)\n\nlet dijkstra g n =\n  let h = H.make 100000 (0, 0) in\n  let d = Array.make n max_int in\n  let b = Array.make n false in\n  d.(0) <- 0;\n  b.(0) <- true;\n  H.push (0, 0) h;\n  let rec doit () =\n    if not (H.empty_p h) then begin\n      let (x, u) = H.pop h in\n      b.(u) <- true;\n      if d.(u) >= (-x) then duduwa u g.(u);\n      doit ()\n    end\n  and duduwa u = function\n    | [] -> ()\n    | (v, _) :: tl when b.(v) = true -> duduwa u tl\n    | (v, c) :: tl when d.(v) <= d.(u) + c -> duduwa u tl\n    | (v, c) :: tl ->\n      begin\n        d.(v) <- d.(u) + c;\n        H.push ((-d.(v)), v) h;\n        duduwa u tl\n      end in\n  doit ();\n  d\n\nlet rec make_pair acc = function\n  | [] -> acc\n  | f :: t :: tl -> make_pair ((f, t) :: acc) tl\n  | _ -> exit 1\n\nlet () =\n  let n = read_int () in\n  let g = Array.make n [] in\n  let rec read i =\n    if i < n then\n      match List.map int_of_string (Str.split (Str.regexp \" \") (read_line ())) with\n      | u :: _ :: l -> (g.(u) <- make_pair [] l; read (i + 1))\n      | _ -> exit 1\n  in read 0;\n  Array.iteri (fun i e -> Printf.printf \"%d %d\\n\" i e) (dijkstra g n)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2336, "cpu_time_ms": 140, "memory_kb": 30764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s737475811", "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 5000 (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": 1500465609, "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/s737475811.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s737475811", "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 5000 (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2488, "cpu_time_ms": 90, "memory_kb": 29748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s864686681", "group_id": "codeNet:p02246", "input_text": "let area =\n  [| [1; 3]; [0; 2; 4]; [1; 5]\n   ; [0; 4; 6]; [1; 3; 5; 7]; [2; 4; 8]\n   ; [3; 7]; [4; 6; 8]; [5; 7] |]\n\nlet md = Array.make_matrix 9 9 0\n\nlet initialize_md () =\n  for i = 0 to 7 do\n    for j = 0 to 8 do\n      md.(i+1).(j) <- abs (i / 3 - j / 3) + abs (i mod 3 - j mod 3)\n    done\n  done\n\nlet idastar a limit space_i lower goal =\n  let rec doit i space_i moved lower =\n    if i = limit then begin\n      if a = goal then begin\n        List.length moved - 1 |> Printf.printf \"%d\\n\"; exit 0\n      end;\n    end else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = List.hd moved then () else\n        let lower = lower - md.(x).(j) + md.(x).(space_i) in\n        if lower + i > limit then ()\n        else begin\n          a.(j) <- 0;\n          a.(space_i) <- x;\n          doit (i + 1) j (x :: moved) lower;\n          a.(j) <- x;\n          a.(space_i) <- 0;\n        end) area.(space_i) in\n  doit 0 space_i [-1] lower\n\nlet () =\n  initialize_md ();\n  let a = Array.init 9 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let rec f i =\n    if i = 9 then assert false\n    else if a.(i) = 0 then i\n    else f (i + 1) in\n  let space_i = f 0 in\n  let rec g i acc =\n    if i = 9 then acc\n    else g (i + 1) (acc + md.(a.(i)).(i)) in\n  let lower = g 0 0 in\n  let goal = [|1; 2; 3; 4; 5; 6; 7; 8; 0|] in\n  for limit = lower to 31 do\n    idastar a limit space_i lower goal;\n  done", "language": "OCaml", "metadata": {"date": 1500517812, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02246.html", "problem_id": "p02246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02246/input.txt", "sample_output_relpath": "derived/input_output/data/p02246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02246/OCaml/s864686681.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s864686681", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let area =\n  [| [1; 3]; [0; 2; 4]; [1; 5]\n   ; [0; 4; 6]; [1; 3; 5; 7]; [2; 4; 8]\n   ; [3; 7]; [4; 6; 8]; [5; 7] |]\n\nlet md = Array.make_matrix 9 9 0\n\nlet initialize_md () =\n  for i = 0 to 7 do\n    for j = 0 to 8 do\n      md.(i+1).(j) <- abs (i / 3 - j / 3) + abs (i mod 3 - j mod 3)\n    done\n  done\n\nlet idastar a limit space_i lower goal =\n  let rec doit i space_i moved lower =\n    if i = limit then begin\n      if a = goal then begin\n        List.length moved - 1 |> Printf.printf \"%d\\n\"; exit 0\n      end;\n    end else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = List.hd moved then () else\n        let lower = lower - md.(x).(j) + md.(x).(space_i) in\n        if lower + i > limit then ()\n        else begin\n          a.(j) <- 0;\n          a.(space_i) <- x;\n          doit (i + 1) j (x :: moved) lower;\n          a.(j) <- x;\n          a.(space_i) <- 0;\n        end) area.(space_i) in\n  doit 0 space_i [-1] lower\n\nlet () =\n  initialize_md ();\n  let a = Array.init 9 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let rec f i =\n    if i = 9 then assert false\n    else if a.(i) = 0 then i\n    else f (i + 1) in\n  let space_i = f 0 in\n  let rec g i acc =\n    if i = 9 then acc\n    else g (i + 1) (acc + md.(a.(i)).(i)) in\n  let lower = g 0 0 in\n  let goal = [|1; 2; 3; 4; 5; 6; 7; 8; 0|] in\n  for limit = lower to 31 do\n    idastar a limit space_i lower goal;\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "sample_input": "1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02246", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1388, "cpu_time_ms": 40, "memory_kb": 4296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s257151611", "group_id": "codeNet:p02246", "input_text": "let (n1, n2) = (4, 16)\n\nlet area =\n  [| [1; 4]; [0; 2; 5]; [1; 3; 6]; [2; 7]\n   ; [0; 5; 8]; [1; 4; 6; 9]; [2; 5; 7; 10]; [3; 6; 11]\n   ; [4; 9; 12]; [5; 8; 10; 13]; [6; 9; 11; 14]; [7; 10; 15]\n   ; [8; 13]; [9; 12; 14]; [10; 13; 15]; [11; 14] |]\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet idastar a limit space_i lower goal =\n  let rec doit i space_i moved lower =\n    if i = limit then begin\n      if a = goal then begin\n        Printf.printf \"%d\\n\" (List.length moved - 1);\n        exit 0;\n      end\n    end else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = List.hd moved then () else\n        let lower = lower - md.(x).(j) + md.(x).(space_i) in\n        if lower + i > limit then ()\n        else\n          a.(j) <- 0;\n          a.(space_i) <- x;\n          doit (i + 1) j (x :: moved) lower;\n          a.(j) <- x;\n          a.(space_i) <- 0) area.(space_i) in\n  doit 0 space_i [-1] lower\n\nlet () =\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let rec f i =\n    if i = n2 then assert false\n    else if a.(i) = 0 then i\n    else f (i + 1) in\n  let space_i = f 0 in\n  let rec g i acc =\n    if i = n2 then acc\n    else g (i + 1) (acc + md.(a.(i)).(i)) in\n  let lower = g 0 0 in\n  let goal = [|1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 12; 13; 14; 15; 0|] in\n  for limit = lower to 45 do\n    idastar a limit space_i lower goal\n  done", "language": "OCaml", "metadata": {"date": 1500550874, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02246.html", "problem_id": "p02246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02246/input.txt", "sample_output_relpath": "derived/input_output/data/p02246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02246/OCaml/s257151611.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s257151611", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let (n1, n2) = (4, 16)\n\nlet area =\n  [| [1; 4]; [0; 2; 5]; [1; 3; 6]; [2; 7]\n   ; [0; 5; 8]; [1; 4; 6; 9]; [2; 5; 7; 10]; [3; 6; 11]\n   ; [4; 9; 12]; [5; 8; 10; 13]; [6; 9; 11; 14]; [7; 10; 15]\n   ; [8; 13]; [9; 12; 14]; [10; 13; 15]; [11; 14] |]\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet idastar a limit space_i lower goal =\n  let rec doit i space_i moved lower =\n    if i = limit then begin\n      if a = goal then begin\n        Printf.printf \"%d\\n\" (List.length moved - 1);\n        exit 0;\n      end\n    end else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = List.hd moved then () else\n        let lower = lower - md.(x).(j) + md.(x).(space_i) in\n        if lower + i > limit then ()\n        else\n          a.(j) <- 0;\n          a.(space_i) <- x;\n          doit (i + 1) j (x :: moved) lower;\n          a.(j) <- x;\n          a.(space_i) <- 0) area.(space_i) in\n  doit 0 space_i [-1] lower\n\nlet () =\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let rec f i =\n    if i = n2 then assert false\n    else if a.(i) = 0 then i\n    else f (i + 1) in\n  let space_i = f 0 in\n  let rec g i acc =\n    if i = n2 then acc\n    else g (i + 1) (acc + md.(a.(i)).(i)) in\n  let lower = g 0 0 in\n  let goal = [|1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 12; 13; 14; 15; 0|] in\n  for limit = lower to 45 do\n    idastar a limit space_i lower goal\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "sample_input": "1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02246", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1552, "cpu_time_ms": 20000, "memory_kb": 4544}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s255532915", "group_id": "codeNet:p02246", "input_text": "let (n1, n2, n_limit) = (4, 16, 45)\n\nlet area =\n  [| [1; 4]; [0; 2; 5]; [1; 3; 6]; [2; 7]\n   ; [0; 5; 8]; [1; 4; 6; 9]; [2; 5; 7; 10]; [3; 6; 11]\n   ; [4; 9; 12]; [5; 8; 10; 13]; [6; 9; 11; 14]; [7; 10; 15]\n   ; [8; 13]; [9; 12; 14]; [10; 13; 15]; [11; 14] |]\n\nlet goal = Array.init n2 (fun i -> (i + 1) mod n2)\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet idastar a limit space lower =\n  let rec doit i space moved lower =\n    if i = limit then begin\n      if a = goal then begin\n        List.length moved - 1 |> Printf.printf \"%d\\n\";\n        exit 0;\n      end\n    end else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = List.hd moved then () else\n        let lower = lower - md.(x).(j) + md.(x).(space) in\n        if lower + i > limit then ()\n        else begin\n          a.(j) <- 0;\n          a.(space) <- x;\n          doit (i + 1) j (x :: moved) lower;\n          a.(j) <- x;\n          a.(space) <- 0;\n        end) area.(space) in\n  doit 0 space [-1] lower\n\nlet () =\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let rec findi i =\n    if i = n2 then assert false\n    else if a.(i) = 0 then i\n    else findi (i + 1) in\n  let space = findi 0 in\n  let lower =\n    Array.fold_left (fun (i, sum) e -> (i + 1, sum + md.(e).(i))) (0, 0) a |> snd in\n  for limit = lower to n_limit do\n    idastar a limit space lower\n  done", "language": "OCaml", "metadata": {"date": 1500691308, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02246.html", "problem_id": "p02246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02246/input.txt", "sample_output_relpath": "derived/input_output/data/p02246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02246/OCaml/s255532915.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s255532915", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let (n1, n2, n_limit) = (4, 16, 45)\n\nlet area =\n  [| [1; 4]; [0; 2; 5]; [1; 3; 6]; [2; 7]\n   ; [0; 5; 8]; [1; 4; 6; 9]; [2; 5; 7; 10]; [3; 6; 11]\n   ; [4; 9; 12]; [5; 8; 10; 13]; [6; 9; 11; 14]; [7; 10; 15]\n   ; [8; 13]; [9; 12; 14]; [10; 13; 15]; [11; 14] |]\n\nlet goal = Array.init n2 (fun i -> (i + 1) mod n2)\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet idastar a limit space lower =\n  let rec doit i space moved lower =\n    if i = limit then begin\n      if a = goal then begin\n        List.length moved - 1 |> Printf.printf \"%d\\n\";\n        exit 0;\n      end\n    end else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = List.hd moved then () else\n        let lower = lower - md.(x).(j) + md.(x).(space) in\n        if lower + i > limit then ()\n        else begin\n          a.(j) <- 0;\n          a.(space) <- x;\n          doit (i + 1) j (x :: moved) lower;\n          a.(j) <- x;\n          a.(space) <- 0;\n        end) area.(space) in\n  doit 0 space [-1] lower\n\nlet () =\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let rec findi i =\n    if i = n2 then assert false\n    else if a.(i) = 0 then i\n    else findi (i + 1) in\n  let space = findi 0 in\n  let lower =\n    Array.fold_left (fun (i, sum) e -> (i + 1, sum + md.(e).(i))) (0, 0) a |> snd in\n  for limit = lower to n_limit do\n    idastar a limit space lower\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "sample_input": "1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02246", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1541, "cpu_time_ms": 200, "memory_kb": 4496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s981585794", "group_id": "codeNet:p02246", "input_text": "let (n1, n2, n_limit) = (4, 16, 45)\n\nlet area =\n  [| [1; 4]; [0; 2; 5]; [1; 3; 6]; [2; 7]\n   ; [0; 5; 8]; [1; 4; 6; 9]; [2; 5; 7; 10]; [3; 6; 11]\n   ; [4; 9; 12]; [5; 8; 10; 13]; [6; 9; 11; 14]; [7; 10; 15]\n   ; [8; 13]; [9; 12; 14]; [10; 13; 15]; [11; 14] |]\n\nlet goal = Array.init n2 (fun i -> (i + 1) mod n2)\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet idastar a limit space lower =\n  let rec doit i space moved lower =\n    if i = limit then\n      if a <> goal then ()\n      else begin\n        Printf.printf \"%d\\n\" limit;\n        exit 0;\n      end\n    else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = moved then ()\n        else\n          let lower = lower - md.(x).(j) + md.(x).(space) in\n          if lower + i > limit then ()\n          else begin\n            a.(j) <- 0;\n            a.(space) <- x;\n            doit (i + 1) j x lower;\n            a.(j) <- x;\n            a.(space) <- 0;\n          end)\n      area.(space) in\n  doit 0 space (-1) lower\n\nlet findi a x =\n  let n = Array.length a in\n  let rec doit i =\n    if i = n then assert false\n    else if a.(i) = x then i\n    else doit (i + 1) in\n  doit 0\n\nlet () =\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let space = findi a 0 in\n  let lower =\n    Array.fold_left (fun (i, sum) e -> (i + 1, sum + md.(e).(i))) (0, 0) a |> snd in\n  for limit = lower to n_limit do\n    idastar a limit space lower\n  done", "language": "OCaml", "metadata": {"date": 1500694759, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02246.html", "problem_id": "p02246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02246/input.txt", "sample_output_relpath": "derived/input_output/data/p02246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02246/OCaml/s981585794.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981585794", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let (n1, n2, n_limit) = (4, 16, 45)\n\nlet area =\n  [| [1; 4]; [0; 2; 5]; [1; 3; 6]; [2; 7]\n   ; [0; 5; 8]; [1; 4; 6; 9]; [2; 5; 7; 10]; [3; 6; 11]\n   ; [4; 9; 12]; [5; 8; 10; 13]; [6; 9; 11; 14]; [7; 10; 15]\n   ; [8; 13]; [9; 12; 14]; [10; 13; 15]; [11; 14] |]\n\nlet goal = Array.init n2 (fun i -> (i + 1) mod n2)\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet idastar a limit space lower =\n  let rec doit i space moved lower =\n    if i = limit then\n      if a <> goal then ()\n      else begin\n        Printf.printf \"%d\\n\" limit;\n        exit 0;\n      end\n    else\n      List.iter (fun j ->\n        let x = a.(j) in\n        if x = moved then ()\n        else\n          let lower = lower - md.(x).(j) + md.(x).(space) in\n          if lower + i > limit then ()\n          else begin\n            a.(j) <- 0;\n            a.(space) <- x;\n            doit (i + 1) j x lower;\n            a.(j) <- x;\n            a.(space) <- 0;\n          end)\n      area.(space) in\n  doit 0 space (-1) lower\n\nlet findi a x =\n  let n = Array.length a in\n  let rec doit i =\n    if i = n then assert false\n    else if a.(i) = x then i\n    else doit (i + 1) in\n  doit 0\n\nlet () =\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let space = findi a 0 in\n  let lower =\n    Array.fold_left (fun (i, sum) e -> (i + 1, sum + md.(e).(i))) (0, 0) a |> snd in\n  for limit = lower to n_limit do\n    idastar a limit space lower\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "sample_input": "1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02246", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1593, "cpu_time_ms": 170, "memory_kb": 4500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s726418929", "group_id": "codeNet:p02246", "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\ntype puzzle = { board : int array; space : int; moved: int; lower : int; turn : int }\ntype ss = { puzzle : puzzle; estimated : int }\n\nmodule H = MakeBinaryHeap(struct type t = ss let compare x y = y.estimated - x.estimated end)\n\nlet (n1, n2) = (4, 16)\n\nlet goal = Array.init n2 (fun i -> (i + 1) mod n2)\n\nlet area = Array.make n2 []\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_area () =\n  for i = 0 to n2 - 1 do\n    let lst = [] in\n    let lst = if i + n1 < n2 then (i + n1) :: lst else lst in\n    let lst = if (i + 1) mod n1 <> 0 then (i + 1) :: lst else lst in\n    let lst = if i - 1 >= 0 && (i - 1) mod n1 <> n1 - 1 then (i - 1) :: lst else lst in\n    let lst = if i - n1 >= 0 then (i - n1) :: lst else lst in\n    area.(i) <- lst;\n  done\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet astar board space lower =\n  let reached_p = Hashtbl.create ~random:true 100000 in\n  let que = H.make 1000000 { puzzle = { board=[||]; space=0; moved=0; lower=0; turn=0 }; estimated = 0} in\n  H.push { puzzle = { board; space; moved=(-1); lower; turn=0 }; estimated = lower } que;\n  while not (H.empty_p que) do\n    let ss = H.pop que in\n    let { puzzle = pzl } = ss in\n    if pzl.lower = 0 then begin\n      Printf.printf \"%d\\n\" pzl.turn;\n      exit 0;\n    end else begin\n      Hashtbl.add reached_p { board=Array.copy pzl.board; space=pzl.space; moved=pzl.moved; lower=pzl.lower; turn=pzl.turn; } true;\n      List.iter (fun j ->\n        let x = pzl.board.(j) in\n        if x = pzl.moved then ()\n        else begin\n          let lower = pzl.lower - md.(x).(j) + md.(x).(pzl.space) in\n          let board = Array.copy pzl.board in\n          board.(j) <- 0;\n          board.(pzl.space) <- x;\n          if not (Hashtbl.mem reached_p { board; space = j; moved = x; lower; turn=pzl.turn }) then begin\n            let pzl = { board; space = j; moved = x; lower; turn = pzl.turn + 1 } in\n            H.push { puzzle = pzl; estimated = pzl.turn + pzl.lower } que;\n          end;\n        end)\n      area.(pzl.space);\n    end\n  done;\n  assert false\n\nlet findi a x =\n  let n = Array.length a in\n  let rec doit i =\n    if i = n then assert false\n    else if a.(i) = x then i\n    else doit (i + 1) in\n  doit 0\n\nlet () =\n  initialize_area ();\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let space = findi a 0 in\n  Array.fold_left (fun (i, sum) e -> (i + 1, sum + md.(e).(i))) (0, 0) a\n  |> snd\n  |> astar a space", "language": "OCaml", "metadata": {"date": 1500714080, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02246.html", "problem_id": "p02246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02246/input.txt", "sample_output_relpath": "derived/input_output/data/p02246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02246/OCaml/s726418929.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s726418929", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\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\ntype puzzle = { board : int array; space : int; moved: int; lower : int; turn : int }\ntype ss = { puzzle : puzzle; estimated : int }\n\nmodule H = MakeBinaryHeap(struct type t = ss let compare x y = y.estimated - x.estimated end)\n\nlet (n1, n2) = (4, 16)\n\nlet goal = Array.init n2 (fun i -> (i + 1) mod n2)\n\nlet area = Array.make n2 []\n\nlet md = Array.make_matrix n2 n2 0\n\nlet initialize_area () =\n  for i = 0 to n2 - 1 do\n    let lst = [] in\n    let lst = if i + n1 < n2 then (i + n1) :: lst else lst in\n    let lst = if (i + 1) mod n1 <> 0 then (i + 1) :: lst else lst in\n    let lst = if i - 1 >= 0 && (i - 1) mod n1 <> n1 - 1 then (i - 1) :: lst else lst in\n    let lst = if i - n1 >= 0 then (i - n1) :: lst else lst in\n    area.(i) <- lst;\n  done\n\nlet initialize_md () =\n  for i = 0 to n2 - 2 do\n    for j = 0 to n2 - 1 do\n      md.(i+1).(j) <- abs (i / n1 - j / n1) + abs (i mod n1 - j mod n1)\n    done\n  done\n\nlet astar board space lower =\n  let reached_p = Hashtbl.create ~random:true 100000 in\n  let que = H.make 1000000 { puzzle = { board=[||]; space=0; moved=0; lower=0; turn=0 }; estimated = 0} in\n  H.push { puzzle = { board; space; moved=(-1); lower; turn=0 }; estimated = lower } que;\n  while not (H.empty_p que) do\n    let ss = H.pop que in\n    let { puzzle = pzl } = ss in\n    if pzl.lower = 0 then begin\n      Printf.printf \"%d\\n\" pzl.turn;\n      exit 0;\n    end else begin\n      Hashtbl.add reached_p { board=Array.copy pzl.board; space=pzl.space; moved=pzl.moved; lower=pzl.lower; turn=pzl.turn; } true;\n      List.iter (fun j ->\n        let x = pzl.board.(j) in\n        if x = pzl.moved then ()\n        else begin\n          let lower = pzl.lower - md.(x).(j) + md.(x).(pzl.space) in\n          let board = Array.copy pzl.board in\n          board.(j) <- 0;\n          board.(pzl.space) <- x;\n          if not (Hashtbl.mem reached_p { board; space = j; moved = x; lower; turn=pzl.turn }) then begin\n            let pzl = { board; space = j; moved = x; lower; turn = pzl.turn + 1 } in\n            H.push { puzzle = pzl; estimated = pzl.turn + pzl.lower } que;\n          end;\n        end)\n      area.(pzl.space);\n    end\n  done;\n  assert false\n\nlet findi a x =\n  let n = Array.length a in\n  let rec doit i =\n    if i = n then assert false\n    else if a.(i) = x then i\n    else doit (i + 1) in\n  doit 0\n\nlet () =\n  initialize_area ();\n  initialize_md ();\n  let a = Array.init n2 (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let space = findi a 0 in\n  Array.fold_left (fun (i, sum) e -> (i + 1, sum + md.(e).(i))) (0, 0) a\n  |> snd\n  |> astar a space", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "sample_input": "1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02246", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3819, "cpu_time_ms": 20, "memory_kb": 21640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s596141901", "group_id": "codeNet:p02248", "input_text": "let bm_search x y n m =\n  let t = Array.init 256 (fun _ -> m) in\n  String.iteri (fun i c -> t.(Char.code c) <- m - 1 - i) y;\n  let rec scan i j =\n    if x.[i] <> y.[j] then doit (i + max t.(Char.code x.[i]) (m - j))\n    else if j = 0 then Some i\n    else scan (i - 1) (j - 1)\n  and doit i =\n    if i >= n then None\n    else scan i (m - 1)\n  in doit (m - 1)\n\nlet () =\n  let x = read_line () in\n  let y = read_line () in\n  let m = String.length y in\n  let rec doit i x n =\n    if n < m then ()\n    else\n      match bm_search x y n m with\n      | None -> ()\n      | Some j ->\n        begin\n          Printf.printf \"%d\\n\" (i + j);\n          let s = String.sub x (j + 1) (n - (j + 1)) in\n          doit (i + j + 1) s (String.length s)\n        end in\n  doit 0 x (String.length x)", "language": "OCaml", "metadata": {"date": 1475754911, "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/s596141901.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s596141901", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n3\n4\n", "input_to_evaluate": "let bm_search x y n m =\n  let t = Array.init 256 (fun _ -> m) in\n  String.iteri (fun i c -> t.(Char.code c) <- m - 1 - i) y;\n  let rec scan i j =\n    if x.[i] <> y.[j] then doit (i + max t.(Char.code x.[i]) (m - j))\n    else if j = 0 then Some i\n    else scan (i - 1) (j - 1)\n  and doit i =\n    if i >= n then None\n    else scan i (m - 1)\n  in doit (m - 1)\n\nlet () =\n  let x = read_line () in\n  let y = read_line () in\n  let m = String.length y in\n  let rec doit i x n =\n    if n < m then ()\n    else\n      match bm_search x y n m with\n      | None -> ()\n      | Some j ->\n        begin\n          Printf.printf \"%d\\n\" (i + j);\n          let s = String.sub x (j + 1) (n - (j + 1)) in\n          doit (i + j + 1) s (String.length s)\n        end in\n  doit 0 x (String.length x)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 773, "cpu_time_ms": 8910, "memory_kb": 16544}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s697180545", "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": 1476128998, "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/s697180545.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s697180545", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 230, "memory_kb": 46352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s871383118", "group_id": "codeNet:p02250", "input_text": "let 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 () =\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      begin match\n        try Some (Str.search_forward (Str.regexp p) t sa.(r)) with _ -> None\n      with\n      | None -> Printf.printf \"0\\n\"\n      | _ -> Printf.printf \"1\\n\"\n      end;\n      doit (i + 1)\n    end in\n  doit 0", "language": "OCaml", "metadata": {"date": 1476172973, "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/s871383118.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s871383118", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1\n1\n0\n0\n", "input_to_evaluate": "let 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 () =\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      begin match\n        try Some (Str.search_forward (Str.regexp p) t sa.(r)) with _ -> None\n      with\n      | None -> Printf.printf \"0\\n\"\n      | _ -> Printf.printf \"1\\n\"\n      end;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1398, "cpu_time_ms": 20000, "memory_kb": 84556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s769975345", "group_id": "codeNet:p02250", "input_text": "exception Not_equal of int\n\nlet rank = Array.make 1000001 0\nlet tmp = Array.make 1000001 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 rec doit k =\n    if k > n then ()\n    else begin\n      Array.fast_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      doit (2 * k)\n    end in\n  doit 1;\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 rec doit l r =\n      if r - l <= 1 then l\n      else\n        let m = (l + r) / 2 in\n        if range_cmp t n sa.(m) p k <= 0 then doit m r\n        else doit l m in\n    let l = doit 0 (n + 1) in\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": 1500893081, "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/s769975345.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s769975345", "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 1000001 0\nlet tmp = Array.make 1000001 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 rec doit k =\n    if k > n then ()\n    else begin\n      Array.fast_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      doit (2 * k)\n    end in\n  doit 1;\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 rec doit l r =\n      if r - l <= 1 then l\n      else\n        let m = (l + r) / 2 in\n        if range_cmp t n sa.(m) p k <= 0 then doit m r\n        else doit l m in\n    let l = doit 0 (n + 1) in\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4290, "memory_kb": 75500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s775778682", "group_id": "codeNet:p02257", "input_text": "let rec range x y = if x > y then [] else x :: range (x+1) y\n\nlet isPrime n =\n  if n = 2 then true\n  else\n    range 2 (n-1)\n      |> List.map (fun x -> n mod x = 0)\n      |> List.for_all (fun x -> not x)\n\nlet () =\n  let counter = ref 0 in\n  let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  for i = 1 to n do\n    let m = Scanf.scanf \"%d\\n\" (fun x -> x) in\n    if isPrime m then counter := !counter + 1 else ();\n  done;\n  Printf.printf \"%d\\n\" !counter\n\n      ", "language": "OCaml", "metadata": {"date": 1465784022, "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/s775778682.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s775778682", "user_id": "u269488240"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let rec range x y = if x > y then [] else x :: range (x+1) y\n\nlet isPrime n =\n  if n = 2 then true\n  else\n    range 2 (n-1)\n      |> List.map (fun x -> n mod x = 0)\n      |> List.for_all (fun x -> not x)\n\nlet () =\n  let counter = ref 0 in\n  let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  for i = 1 to n do\n    let m = Scanf.scanf \"%d\\n\" (fun x -> x) in\n    if isPrime m then counter := !counter + 1 else ();\n  done;\n  Printf.printf \"%d\\n\" !counter\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2240, "memory_kb": 15164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s534178041", "group_id": "codeNet:p02258", "input_text": "let () =\n  let n = read_int () in\n  let rec loop mv md = function\n      0 -> md\n    | i ->\n      let v = read_int () in\n      let d = v - mv in\n      loop (if v < mv then v else mv) (if d > md then d else md) (i-1)\n  in\n  let x = loop (read_int ()) min_int (n-1) in\n  Printf.printf \"%d\\n\" x", "language": "OCaml", "metadata": {"date": 1476877017, "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/s534178041.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s534178041", "user_id": "u995793569"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  let n = read_int () in\n  let rec loop mv md = function\n      0 -> md\n    | i ->\n      let v = read_int () in\n      let d = v - mv in\n      loop (if v < mv then v else mv) (if d > md then d else md) (i-1)\n  in\n  let x = loop (read_int ()) min_int (n-1) in\n  Printf.printf \"%d\\n\" x", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 4396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s471318311", "group_id": "codeNet:p02258", "input_text": "let () =\n  let n = read_int () in\n  let ans = ref min_int in\n  let m = ref (read_int ()) in\n  for _ = 1 to n - 1 do\n    let r = read_int () in\n    if !ans < (r - !m) then ans := r - !m;\n    if r < !m then m := r;\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1499323249, "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/s471318311.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s471318311", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  let n = read_int () in\n  let ans = ref min_int in\n  let m = ref (read_int ()) in\n  for _ = 1 to n - 1 do\n    let r = read_int () in\n    if !ans < (r - !m) then ans := r - !m;\n    if r < !m then m := r;\n  done;\n  Printf.printf \"%d\\n\" !ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 10, "memory_kb": 4452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s263575102", "group_id": "codeNet:p02258", "input_text": "let () =\n  let m = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let minv = ref (Scanf.scanf \"%d\\n\" (fun x -> x)) in\n  let n, d = Scanf.scanf \"%d\\n\" (fun x -> x , x - !minv) in\n  let maxv = ref d in\n  if n < !minv then minv := n else ();\n  for i = 1 to m - 2 do\n    let num, diff = Scanf.scanf \"%d\\n\" (fun x -> x, x - !minv) in\n    if !maxv < diff then maxv := diff else ();\n    if num < !minv then minv := num else ();\n  done;\n  Printf.printf \"%d\\n\" !maxv;;\n", "language": "OCaml", "metadata": {"date": 1592981252, "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/s263575102.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263575102", "user_id": "u440841603"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  let m = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let minv = ref (Scanf.scanf \"%d\\n\" (fun x -> x)) in\n  let n, d = Scanf.scanf \"%d\\n\" (fun x -> x , x - !minv) in\n  let maxv = ref d in\n  if n < !minv then minv := n else ();\n  for i = 1 to m - 2 do\n    let num, diff = Scanf.scanf \"%d\\n\" (fun x -> x, x - !minv) in\n    if !maxv < diff then maxv := diff else ();\n    if num < !minv then minv := num else ();\n  done;\n  Printf.printf \"%d\\n\" !maxv;;\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 4548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s437379629", "group_id": "codeNet:p02264", "input_text": "let 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 print_result = List.iter (fun (s, t) -> Printf.printf \"%s %d\\n\" s t)\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [] | [_] -> exit 1\n  | n :: q :: _ -> begin\n      let que = Queue.create () in\n      let rec read i =\n        if i >= n then ()\n        else begin\n          match split (read_line ()) ' ' with\n          | [] | [_] -> exit 1\n          | s :: t :: _ -> (Queue.add (s, int_of_string t) que; read (i + 1))\n        end\n      in\n      read 0;\n      let rec doit cnt ret =\n        if Queue.is_empty que then List.rev ret\n        else begin\n          let (s, t) = Queue.take que in\n          let rest = t - q in\n          if rest > 0 then (Queue.add (s, rest) que; doit (cnt + q) ret)\n          else let x = cnt + t in doit x ((s, x) :: ret)\n        end\n      in\n      print_result (doit 0 [])\n    end", "language": "OCaml", "metadata": {"date": 1473009922, "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/s437379629.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437379629", "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.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 print_result = List.iter (fun (s, t) -> Printf.printf \"%s %d\\n\" s t)\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [] | [_] -> exit 1\n  | n :: q :: _ -> begin\n      let que = Queue.create () in\n      let rec read i =\n        if i >= n then ()\n        else begin\n          match split (read_line ()) ' ' with\n          | [] | [_] -> exit 1\n          | s :: t :: _ -> (Queue.add (s, int_of_string t) que; read (i + 1))\n        end\n      in\n      read 0;\n      let rec doit cnt ret =\n        if Queue.is_empty que then List.rev ret\n        else begin\n          let (s, t) = Queue.take que in\n          let rest = t - q in\n          if rest > 0 then (Queue.add (s, rest) que; doit (cnt + q) ret)\n          else let x = cnt + t in doit x ((s, x) :: ret)\n        end\n      in\n      print_result (doit 0 [])\n    end", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1183, "cpu_time_ms": 30, "memory_kb": 16300}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s892926474", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let que = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  let rec read i =\n    if i < n then (Scanf.scanf \"%s %d\\n\" (fun s t -> add (s, t) que); read (i + 1))\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 Printf.printf \"%s %d\\n\" s x; doit x)\n      else (add (s, rest) que; doit (cnt + q))\n    end\n  in\n  doit 0", "language": "OCaml", "metadata": {"date": 1474065128, "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/s892926474.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892926474", "user_id": "u809138450"}, "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 que = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  let rec read i =\n    if i < n then (Scanf.scanf \"%s %d\\n\" (fun s t -> add (s, t) que); read (i + 1))\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 Printf.printf \"%s %d\\n\" s x; doit x)\n      else (add (s, rest) que; doit (cnt + q))\n    end\n  in\n  doit 0", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 496, "cpu_time_ms": 40, "memory_kb": 13228}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s703419171", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let que = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  let rec read i =\n    if i < n then (Scanf.scanf \"%s %d\\n\" (fun s t -> add (s, t) que); read (i + 1))\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 Printf.printf \"%s %d\\n\" s x; doit x)\n      else (add (s, rest) que; doit (cnt + q))\n    end\n  in\n  doit 0", "language": "OCaml", "metadata": {"date": 1474065170, "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/s703419171.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s703419171", "user_id": "u809138450"}, "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 que = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  let rec read i =\n    if i < n then (Scanf.scanf \"%s %d\\n\" (fun s t -> add (s, t) que); read (i + 1))\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 Printf.printf \"%s %d\\n\" s x; doit x)\n      else (add (s, rest) que; doit (cnt + q))\n    end\n  in\n  doit 0", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 496, "cpu_time_ms": 30, "memory_kb": 13072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s133948648", "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 : (string * int) array\n  }\n\n  let capacity (t: (string * int) t) = t.mask + 1\n\n  let is_empty (t: (string * int) 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 (\"\",0)}\n\n  let enq (t: (string * int) t) (a: string * int) =\n    let (elems: (string * int) array) = t.elems in\n    elems.(t.index) <- a;\n    t.length <- t.length + 1;\n    t.index <- (t.index + 1) mod (capacity t)\n\n  let deq (t: (string * int) t) =\n    let (elems: (string * int) array) = t.elems in\n    let (front: int) = t.front in\n    let (res: string * int) = elems.(front) in\n    t.front <- (t.front + 1) mod (capacity t);\n    t.length <- t.length - 1;\n    res\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) = deq q 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": 1477242428, "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/s133948648.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s133948648", "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 : (string * int) array\n  }\n\n  let capacity (t: (string * int) t) = t.mask + 1\n\n  let is_empty (t: (string * int) 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 (\"\",0)}\n\n  let enq (t: (string * int) t) (a: string * int) =\n    let (elems: (string * int) array) = t.elems in\n    elems.(t.index) <- a;\n    t.length <- t.length + 1;\n    t.index <- (t.index + 1) mod (capacity t)\n\n  let deq (t: (string * int) t) =\n    let (elems: (string * int) array) = t.elems in\n    let (front: int) = t.front in\n    let (res: string * int) = elems.(front) in\n    t.front <- (t.front + 1) mod (capacity t);\n    t.length <- t.length - 1;\n    res\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) = deq q 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1369, "cpu_time_ms": 30, "memory_kb": 10616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s822596627", "group_id": "codeNet:p02264", "input_text": "type 'a t = {\n  mutable front : int;\n  mutable mask  : int;\n  mutable index : int;\n  mutable length : int;\n  mutable elems : (string * int) array\n}\n\nlet capacity (t: (string * int) t) = t.mask + 1\n\nlet is_empty (t: (string * int) t) = t.length = 0\n\nlet create ?(capacity=1) () =\n  { front = 0;\n    mask  = capacity - 1;\n    index = 0;\n    length = 0;\n    elems = Array.make capacity (\"\",0)}\n\nlet enq (t: (string * int) t) (a: string * int) =\n  let (elems: (string * int) array) = t.elems in\n  elems.(t.index) <- a;\n  t.length <- t.length + 1;\n  t.index <- if t.mask=t.index then 0 else t.index + 1\n\nlet deq (t: (string * int) t) =\n  let (elems: (string * int) array) = t.elems in\n  let (front: int) = t.front in\n  let (res: string * int) = elems.(front) in\n  t.front <- if t.mask=t.front then 0 else t.front+1;\n  t.length <- t.length - 1;\n  res\n\nlet () =\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) = deq q 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": 1477245053, "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/s822596627.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822596627", "user_id": "u995793569"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "type 'a t = {\n  mutable front : int;\n  mutable mask  : int;\n  mutable index : int;\n  mutable length : int;\n  mutable elems : (string * int) array\n}\n\nlet capacity (t: (string * int) t) = t.mask + 1\n\nlet is_empty (t: (string * int) t) = t.length = 0\n\nlet create ?(capacity=1) () =\n  { front = 0;\n    mask  = capacity - 1;\n    index = 0;\n    length = 0;\n    elems = Array.make capacity (\"\",0)}\n\nlet enq (t: (string * int) t) (a: string * int) =\n  let (elems: (string * int) array) = t.elems in\n  elems.(t.index) <- a;\n  t.length <- t.length + 1;\n  t.index <- if t.mask=t.index then 0 else t.index + 1\n\nlet deq (t: (string * int) t) =\n  let (elems: (string * int) array) = t.elems in\n  let (front: int) = t.front in\n  let (res: string * int) = elems.(front) in\n  t.front <- if t.mask=t.front then 0 else t.front+1;\n  t.length <- t.length - 1;\n  res\n\nlet () =\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) = deq q 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1287, "cpu_time_ms": 30, "memory_kb": 10476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s192028111", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let (que : (string * int) Queue.t) = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  for _ = 0 to n - 1 do\n    add (Scanf.scanf \"%s %d\\n\" (fun s t -> (s, t))) que\n  done;\n  let cnt = ref 0 in\n  while not (is_empty que) do\n    let (s, t) = take que in\n    let rest = t - q in\n    if rest > 0 then begin\n      add (s, rest) que;\n      cnt := !cnt + q;\n    end else begin\n      let x = !cnt + t in\n      Printf.printf \"%s %d\\n\" s x;\n      cnt := x;\n    end\n  done", "language": "OCaml", "metadata": {"date": 1499331406, "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/s192028111.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s192028111", "user_id": "u809138450"}, "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 (que : (string * int) Queue.t) = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  for _ = 0 to n - 1 do\n    add (Scanf.scanf \"%s %d\\n\" (fun s t -> (s, t))) que\n  done;\n  let cnt = ref 0 in\n  while not (is_empty que) do\n    let (s, t) = take que in\n    let rest = t - q in\n    if rest > 0 then begin\n      add (s, rest) que;\n      cnt := !cnt + q;\n    end else begin\n      let x = !cnt + t in\n      Printf.printf \"%s %d\\n\" s x;\n      cnt := x;\n    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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 518, "cpu_time_ms": 20, "memory_kb": 12628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s857640517", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let (que : (string * int) Queue.t) = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  for _ = 0 to n - 1 do\n    add (Scanf.scanf \"%s %d\\n\" (fun s t -> s, t)) que;\n  done;\n  let cnt = ref 0 in\n  while not (is_empty que) do\n    let (s, t) = take que in\n    let rest = t - q in\n    if rest <= 0 then begin\n      cnt := !cnt + t;\n      Printf.printf \"%s %d\\n\" s !cnt;\n    end else begin\n      add (s, rest) que;\n      cnt := !cnt + q;\n    end\n  done", "language": "OCaml", "metadata": {"date": 1499847009, "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/s857640517.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s857640517", "user_id": "u809138450"}, "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 (que : (string * int) Queue.t) = create () in\n  let (n, q) = Scanf.scanf \"%d %d\\n\" (fun n q -> (n, q)) in\n  for _ = 0 to n - 1 do\n    add (Scanf.scanf \"%s %d\\n\" (fun s t -> s, t)) que;\n  done;\n  let cnt = ref 0 in\n  while not (is_empty que) do\n    let (s, t) = take que in\n    let rest = t - q in\n    if rest <= 0 then begin\n      cnt := !cnt + t;\n      Printf.printf \"%s %d\\n\" s !cnt;\n    end else begin\n      add (s, rest) que;\n      cnt := !cnt + q;\n    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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 502, "cpu_time_ms": 20, "memory_kb": 12648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s743821718", "group_id": "codeNet:p02265", "input_text": "module DLinkedList = struct\n  type 'a element =\n    { value : 'a;\n      mutable next : 'a element option;\n      mutable prev : 'a element option\n    }\n  type 'a t = {\n    mutable first : 'a element option;\n    mutable last  : 'a element option\n  }\n\n  let create () = {first = None; last = None}\n  let is_empty t = t.first = None && t.last = None\n  let value elt = elt.value\n  let next elt = elt.next\n\n  let insert_first t value =\n    let new_elt = {prev = None; next = t.first; value} in\n    begin match t.first with\n      | Some old_first -> old_first.prev <- Some new_elt\n      | None -> ()\n    end;\n    t.first <- Some new_elt;\n    begin match t.last with\n      | Some _ -> ()\n      | None -> t.last <- Some new_elt\n    end\n\n  let remove t elt =\n    let {prev; next; _} = elt in\n    begin match prev with\n      | Some prev -> prev.next <- next\n      | None -> t.first <- next\n    end;\n    begin match next with\n      | Some next -> next.prev <- prev\n      | None -> t.last <- prev\n    end;\n    elt.prev <- None;\n    elt.next <- None\n      \n  let find t (v:int) =\n    let rec loop = function\n      | None -> ()\n      | Some elt ->\n        if v = (value elt) then remove t elt\n        else loop (next elt)\n    in\n    loop t.first\n\n  let remove_first t =\n    begin match t.first with\n      | Some first ->\n        begin match first.next with\n          | Some e -> e.prev <- None; t.first <- first.next\n          | None -> t.first <- None; t.last <- None\n        end\n      | None -> ()\n    end\n\n  let remove_last t =\n    begin match t.last with\n      | Some last ->\n        begin match last.prev with\n          | Some e -> e.next <- None; t.last <- last.prev\n          | None -> t.first <- None; t.last <- None\n        end\n      | None -> ()\n    end\n\n  let iter t ~f =\n    let rec loop = function\n      | None -> ()\n      | Some elt -> f elt; loop (next elt)\n    in loop t.first\nend\n\nlet () =\n  let open DLinkedList in\n  let (n: int) = read_int () in\n  let (dll: int t) = create () in\n  for i=1 to n do\n    begin match read_line () with\n      | \"deleteFirst\" -> remove_first dll\n      | \"deleteLast\" -> remove_last dll\n      | s ->\n        begin match String.sub s 0 6,\n                    (String.sub s 7 (String.length s - 7)\n                     |> int_of_string) with\n        | \"insert\", n -> insert_first dll n\n        | \"delete\", n -> find dll n\n        | _ -> ()\n        end\n    end\n  done;\n  iter dll\n    ~f:(fun e -> match next e with\n          Some _ -> Printf.printf \"%d \" (value e)\n        | None -> Printf.printf \"%d\\n\" (value e))", "language": "OCaml", "metadata": {"date": 1477476402, "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/s743821718.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s743821718", "user_id": "u995793569"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "module DLinkedList = struct\n  type 'a element =\n    { value : 'a;\n      mutable next : 'a element option;\n      mutable prev : 'a element option\n    }\n  type 'a t = {\n    mutable first : 'a element option;\n    mutable last  : 'a element option\n  }\n\n  let create () = {first = None; last = None}\n  let is_empty t = t.first = None && t.last = None\n  let value elt = elt.value\n  let next elt = elt.next\n\n  let insert_first t value =\n    let new_elt = {prev = None; next = t.first; value} in\n    begin match t.first with\n      | Some old_first -> old_first.prev <- Some new_elt\n      | None -> ()\n    end;\n    t.first <- Some new_elt;\n    begin match t.last with\n      | Some _ -> ()\n      | None -> t.last <- Some new_elt\n    end\n\n  let remove t elt =\n    let {prev; next; _} = elt in\n    begin match prev with\n      | Some prev -> prev.next <- next\n      | None -> t.first <- next\n    end;\n    begin match next with\n      | Some next -> next.prev <- prev\n      | None -> t.last <- prev\n    end;\n    elt.prev <- None;\n    elt.next <- None\n      \n  let find t (v:int) =\n    let rec loop = function\n      | None -> ()\n      | Some elt ->\n        if v = (value elt) then remove t elt\n        else loop (next elt)\n    in\n    loop t.first\n\n  let remove_first t =\n    begin match t.first with\n      | Some first ->\n        begin match first.next with\n          | Some e -> e.prev <- None; t.first <- first.next\n          | None -> t.first <- None; t.last <- None\n        end\n      | None -> ()\n    end\n\n  let remove_last t =\n    begin match t.last with\n      | Some last ->\n        begin match last.prev with\n          | Some e -> e.next <- None; t.last <- last.prev\n          | None -> t.first <- None; t.last <- None\n        end\n      | None -> ()\n    end\n\n  let iter t ~f =\n    let rec loop = function\n      | None -> ()\n      | Some elt -> f elt; loop (next elt)\n    in loop t.first\nend\n\nlet () =\n  let open DLinkedList in\n  let (n: int) = read_int () in\n  let (dll: int t) = create () in\n  for i=1 to n do\n    begin match read_line () with\n      | \"deleteFirst\" -> remove_first dll\n      | \"deleteLast\" -> remove_last dll\n      | s ->\n        begin match String.sub s 0 6,\n                    (String.sub s 7 (String.length s - 7)\n                     |> int_of_string) with\n        | \"insert\", n -> insert_first dll n\n        | \"delete\", n -> find dll n\n        | _ -> ()\n        end\n    end\n  done;\n  iter dll\n    ~f:(fun e -> match next e with\n          Some _ -> Printf.printf \"%d \" (value e)\n        | None -> Printf.printf \"%d\\n\" (value e))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2542, "cpu_time_ms": 320, "memory_kb": 77972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s849701513", "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": 1499332015, "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/s849701513.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849701513", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 250, "memory_kb": 41020}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s742772885", "group_id": "codeNet:p02265", "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\nmodule Deque = struct\n  (* let (+$),(-$) = Pervasives.((+),(-)) *)\n  type 'a u = {\n    mutable prev: 'a cell;\n    value: 'a;\n    mutable next: 'a cell; }\n  and 'a cell = Nil | Cons of 'a u\n  type 'a t = {\n    mutable length: int;\n    mutable head: 'a cell;\n    mutable tail: 'a cell; }\n  exception Empty\n  let empty () = {length=0;head=Nil;tail=Nil}\n  let is_empty {length;_} = length=0\n  let length {length;_} = length\n  let clear q = q.length <- 0; q.head <- Nil; q.tail <- Nil\n  let push_rear value q = match q.tail with\n  | Nil ->\n    let n = Cons {prev=Nil; value; next=Nil} in\n    q.length <- 1; q.head <- n; q.tail <- n\n  | Cons tail ->\n    let n = Cons {prev=q.tail; value; next=Nil} in\n    q.length <- q.length+$1; tail.next <- n; q.tail <- n\n  let pop_front q = match q.head with\n  | Nil -> raise Empty\n  | Cons {value;next=Nil;_} -> clear q; value\n  | Cons {value;next=Cons c as next;_} ->\n    q.length <- q.length-$1; c.prev <- Nil; q.head <- next; value\n  let push_front value q = match q.head with\n  | Nil ->\n    let n = Cons {prev=Nil; value; next=Nil} in\n    q.length <- 1; q.head <- n; q.tail <- n\n  | Cons head ->\n    let n = Cons {prev=Nil; value; next=q.head} in\n    q.length <- q.length+$1; head.prev <- n; q.head <- n\n  let pop_rear q = match q.tail with\n  | Nil -> raise Empty\n  | Cons {value;prev=Nil;_} -> clear q; value\n  | Cons {value;prev=Cons c as prev;_} ->\n    q.length <- q.length-$1; c.next <- Nil; q.tail <- prev; value\n  let front q = match q.head with\n  | Nil -> raise Empty\n  | Cons {value;_} -> value\n  let rear q = match q.tail with\n  | Nil -> raise Empty\n  | Cons {value;_} -> value\n  let iter f {head;_} =\n    let rec f0 = function | Nil -> () | Cons {value;next;_} -> f value; f0 next\n    in f0 head\n  let iter_rev f {tail;_} =\n    let rec f0 = function | Nil -> () | Cons {value;prev;_} -> f value; f0 prev\n    in f0 tail\n  let fold f u0 {head;_} =\n    let rec f0 u = function | Nil -> u | Cons {value;next;_} -> f0 (f u value) next\n    in f0 u0 head\n  let of_list ls =\n    let q = empty () in List.iter (fun v -> push_rear v q) ls; q\n  let to_list q = fold (fun u v -> v::u) [] q |> List.rev\nend\n\nlet () =\n  let n = get_i64 0 in\n  let q = Deque.empty () in\n  rep 1L n (fun _ ->\n    match scanf \" %s\" @@ id with\n    | \"insert\" -> (\n      let v = get_i64 0 in\n      Deque.push_front v q\n    )\n    | \"delete\" -> (\n      let w = get_i64 0 in\n      let ls = Deque.fold (fun (f,ls) v ->\n        if not f && v=w then (true,ls)\n        else (f,v::ls)\n      ) (false,[]) q |> snd in\n      Deque.clear q;\n      List.iter (fun v -> Deque.push_front v q) ls\n    )\n    | \"deleteFirst\" -> Deque.pop_front q |> ignore\n    | \"deleteLast\" -> Deque.pop_rear q |> ignore\n    | _ -> fail 0\n  );\n  Deque.to_list q |> List.map ist |> String.concat \" \" |> print_endline\n\n\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1542139443, "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/s742772885.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742772885", "user_id": "u296890922"}, "prompt_components": {"gold_output": "6 1 2\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\nmodule Deque = struct\n  (* let (+$),(-$) = Pervasives.((+),(-)) *)\n  type 'a u = {\n    mutable prev: 'a cell;\n    value: 'a;\n    mutable next: 'a cell; }\n  and 'a cell = Nil | Cons of 'a u\n  type 'a t = {\n    mutable length: int;\n    mutable head: 'a cell;\n    mutable tail: 'a cell; }\n  exception Empty\n  let empty () = {length=0;head=Nil;tail=Nil}\n  let is_empty {length;_} = length=0\n  let length {length;_} = length\n  let clear q = q.length <- 0; q.head <- Nil; q.tail <- Nil\n  let push_rear value q = match q.tail with\n  | Nil ->\n    let n = Cons {prev=Nil; value; next=Nil} in\n    q.length <- 1; q.head <- n; q.tail <- n\n  | Cons tail ->\n    let n = Cons {prev=q.tail; value; next=Nil} in\n    q.length <- q.length+$1; tail.next <- n; q.tail <- n\n  let pop_front q = match q.head with\n  | Nil -> raise Empty\n  | Cons {value;next=Nil;_} -> clear q; value\n  | Cons {value;next=Cons c as next;_} ->\n    q.length <- q.length-$1; c.prev <- Nil; q.head <- next; value\n  let push_front value q = match q.head with\n  | Nil ->\n    let n = Cons {prev=Nil; value; next=Nil} in\n    q.length <- 1; q.head <- n; q.tail <- n\n  | Cons head ->\n    let n = Cons {prev=Nil; value; next=q.head} in\n    q.length <- q.length+$1; head.prev <- n; q.head <- n\n  let pop_rear q = match q.tail with\n  | Nil -> raise Empty\n  | Cons {value;prev=Nil;_} -> clear q; value\n  | Cons {value;prev=Cons c as prev;_} ->\n    q.length <- q.length-$1; c.next <- Nil; q.tail <- prev; value\n  let front q = match q.head with\n  | Nil -> raise Empty\n  | Cons {value;_} -> value\n  let rear q = match q.tail with\n  | Nil -> raise Empty\n  | Cons {value;_} -> value\n  let iter f {head;_} =\n    let rec f0 = function | Nil -> () | Cons {value;next;_} -> f value; f0 next\n    in f0 head\n  let iter_rev f {tail;_} =\n    let rec f0 = function | Nil -> () | Cons {value;prev;_} -> f value; f0 prev\n    in f0 tail\n  let fold f u0 {head;_} =\n    let rec f0 u = function | Nil -> u | Cons {value;next;_} -> f0 (f u value) next\n    in f0 u0 head\n  let of_list ls =\n    let q = empty () in List.iter (fun v -> push_rear v q) ls; q\n  let to_list q = fold (fun u v -> v::u) [] q |> List.rev\nend\n\nlet () =\n  let n = get_i64 0 in\n  let q = Deque.empty () in\n  rep 1L n (fun _ ->\n    match scanf \" %s\" @@ id with\n    | \"insert\" -> (\n      let v = get_i64 0 in\n      Deque.push_front v q\n    )\n    | \"delete\" -> (\n      let w = get_i64 0 in\n      let ls = Deque.fold (fun (f,ls) v ->\n        if not f && v=w then (true,ls)\n        else (f,v::ls)\n      ) (false,[]) q |> snd in\n      Deque.clear q;\n      List.iter (fun v -> Deque.push_front v q) ls\n    )\n    | \"deleteFirst\" -> Deque.pop_front q |> ignore\n    | \"deleteLast\" -> Deque.pop_rear q |> ignore\n    | _ -> fail 0\n  );\n  Deque.to_list q |> List.map ist |> String.concat \" \" |> print_endline\n\n\n\n\n\n\n\n\n\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8233, "cpu_time_ms": 1180, "memory_kb": 102528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s836755465", "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 = function\n      []  -> acc\n    | [x] -> x::acc\n    | ((s1,e1),v1)::((s2,e2),v2)::r when s1 < s2 && e1 > e2 ->\n      loop acc (((s1,e1), v1+v2)::r)\n    | a::(b::r as rest) -> loop (a::acc) rest\n  in loop [] lst\n\nlet () =\n  let line = read_line () in\n  let count = ref 0 in\n  let buf = Buffer.create 128 in\n  analysis line |> summarize\n  |> List.fold_left\n    (fun acc (_,v) ->\n       incr count;\n       Buffer.add_string buf (Printf.sprintf \" %d\" v);\n       acc+v)\n    0\n  |> (fun sum -> Printf.printf \"%d\\n%d%s\\n\" sum !count (Buffer.contents buf))", "language": "OCaml", "metadata": {"date": 1477895738, "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/s836755465.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s836755465", "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 = function\n      []  -> acc\n    | [x] -> x::acc\n    | ((s1,e1),v1)::((s2,e2),v2)::r when s1 < s2 && e1 > e2 ->\n      loop acc (((s1,e1), v1+v2)::r)\n    | a::(b::r as rest) -> loop (a::acc) rest\n  in loop [] lst\n\nlet () =\n  let line = read_line () in\n  let count = ref 0 in\n  let buf = Buffer.create 128 in\n  analysis line |> summarize\n  |> List.fold_left\n    (fun acc (_,v) ->\n       incr count;\n       Buffer.add_string buf (Printf.sprintf \" %d\" v);\n       acc+v)\n    0\n  |> (fun sum -> Printf.printf \"%d\\n%d%s\\n\" sum !count (Buffer.contents buf))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1085, "cpu_time_ms": 40, "memory_kb": 3996}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s428638480", "group_id": "codeNet:p02268", "input_text": "let words str = Str.split (Str.regexp \" \") str |> List.map int_of_string\n\nlet bs elem (a: int array) =\n  let rec loop (i_min,i_max) =\n    match i_min > i_max || i_max < i_min with\n      true -> false\n    | false ->\n      let mid = (i_min+i_max)/2 in\n      match a.(mid) = elem with\n        true -> true\n      | false ->\n        loop (match a.(mid) < elem with true -> mid+1,i_max | false -> i_min,mid-1)\n  in loop (0,(Array.length a) -1)\n\nlet () =\n  let _ = read_int () in\n  let s = read_line () |> words |> Array.of_list in\n  let _ = read_int () in\n  let t = read_line () |> words in\n  List.fold_left (fun acc x -> match bs x s with true -> acc+1 | false -> acc)\n    0 t\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1477909159, "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/s428638480.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s428638480", "user_id": "u995793569"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let words str = Str.split (Str.regexp \" \") str |> List.map int_of_string\n\nlet bs elem (a: int array) =\n  let rec loop (i_min,i_max) =\n    match i_min > i_max || i_max < i_min with\n      true -> false\n    | false ->\n      let mid = (i_min+i_max)/2 in\n      match a.(mid) = elem with\n        true -> true\n      | false ->\n        loop (match a.(mid) < elem with true -> mid+1,i_max | false -> i_min,mid-1)\n  in loop (0,(Array.length a) -1)\n\nlet () =\n  let _ = read_int () in\n  let s = read_line () |> words |> Array.of_list in\n  let _ = read_int () in\n  let t = read_line () |> words in\n  List.fold_left (fun acc x -> match bs x s with true -> acc+1 | false -> acc)\n    0 t\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 697, "cpu_time_ms": 30, "memory_kb": 16236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s868876465", "group_id": "codeNet:p02268", "input_text": "let bin_search x (a : int array) n =\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 n\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 () = read_line () |> split_on_char ' ' |> List.map int_of_string in\n  let n = read_int () in\n  let s = read_seq () |> Array.of_list in\n  let _ = read_int () in\n  let t = read_seq () in\n  List.fold_left (fun acc e -> acc + (if bin_search e s n then 1 else 0)) 0 t\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1499338981, "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/s868876465.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868876465", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let bin_search x (a : int array) n =\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 n\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 () = read_line () |> split_on_char ' ' |> List.map int_of_string in\n  let n = read_int () in\n  let s = read_seq () |> Array.of_list in\n  let _ = read_int () in\n  let t = read_seq () in\n  List.fold_left (fun acc e -> acc + (if bin_search e s n then 1 else 0)) 0 t\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 797, "cpu_time_ms": 10, "memory_kb": 17000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s463793239", "group_id": "codeNet:p02268", "input_text": "let bin_search x (a : int array) n =\n  let l = ref 0 in\n  let r = ref n in\n  try\n    while !l < !r do\n      let m = (!l + !r) / 2 in\n      if x = a.(m) then raise Exit;\n      if x < a.(m) then r := m\n      else l := m + 1;\n    done;\n    false\n  with Exit -> true\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 () = read_line () |> split_on_char ' ' |> List.map int_of_string in\n  let n = read_int () in\n  let s = read_seq () |> Array.of_list in\n  let _ = read_int () in\n  read_seq ()\n  |> List.fold_left (fun acc e -> acc + (if bin_search e s n then 1 else 0)) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1499674133, "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/s463793239.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463793239", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let bin_search x (a : int array) n =\n  let l = ref 0 in\n  let r = ref n in\n  try\n    while !l < !r do\n      let m = (!l + !r) / 2 in\n      if x = a.(m) then raise Exit;\n      if x < a.(m) then r := m\n      else l := m + 1;\n    done;\n    false\n  with Exit -> true\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 () = read_line () |> split_on_char ' ' |> List.map int_of_string in\n  let n = read_int () in\n  let s = read_seq () |> Array.of_list in\n  let _ = read_int () in\n  read_seq ()\n  |> List.fold_left (fun acc e -> acc + (if bin_search e s n then 1 else 0)) 0\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 16288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s996321249", "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) in\n  doit str []\n\nlet solve n k =\n  let a = Array.init n (fun _ -> read_int ()) in\n  let rec check = function\n    | (i, _, _, _) when i = n -> n\n    | (i, j, _, _) when j >= k -> i\n    | (i, j, s, p) when s + a.(i) <= p -> check (i + 1, j, s + a.(i), p)\n    | (i, j, _, p) -> check (i, j + 1, 0, p) 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 (0, 0, 0, m) >= n then bin_search l (m - 1)\n      else bin_search (m + 1) r in\n  Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; k] -> solve n k\n  | _ -> exit 1", "language": "OCaml", "metadata": {"date": 1475966042, "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/s996321249.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996321249", "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) in\n  doit str []\n\nlet solve n k =\n  let a = Array.init n (fun _ -> read_int ()) in\n  let rec check = function\n    | (i, _, _, _) when i = n -> n\n    | (i, j, _, _) when j >= k -> i\n    | (i, j, s, p) when s + a.(i) <= p -> check (i + 1, j, s + a.(i), p)\n    | (i, j, _, p) -> check (i, j + 1, 0, p) 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 (0, 0, 0, m) >= n then bin_search l (m - 1)\n      else bin_search (m + 1) r in\n  Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; k] -> solve n k\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 878, "cpu_time_ms": 10, "memory_kb": 5204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s335727098", "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 ()) in\n  let l = Array.fold_left (fun x y->max x y) 0 ws 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": 1480857006, "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/s335727098.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335727098", "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 ()) in\n  let l = Array.fold_left (fun x y->max x y) 0 ws 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 946, "cpu_time_ms": 10, "memory_kb": 5648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s043042169", "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  Array.iteri (fun i e -> if i <> 0 then print_string \" \"; print_int e) a;\n  print_newline ();\n  Printf.printf \"%d\\n\" !cnt", "language": "OCaml", "metadata": {"date": 1499843165, "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/s043042169.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043042169", "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  Array.iteri (fun i e -> if i <> 0 then print_string \" \"; print_int e) a;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 884, "cpu_time_ms": 260, "memory_kb": 19472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s832496891", "group_id": "codeNet:p02274", "input_text": "let cnt = ref 0\n\nlet merge a l m r =\n  let ni = m - l in\n  let init_ary n p =\n    Array.init (n + 1) (fun i -> if i = n then max_int else a.(p + i))\n  in\n  let ai = init_ary ni l in\n  let aj = init_ary (r - m) m in\n  let rec doit i j k =\n    if k < r then begin\n      if ai.(i) <= aj.(j) then (a.(k) <- ai.(i); doit (i + 1) j (k + 1))\n      else (a.(k) <- aj.(j); cnt := !cnt + (ni - i); doit i (j + 1) (k + 1))\n    end\n  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  Printf.printf \"%d\\n\" !cnt", "language": "OCaml", "metadata": {"date": 1474609756, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02274.html", "problem_id": "p02274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02274/input.txt", "sample_output_relpath": "derived/input_output/data/p02274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02274/OCaml/s832496891.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s832496891", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let cnt = ref 0\n\nlet merge a l m r =\n  let ni = m - l in\n  let init_ary n p =\n    Array.init (n + 1) (fun i -> if i = n then max_int else a.(p + i))\n  in\n  let ai = init_ary ni l in\n  let aj = init_ary (r - m) m in\n  let rec doit i j k =\n    if k < r then begin\n      if ai.(i) <= aj.(j) then (a.(k) <- ai.(i); doit (i + 1) j (k + 1))\n      else (a.(k) <- aj.(j); cnt := !cnt + (ni - i); doit i (j + 1) (k + 1))\n    end\n  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  Printf.printf \"%d\\n\" !cnt", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nThe Number of Inversions\n\nFor a given sequence $A = \\{a_0, a_1, ... a_{n-1}\\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:\n\nbubbleSort(A)\ncnt = 0 // the number of inversions\nfor i = 0 to A.length-1\nfor j = A.length-1 downto i+1\nif A[j] < A[j-1]\nswap(A[j], A[j-1])\ncnt++\n\nreturn cnt\n\nFor the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.\n\nInput\n\nIn the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.\n\noutput\n\nPrint the number of inversions in a line.\n\nConstraints\n\n$ 1 \\leq n \\leq 200,000$\n\n$ 0 \\leq a_i \\leq 10^9$\n\n$a_i$ are all different\n\nSample Input 1\n\n5\n3 5 2 1 4\n\nSample Output 1\n\n6\n\nSample Input 2\n\n3\n3 1 2\n\nSample Output 2\n\n2", "sample_input": "5\n3 5 2 1 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02274", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nThe Number of Inversions\n\nFor a given sequence $A = \\{a_0, a_1, ... a_{n-1}\\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:\n\nbubbleSort(A)\ncnt = 0 // the number of inversions\nfor i = 0 to A.length-1\nfor j = A.length-1 downto i+1\nif A[j] < A[j-1]\nswap(A[j], A[j-1])\ncnt++\n\nreturn cnt\n\nFor the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.\n\nInput\n\nIn the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.\n\noutput\n\nPrint the number of inversions in a line.\n\nConstraints\n\n$ 1 \\leq n \\leq 200,000$\n\n$ 0 \\leq a_i \\leq 10^9$\n\n$a_i$ are all different\n\nSample Input 1\n\n5\n3 5 2 1 4\n\nSample Output 1\n\n6\n\nSample Input 2\n\n3\n3 1 2\n\nSample Output 2\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 739, "cpu_time_ms": 70, "memory_kb": 10512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s018571384", "group_id": "codeNet:p02275", "input_text": "let print_ary a =\n  Array.iteri (fun i e -> Printf.printf (if i = 0 then \"%d\" else \" %d\") e) a;\n  print_newline ()\n\nlet rev_iter f a =\n  let rec doit i =\n    if i >= 0 then (f (Array.get a i); doit (i - 1))\n  in\n  doit (Array.length a - 1)\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 () else 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 k = Array.fold_left max (-1) a in\n  let b = Array.make n 0 in\n  counting_sort a b k;\n  print_ary b", "language": "OCaml", "metadata": {"date": 1474067091, "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/s018571384.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s018571384", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let print_ary a =\n  Array.iteri (fun i e -> Printf.printf (if i = 0 then \"%d\" else \" %d\") e) a;\n  print_newline ()\n\nlet rev_iter f a =\n  let rec doit i =\n    if i >= 0 then (f (Array.get a i); doit (i - 1))\n  in\n  doit (Array.length a - 1)\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 () else 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 k = Array.fold_left max (-1) a in\n  let b = Array.make n 0 in\n  counting_sort a b k;\n  print_ary b", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 570, "memory_kb": 36208}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s960973598", "group_id": "codeNet:p02275", "input_text": "let rev_iter (f : int -> unit) (a : int array) =\n  let rec doit i =\n    if i >= 0 then (f a.(i); doit (i - 1))\n  in\n  doit (Array.length a - 1)\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": 1474610503, "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/s960973598.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960973598", "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  let rec doit i =\n    if i >= 0 then (f a.(i); doit (i - 1))\n  in\n  doit (Array.length a - 1)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 637, "cpu_time_ms": 500, "memory_kb": 36264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s522967191", "group_id": "codeNet:p02275", "input_text": "let 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  for i = Array.length a - 1 downto 0 do\n    b.(c.( a.(i) ) - 1) <- a.(i);\n    c.( a.(i) ) <- c.( a.(i) ) - 1;\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  print_int b.(0);\n  for i = 1 to n - 1 do\n    print_string \" \";\n    print_int b.(i);\n  done;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499350630, "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/s522967191.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522967191", "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  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  for i = Array.length a - 1 downto 0 do\n    b.(c.( a.(i) ) - 1) <- a.(i);\n    c.( a.(i) ) <- c.( a.(i) ) - 1;\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  print_int b.(0);\n  for i = 1 to n - 1 do\n    print_string \" \";\n    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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 490, "memory_kb": 36196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s895007657", "group_id": "codeNet:p02275", "input_text": "let n=read_int()open Array;;let 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 b.(c.(a.(i))-1)<-a.(i);c.(a.(i))<-c.(a.(i))-1;done;print_int b.(0);for i=1to n-1do print_string\" \";print_int b.(i);done;print_newline()", "language": "OCaml", "metadata": {"date": 1499351655, "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/s895007657.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s895007657", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let n=read_int()open Array;;let 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 b.(c.(a.(i))-1)<-a.(i);c.(a.(i))<-c.(a.(i))-1;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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 510, "memory_kb": 36196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s650552768", "group_id": "codeNet:p02275", "input_text": "let n=read_int()open Array;;let 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 b.(c.(a.(i))-1)<-a.(i);c.(a.(i))<-c.(a.(i))-1;done;print_int b.(0);for i=1to n-1do print_string\" \";print_int b.(i);done;print_newline()", "language": "OCaml", "metadata": {"date": 1499352639, "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/s650552768.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s650552768", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let n=read_int()open Array;;let 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 b.(c.(a.(i))-1)<-a.(i);c.(a.(i))<-c.(a.(i))-1;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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 500, "memory_kb": 36128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s827078752", "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": 1499856151, "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/s827078752.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s827078752", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 570, "memory_kb": 36124}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s738452589", "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": 1499856168, "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/s738452589.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s738452589", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 36108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s366775646", "group_id": "codeNet:p02276", "input_text": "let partition a 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 e -> e)) 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": 1474067314, "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/s366775646.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s366775646", "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 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 e -> e)) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 586, "cpu_time_ms": 30, "memory_kb": 5388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s750433867", "group_id": "codeNet:p02277", "input_text": "let swap a i j =\n  let temp = a.(i) in\n  a.(i) <- a.(j);a.(j) <- temp;;\n\nlet rec find (a:(string*int) array) (x,y) n =\n  if (fst a.(n)) = x && (snd a.(n)) = y then n else find a (x,y) (n+1);;\n\nlet is_stable org (c:(string*int) array) n =\n  let rec loop = function\n      i when i = n -> \"Stable\"\n    | i ->\n       if (snd c.(i)) = (snd c.(i-1)) then\n         if find org c.(i) 0 > find org c.(i-1) 0 then loop (i+1)\n         else \"Not stable\"\n       else\n         loop (i+1)\n  in loop 1\n;;\n\nlet partition (a:(string*int) array) p r =\n  let (_,x) = a.(r) and\n      i = ref (p-1) in\n  for j = p to (r-1) do\n    if (snd a.(j)) <= x then\n      begin\n        i := (!i) + 1;\n        swap a (!i) j;\n      end;\n  done;\n  swap a ((!i)+1) r;\n  (!i) + 1\n;;\n\nlet rec quick_sort a p r =\n  if p < r then\n    let q = partition a p r in\n    quick_sort a p (q-1);\n    quick_sort a (q+1) r\n;;\n\nlet () =\n  let n = read_int () in\n  let a1 = Array.init n (fun x -> Scanf.scanf \"%s %d\\n\" (fun y z-> (y,z))) in\n  let a2 = Array.copy a1 in\n  quick_sort a2 0 (n-1);\n  print_endline (is_stable a1 a2 n);\n  Array.iter (fun (x,y) -> Printf.printf \"%s %d\\n\" x y) a2\n;;", "language": "OCaml", "metadata": {"date": 1474679909, "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/s750433867.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s750433867", "user_id": "u935184340"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "let swap a i j =\n  let temp = a.(i) in\n  a.(i) <- a.(j);a.(j) <- temp;;\n\nlet rec find (a:(string*int) array) (x,y) n =\n  if (fst a.(n)) = x && (snd a.(n)) = y then n else find a (x,y) (n+1);;\n\nlet is_stable org (c:(string*int) array) n =\n  let rec loop = function\n      i when i = n -> \"Stable\"\n    | i ->\n       if (snd c.(i)) = (snd c.(i-1)) then\n         if find org c.(i) 0 > find org c.(i-1) 0 then loop (i+1)\n         else \"Not stable\"\n       else\n         loop (i+1)\n  in loop 1\n;;\n\nlet partition (a:(string*int) array) p r =\n  let (_,x) = a.(r) and\n      i = ref (p-1) in\n  for j = p to (r-1) do\n    if (snd a.(j)) <= x then\n      begin\n        i := (!i) + 1;\n        swap a (!i) j;\n      end;\n  done;\n  swap a ((!i)+1) r;\n  (!i) + 1\n;;\n\nlet rec quick_sort a p r =\n  if p < r then\n    let q = partition a p r in\n    quick_sort a p (q-1);\n    quick_sort a (q+1) r\n;;\n\nlet () =\n  let n = read_int () in\n  let a1 = Array.init n (fun x -> Scanf.scanf \"%s %d\\n\" (fun y z-> (y,z))) in\n  let a2 = Array.copy a1 in\n  quick_sort a2 0 (n-1);\n  print_endline (is_stable a1 a2 n);\n  Array.iter (fun (x,y) -> Printf.printf \"%s %d\\n\" x y) a2\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1138, "cpu_time_ms": 60, "memory_kb": 10616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s013252088", "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 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 read i =\n    match split (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": 1476086425, "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/s013252088.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013252088", "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 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 read i =\n    match split (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1344, "cpu_time_ms": 60, "memory_kb": 8828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s075251524", "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 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 read i =\n    match split (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": 1476464571, "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/s075251524.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s075251524", "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 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 read i =\n    match split (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1344, "cpu_time_ms": 60, "memory_kb": 8900}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s860603760", "group_id": "codeNet:p02277", "input_text": "type card = { id : int; ch : char; num : int }\n\nlet quick_sort (a : card 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 : card array) n =\n  let rec doit i =\n    if i = n then true\n    else if (fun a b -> a.num = b.num && a.id > b.id) 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 read i =\n    match split (read_line ()) ' ' with\n    | [c; d] -> { id = i; ch = c.[0]; num = int_of_string d }\n    | _ -> exit 1 in\n  let a = Array.init n read in\n  quick_sort a (fun a b -> a.num - b.num);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun e -> Printf.printf \"%c %d\\n\" e.ch e.num) a", "language": "OCaml", "metadata": {"date": 1476936982, "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/s860603760.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860603760", "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 card = { id : int; ch : char; num : int }\n\nlet quick_sort (a : card 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 : card array) n =\n  let rec doit i =\n    if i = n then true\n    else if (fun a b -> a.num = b.num && a.id > b.id) 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 read i =\n    match split (read_line ()) ' ' with\n    | [c; d] -> { id = i; ch = c.[0]; num = int_of_string d }\n    | _ -> exit 1 in\n  let a = Array.init n read in\n  quick_sort a (fun a b -> a.num - b.num);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun e -> Printf.printf \"%c %d\\n\" e.ch e.num) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1357, "cpu_time_ms": 60, "memory_kb": 8776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s435864483", "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 + 1) 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": 1499909077, "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/s435864483.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435864483", "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 + 1) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1292, "cpu_time_ms": 50, "memory_kb": 9944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s595743147", "group_id": "codeNet:p02279", "input_text": "module DoublyChainedTree = struct\n  let nil = -1\n\n  type t = {\n    mutable parent : int;\n    mutable child : int;\n    mutable bro : int;\n    mutable depth : int;\n  }\n\n  let make () = { parent = nil; child = nil; bro = nil; depth = nil }\nend\n\nmodule T = DoublyChainedTree\n\nlet () =\n  let n = read_int () in\n  let t = Array.init n (fun _ -> T.make ()) in\n  let rec read_tree i =\n    if i < n then begin\n      match List.map int_of_string (Str.split (Str.regexp \" \") (read_line ())) with\n      | id :: _ :: tl -> begin\n          let rec read_lst j left_child = function\n            | [] -> ()\n            | c :: cs -> begin\n                t.(c).T.parent <- id;\n                if j = 0 then t.(id).T.child <- c else t.(left_child).T.bro <- c;\n                read_lst (j+1) c cs\n              end\n          in\n          read_lst 0 0 tl;\n          read_tree (i + 1)\n        end\n      | _ -> exit 1\n    end\n  in\n  read_tree 0;\n  let rec search_root i =\n    if i = n then T.nil\n    else if t.(i).T.parent = T.nil then i\n    else search_root (i + 1)\n  in\n  let root = search_root 0 in\n  let rec set_depth i p =\n    t.(i).T.depth <- p;\n    if t.(i).T.bro <> T.nil then set_depth t.(i).T.bro p;\n    if t.(i).T.child <> T.nil then set_depth t.(i).T.child (p + 1);\n  in\n  set_depth root 0;\n  let print_node i =\n    Printf.printf \"node %d: parent = %d, depth = %d, \" i t.(i).T.parent t.(i).T.depth;\n    print_string (if t.(i).T.parent = T.nil then \"root, \" else if t.(i).T.child = T.nil then \"leaf, \" else \"internal node, \");\n    print_string \"[\";\n    let rec print_children c =\n      if c <> T.nil then begin\n        if c <> t.(i).T.child then print_string \", \";\n        print_int c;\n        print_children t.(c).T.bro\n      end\n    in\n    print_children t.(i).T.child;\n    print_endline \"]\"\n  in\n  let rec print i =\n    if i < n then (print_node i; print (i + 1))\n  in\n  print 0", "language": "OCaml", "metadata": {"date": 1474315326, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/OCaml/s595743147.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595743147", "user_id": "u809138450"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "module DoublyChainedTree = struct\n  let nil = -1\n\n  type t = {\n    mutable parent : int;\n    mutable child : int;\n    mutable bro : int;\n    mutable depth : int;\n  }\n\n  let make () = { parent = nil; child = nil; bro = nil; depth = nil }\nend\n\nmodule T = DoublyChainedTree\n\nlet () =\n  let n = read_int () in\n  let t = Array.init n (fun _ -> T.make ()) in\n  let rec read_tree i =\n    if i < n then begin\n      match List.map int_of_string (Str.split (Str.regexp \" \") (read_line ())) with\n      | id :: _ :: tl -> begin\n          let rec read_lst j left_child = function\n            | [] -> ()\n            | c :: cs -> begin\n                t.(c).T.parent <- id;\n                if j = 0 then t.(id).T.child <- c else t.(left_child).T.bro <- c;\n                read_lst (j+1) c cs\n              end\n          in\n          read_lst 0 0 tl;\n          read_tree (i + 1)\n        end\n      | _ -> exit 1\n    end\n  in\n  read_tree 0;\n  let rec search_root i =\n    if i = n then T.nil\n    else if t.(i).T.parent = T.nil then i\n    else search_root (i + 1)\n  in\n  let root = search_root 0 in\n  let rec set_depth i p =\n    t.(i).T.depth <- p;\n    if t.(i).T.bro <> T.nil then set_depth t.(i).T.bro p;\n    if t.(i).T.child <> T.nil then set_depth t.(i).T.child (p + 1);\n  in\n  set_depth root 0;\n  let print_node i =\n    Printf.printf \"node %d: parent = %d, depth = %d, \" i t.(i).T.parent t.(i).T.depth;\n    print_string (if t.(i).T.parent = T.nil then \"root, \" else if t.(i).T.child = T.nil then \"leaf, \" else \"internal node, \");\n    print_string \"[\";\n    let rec print_children c =\n      if c <> T.nil then begin\n        if c <> t.(i).T.child then print_string \", \";\n        print_int c;\n        print_children t.(c).T.bro\n      end\n    in\n    print_children t.(i).T.child;\n    print_endline \"]\"\n  in\n  let rec print i =\n    if i < n then (print_node i; print (i + 1))\n  in\n  print 0", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\n\nInput\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\n\nInput\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1869, "cpu_time_ms": 200, "memory_kb": 19052}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s658403992", "group_id": "codeNet:p02279", "input_text": "let nil = -1\n\ntype tree = { mutable parent : int; mutable child : int; mutable bro : int; mutable depth : int }\n\nlet make () = { parent = nil; child = nil; bro = nil; depth = nil }\n\nlet set_depth t n =\n  let rec root i =\n    if i = n then nil\n    else if t.(i).parent = nil then i\n    else root (i + 1) in\n  let rec doit i d =\n    t.(i).depth <- d;\n    if t.(i).bro <> nil then doit t.(i).bro d;\n    if t.(i).child <> nil then doit t.(i).child (d + 1) in\n  doit (root 0) 0\n\nlet print_tree t =\n  let rec print_children i c =\n    if c <> nil then begin\n      if c <> t.(i).child then print_string \", \";\n      print_int c;\n      print_children i t.(c).bro\n    end in\n  t |> Array.iteri (fun i _ ->\n    \"node \" ^ string_of_int i ^ \": parent = \" ^ string_of_int t.(i).parent\n       ^ \", depth = \" ^ string_of_int t.(i).depth\n       ^ (if t.(i).parent = nil then \", root, [\"\n          else if t.(i).child = nil then \", leaf, [\"\n          else \", internal node, [\")\n    |> print_string;\n    print_children i t.(i).child;\n    print_string \"]\\n\")\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun i -> i) in\n  let t = Array.init n (fun _ -> make ()) in\n  for _ = 0 to n - 1 do\n    let (id, k) = Scanf.scanf \"%d %d \" (fun id k -> (id, k)) in\n    let left_child = ref 0 in\n    for i = 0 to k - 1 do\n      let c = Scanf.scanf \"%d \" (fun i -> i) in\n      t.(c).parent <- id;\n      if i = 0 then t.(id).child <- c\n      else t.(!left_child).bro <- c;\n      left_child := c;\n    done;\n  done;\n  set_depth t n;\n  print_tree t", "language": "OCaml", "metadata": {"date": 1499929365, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/OCaml/s658403992.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s658403992", "user_id": "u809138450"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "let nil = -1\n\ntype tree = { mutable parent : int; mutable child : int; mutable bro : int; mutable depth : int }\n\nlet make () = { parent = nil; child = nil; bro = nil; depth = nil }\n\nlet set_depth t n =\n  let rec root i =\n    if i = n then nil\n    else if t.(i).parent = nil then i\n    else root (i + 1) in\n  let rec doit i d =\n    t.(i).depth <- d;\n    if t.(i).bro <> nil then doit t.(i).bro d;\n    if t.(i).child <> nil then doit t.(i).child (d + 1) in\n  doit (root 0) 0\n\nlet print_tree t =\n  let rec print_children i c =\n    if c <> nil then begin\n      if c <> t.(i).child then print_string \", \";\n      print_int c;\n      print_children i t.(c).bro\n    end in\n  t |> Array.iteri (fun i _ ->\n    \"node \" ^ string_of_int i ^ \": parent = \" ^ string_of_int t.(i).parent\n       ^ \", depth = \" ^ string_of_int t.(i).depth\n       ^ (if t.(i).parent = nil then \", root, [\"\n          else if t.(i).child = nil then \", leaf, [\"\n          else \", internal node, [\")\n    |> print_string;\n    print_children i t.(i).child;\n    print_string \"]\\n\")\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun i -> i) in\n  let t = Array.init n (fun _ -> make ()) in\n  for _ = 0 to n - 1 do\n    let (id, k) = Scanf.scanf \"%d %d \" (fun id k -> (id, k)) in\n    let left_child = ref 0 in\n    for i = 0 to k - 1 do\n      let c = Scanf.scanf \"%d \" (fun i -> i) in\n      t.(c).parent <- id;\n      if i = 0 then t.(id).child <- c\n      else t.(!left_child).bro <- c;\n      left_child := c;\n    done;\n  done;\n  set_depth t n;\n  print_tree t", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\n\nInput\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\n\nInput\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1502, "cpu_time_ms": 80, "memory_kb": 13232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s903435660", "group_id": "codeNet:p02283", "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) when x < y -> Node (y, doit l, r)\n    | Node (y, l, r) -> Node (y, l, doit r)\n  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)\n  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)\n  in\n  doit t\n\nlet print t =\n  let f e = print_string \" \"; print_int e in\n  inorder f t;\n  print_newline ();\n  preorder f t;\n  print_newline ()\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        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 m = read_int () in\n  let rec read i t =\n    if i < m then begin\n      match split (read_line ()) ' ' with\n      | [\"insert\"; n] -> read (i + 1) (insert (int_of_string n) t)\n      | _ -> (print t; read (i + 1) t)\n    end\n  in\n  read 0 (create ())", "language": "OCaml", "metadata": {"date": 1474733545, "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/s903435660.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s903435660", "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": "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) when x < y -> Node (y, doit l, r)\n    | Node (y, l, r) -> Node (y, l, doit r)\n  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)\n  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)\n  in\n  doit t\n\nlet print t =\n  let f e = print_string \" \"; print_int e in\n  inorder f t;\n  print_newline ();\n  preorder f t;\n  print_newline ()\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        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 m = read_int () in\n  let rec read i t =\n    if i < m then begin\n      match split (read_line ()) ' ' with\n      | [\"insert\"; n] -> read (i + 1) (insert (int_of_string n) t)\n      | _ -> (print t; read (i + 1) t)\n    end\n  in\n  read 0 (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1212, "cpu_time_ms": 810, "memory_kb": 31852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s760383881", "group_id": "codeNet:p02283", "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) when x < y -> Node (y, doit l, r)\n    | Node (y, l, r) -> Node (y, l, doit r)\n  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)\n  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)\n  in\n  doit t\n\nlet print t =\n  let f e = print_string \" \"; print_int e in\n  inorder f t;\n  print_newline ();\n  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\n      let op = Scanf.scanf \"%s \" (fun i -> i) in\n      if op = \"print\" then (print t; read (i + 1) t)\n      else read (i + 1) (insert (Scanf.scanf \"%d \" (fun i -> i)) t)\n  in\n  read 0 (create ())", "language": "OCaml", "metadata": {"date": 1474794149, "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/s760383881.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s760383881", "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": "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) when x < y -> Node (y, doit l, r)\n    | Node (y, l, r) -> Node (y, l, doit r)\n  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)\n  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)\n  in\n  doit t\n\nlet print t =\n  let f e = print_string \" \"; print_int e in\n  inorder f t;\n  print_newline ();\n  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\n      let op = Scanf.scanf \"%s \" (fun i -> i) in\n      if op = \"print\" then (print t; read (i + 1) t)\n      else read (i + 1) (insert (Scanf.scanf \"%d \" (fun i -> i)) t)\n  in\n  read 0 (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 896, "cpu_time_ms": 890, "memory_kb": 31904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s011660500", "group_id": "codeNet:p02289", "input_text": "let h = 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 extract (t : int array) =\n  let ret = t.(1) in\n  t.(1) <- t.(!h);\n  decr h;\n  let rec max_heapify i =\n    let l = left i in\n    let r = right i in\n    let m = if l <= !h && t.(l) > t.(i) then l else i in\n    let m = if r <= !h && t.(r) > t.(m) then r else m in\n    if m <> i then 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 h;\n  t.(!h) <- x;\n  let rec doit i =\n    if i > 1 && t.(parent i) < t.(i) then begin\n      let tmp = t.(i) in t.(i) <- t.(parent i); t.(parent i) <- tmp;\n      doit (parent i)\n    end in\n  doit !h\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 ->\n      let s1 = sub s 0 i in\n      doit s1 (sub s (i + 1) (length s - length s1 - 1) :: acc)\n  in doit str []\n\nlet () =\n  let t = Array.make 2000001 0 in\n  let rec doit () =\n    match split (read_line ()) ' ' with\n    | [\"extract\"] -> (Printf.printf \"%d\\n\" (extract t); doit ())\n    | [\"insert\"; n] -> (insert (int_of_string n) t; doit ())\n    | _ -> ()\n  in doit ()", "language": "OCaml", "metadata": {"date": 1475488223, "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/s011660500.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s011660500", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n10\n11\n2\n", "input_to_evaluate": "let h = 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 extract (t : int array) =\n  let ret = t.(1) in\n  t.(1) <- t.(!h);\n  decr h;\n  let rec max_heapify i =\n    let l = left i in\n    let r = right i in\n    let m = if l <= !h && t.(l) > t.(i) then l else i in\n    let m = if r <= !h && t.(r) > t.(m) then r else m in\n    if m <> i then 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 h;\n  t.(!h) <- x;\n  let rec doit i =\n    if i > 1 && t.(parent i) < t.(i) then begin\n      let tmp = t.(i) in t.(i) <- t.(parent i); t.(parent i) <- tmp;\n      doit (parent i)\n    end in\n  doit !h\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 ->\n      let s1 = sub s 0 i in\n      doit s1 (sub s (i + 1) (length s - length s1 - 1) :: acc)\n  in doit str []\n\nlet () =\n  let t = Array.make 2000001 0 in\n  let rec doit () =\n    match split (read_line ()) ' ' with\n    | [\"extract\"] -> (Printf.printf \"%d\\n\" (extract t); doit ())\n    | [\"insert\"; n] -> (insert (int_of_string n) t; doit ())\n    | _ -> ()\n  in doit ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1288, "cpu_time_ms": 890, "memory_kb": 20264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s193434434", "group_id": "codeNet:p02289", "input_text": "let h = 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 rec max_heapify i =\n    let l = left i in\n    let r = right i in\n    let m = if l <= !h && t.(l) > t.(i) then l else i in\n    let m = if r <= !h && t.(r) > t.(m) then r else m in\n    if i <> m then begin\n      swap i m t;\n      max_heapify m\n    end in\n  let ret = t.(1) in\n  t.(1) <- t.(!h);\n  decr h;\n  max_heapify 1;\n  ret\n\nlet insert x (t : int array) =\n  let rec doit i =\n    if i > 1 && t.(parent i) < t.(i) then begin\n      swap i (parent i) t;\n      doit (parent i)\n    end in\n  incr h;\n  t.(!h) <- x;\n  doit !h\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  let rec doit () =\n    match split_on_char ' ' (read_line ()) with\n    | [\"extract\"] -> Printf.printf \"%d\\n\" (extract t); doit ()\n    | [\"insert\"; n] -> insert (int_of_string n) t; doit ()\n    | _ -> () in\n  doit ()", "language": "OCaml", "metadata": {"date": 1479566085, "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/s193434434.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s193434434", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n10\n11\n2\n", "input_to_evaluate": "let h = 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 rec max_heapify i =\n    let l = left i in\n    let r = right i in\n    let m = if l <= !h && t.(l) > t.(i) then l else i in\n    let m = if r <= !h && t.(r) > t.(m) then r else m in\n    if i <> m then begin\n      swap i m t;\n      max_heapify m\n    end in\n  let ret = t.(1) in\n  t.(1) <- t.(!h);\n  decr h;\n  max_heapify 1;\n  ret\n\nlet insert x (t : int array) =\n  let rec doit i =\n    if i > 1 && t.(parent i) < t.(i) then begin\n      swap i (parent i) t;\n      doit (parent i)\n    end in\n  incr h;\n  t.(!h) <- x;\n  doit !h\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  let rec doit () =\n    match split_on_char ' ' (read_line ()) with\n    | [\"extract\"] -> Printf.printf \"%d\\n\" (extract t); doit ()\n    | [\"insert\"; n] -> insert (int_of_string n) t; doit ()\n    | _ -> () in\n  doit ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1254, "cpu_time_ms": 920, "memory_kb": 20432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s687968930", "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      swap i m t;\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      swap i (parent i) t;\n      doit (parent i)\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": 1500098688, "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/s687968930.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s687968930", "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      swap i m t;\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      swap i (parent i) t;\n      doit (parent i)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 910, "memory_kb": 20332}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s008024822", "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\"] -> print_int (extract t); print_newline ()\n    | [\"insert\"; n] -> insert (int_of_string n) t\n    | _ -> exit 0\n  done", "language": "OCaml", "metadata": {"date": 1500098837, "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/s008024822.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s008024822", "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\"] -> print_int (extract t); print_newline ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1389, "cpu_time_ms": 800, "memory_kb": 20212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s439359727", "group_id": "codeNet:p02315", "input_text": "type t = { v : int; w : int }\n\nlet solve a n w =\n  let dp = Array.make_matrix (n + 1) (w + 1) 0 in\n  for i = 1 to n do\n    for j = 1 to w do\n      dp.(i).(j) <-\n        if j - a.(i-1).w < 0 then dp.(i-1).(j)\n        else max dp.(i-1).(j) (dp.(i-1).(j - a.(i-1).w) + a.(i-1).v);\n    done\n  done;\n  dp.(n).(w)\n\nlet () =\n  let (n, w) = Scanf.scanf \"%d %d \" (fun n w -> n, w) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d %d \" (fun v w -> { v; w })) in\n  solve a n w |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1501664765, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02315.html", "problem_id": "p02315", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02315/input.txt", "sample_output_relpath": "derived/input_output/data/p02315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02315/OCaml/s439359727.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439359727", "user_id": "u809138450"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "type t = { v : int; w : int }\n\nlet solve a n w =\n  let dp = Array.make_matrix (n + 1) (w + 1) 0 in\n  for i = 1 to n do\n    for j = 1 to w do\n      dp.(i).(j) <-\n        if j - a.(i-1).w < 0 then dp.(i-1).(j)\n        else max dp.(i-1).(j) (dp.(i-1).(j - a.(i-1).w) + a.(i-1).v);\n    done\n  done;\n  dp.(n).(w)\n\nlet () =\n  let (n, w) = Scanf.scanf \"%d %d \" (fun n w -> n, w) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d %d \" (fun v w -> { v; w })) in\n  solve a n w |> Printf.printf \"%d\\n\"", "problem_context": "0-1 Knapsack Problem\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 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 ≤ 1000\n\n1 ≤ wi ≤ 1000\n\n1 ≤ W ≤ 10000\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": "p02315", "source_text": "0-1 Knapsack Problem\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 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 ≤ 1000\n\n1 ≤ wi ≤ 1000\n\n1 ≤ W ≤ 10000\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 492, "cpu_time_ms": 10, "memory_kb": 10440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s092528317", "group_id": "codeNet:p02323", "input_text": "open Printf\nopen Scanf\n\nmodule P = struct\n  type path = Len of int | Inf | Unk\n\n  let min l1 l2 =\n    match l1, l2 with\n      Len x, Len y when x < y -> Len x\n    | Len x, Len y -> Len y\n    | Len x, _ -> Len x\n    | _, Len y -> Len y\n    | _, _ -> Inf\n                \n  let add l1 l2 =\n    match l1, l2 with\n      Len x, Len y -> Len (x + y)\n    | _, _ -> Inf\n                \n  let get = function\n      Len x -> x\n    | Inf -> (-1)\n    | _ -> failwith \"get\"\nend\n             \nlet () =\n  let nv, ne = scanf \"%d %d \" (fun x y -> (x, y)) in\n  let g = Array.make_matrix nv nv P.Inf in\n  let memo = Array.make_matrix (1 lsl nv) nv P.Unk in\n  let set_g n =\n    let rec loop x =\n      if x = 0 then ()\n      else let s, t, d = scanf \"%d %d %d \" (fun x y z -> (x, y, z)) in\n           g.(s).(t) <- P.Len d;\n           loop (x-1) in\n    loop n in\n  let rec search s v =\n    match memo.(s).(v) with\n      P.Unk -> \n      let rec loop u l =\n        if u = nv then l\n        else\n          if s lsr u land 1 = 0 then loop (u+1) (P.min l (P.add g.(v).(u) (search (s lor (1 lsl u)) u)))\n          else loop (u+1) l\n      in\n      let ml = loop 0 P.Inf in\n      memo.(s).(v) <- ml; ml\n    | x -> x in\n  set_g ne;\n  memo.((1 lsl nv) - 1 ).(0) <- P.Len 0;\n  printf \"%d\\n\" (P.get (search 0 0))", "language": "OCaml", "metadata": {"date": 1505882725, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02323.html", "problem_id": "p02323", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02323/input.txt", "sample_output_relpath": "derived/input_output/data/p02323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02323/OCaml/s092528317.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092528317", "user_id": "u049242937"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nmodule P = struct\n  type path = Len of int | Inf | Unk\n\n  let min l1 l2 =\n    match l1, l2 with\n      Len x, Len y when x < y -> Len x\n    | Len x, Len y -> Len y\n    | Len x, _ -> Len x\n    | _, Len y -> Len y\n    | _, _ -> Inf\n                \n  let add l1 l2 =\n    match l1, l2 with\n      Len x, Len y -> Len (x + y)\n    | _, _ -> Inf\n                \n  let get = function\n      Len x -> x\n    | Inf -> (-1)\n    | _ -> failwith \"get\"\nend\n             \nlet () =\n  let nv, ne = scanf \"%d %d \" (fun x y -> (x, y)) in\n  let g = Array.make_matrix nv nv P.Inf in\n  let memo = Array.make_matrix (1 lsl nv) nv P.Unk in\n  let set_g n =\n    let rec loop x =\n      if x = 0 then ()\n      else let s, t, d = scanf \"%d %d %d \" (fun x y z -> (x, y, z)) in\n           g.(s).(t) <- P.Len d;\n           loop (x-1) in\n    loop n in\n  let rec search s v =\n    match memo.(s).(v) with\n      P.Unk -> \n      let rec loop u l =\n        if u = nv then l\n        else\n          if s lsr u land 1 = 0 then loop (u+1) (P.min l (P.add g.(v).(u) (search (s lor (1 lsl u)) u)))\n          else loop (u+1) l\n      in\n      let ml = loop 0 P.Inf in\n      memo.(s).(v) <- ml; ml\n    | x -> x in\n  set_g ne;\n  memo.((1 lsl nv) - 1 ).(0) <- P.Len 0;\n  printf \"%d\\n\" (P.get (search 0 0))", "problem_context": "Traveling Salesman Problem\n\nFor a given weighted directed graph G(V, E), find the distance of the shortest route that meets the following criteria:\n\nIt is a closed cycle where it ends at the same point it starts.\n\nIt visits each vertex exactly once.\n\nInput\n\n|V| |E|\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in the graph. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the distance between si and ti (the i-th edge).\n\nOutput\n\nPrint the shortest distance in a line. If there is no solution, print -1.\n\nConstraints\n\n2 ≤ |V| ≤ 15\n\n0 ≤ di ≤ 1,000\n\nThere are no multiedge\n\nSample Input 1\n\n4 6\n0 1 2\n1 2 3\n1 3 9\n2 0 1\n2 3 6\n3 2 4\n\nSample Output 1\n\n16\n\nSample Input 2\n\n3 3\n0 1 1\n1 2 1\n0 2 1\n\nSample Output 2\n\n-1", "sample_input": "4 6\n0 1 2\n1 2 3\n1 3 9\n2 0 1\n2 3 6\n3 2 4\n"}, "reference_outputs": ["16\n"], "source_document_id": "p02323", "source_text": "Traveling Salesman Problem\n\nFor a given weighted directed graph G(V, E), find the distance of the shortest route that meets the following criteria:\n\nIt is a closed cycle where it ends at the same point it starts.\n\nIt visits each vertex exactly once.\n\nInput\n\n|V| |E|\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in the graph. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the distance between si and ti (the i-th edge).\n\nOutput\n\nPrint the shortest distance in a line. If there is no solution, print -1.\n\nConstraints\n\n2 ≤ |V| ≤ 15\n\n0 ≤ di ≤ 1,000\n\nThere are no multiedge\n\nSample Input 1\n\n4 6\n0 1 2\n1 2 3\n1 3 9\n2 0 1\n2 3 6\n3 2 4\n\nSample Output 1\n\n16\n\nSample Input 2\n\n3 3\n0 1 1\n1 2 1\n0 2 1\n\nSample Output 2\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1278, "cpu_time_ms": 40, "memory_kb": 11076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s865185817", "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 min (x : int) y = if x < y then x else y\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        t.(j) <- min s.(j-1) (min s.(j) t.(j-1)) + 1;\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": 1501916994, "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/s865185817.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s865185817", "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 min (x : int) y = if x < y then x else y\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        t.(j) <- min s.(j-1) (min s.(j) t.(j-1)) + 1;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1362, "cpu_time_ms": 80, "memory_kb": 25352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s778243105", "group_id": "codeNet:p02327", "input_text": "let solve h w c =\n  for j = 0 to w - 1 do\n    c.(0).(j) <- 1 - c.(0).(j);\n    for i = 1 to h - 1 do\n      c.(i).(j) <- if c.(i).(j) = 1 then 0 else c.(i-1).(j) + 1\n    done\n  done;\n  let rec duduwa ans i j k = function\n    | [] -> (ans, [(c.(i).(j), k)])\n    | (ch, cj) :: y' when ch >= c.(i).(j) -> duduwa (if ch * (j - cj) > ans then ch * (j - cj) else ans) i j cj y'\n    | ys -> (ans, (c.(i).(j), k) :: ys) in\n  let rec doit ans = function\n    | (i, _, xs) when i = h -> ans\n    | (i, j, xs) when j = w -> doit (List.fold_left (fun acc (ch, cj) -> if ch * (w - cj) > acc then ch * (w - cj) else acc) ans xs) (i + 1, 0, [])\n    | (i, j, []) -> doit ans (i, j + 1, [(c.(i).(j), j)])\n    | (i, j, ((ch, _) :: _ as xs)) when ch < c.(i).(j) -> doit ans (i, j + 1, (c.(i).(j), j) :: xs)\n    | (i, j, ((ch, _) :: _ as xs)) when ch > c.(i).(j) ->\n      let (ans, ys) = duduwa ans i j j xs in\n      doit ans (i, j + 1, ys)\n    | (i, j, xs) -> doit ans (i, j + 1, xs) in\n  doit 0 (0, 0, [])\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      doit 0 (read ())\n    done;\n    Printf.printf \"%d\\n\" (solve h w c)\n  | _ -> ()", "language": "OCaml", "metadata": {"date": 1480340383, "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/s778243105.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778243105", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let solve h w c =\n  for j = 0 to w - 1 do\n    c.(0).(j) <- 1 - c.(0).(j);\n    for i = 1 to h - 1 do\n      c.(i).(j) <- if c.(i).(j) = 1 then 0 else c.(i-1).(j) + 1\n    done\n  done;\n  let rec duduwa ans i j k = function\n    | [] -> (ans, [(c.(i).(j), k)])\n    | (ch, cj) :: y' when ch >= c.(i).(j) -> duduwa (if ch * (j - cj) > ans then ch * (j - cj) else ans) i j cj y'\n    | ys -> (ans, (c.(i).(j), k) :: ys) in\n  let rec doit ans = function\n    | (i, _, xs) when i = h -> ans\n    | (i, j, xs) when j = w -> doit (List.fold_left (fun acc (ch, cj) -> if ch * (w - cj) > acc then ch * (w - cj) else acc) ans xs) (i + 1, 0, [])\n    | (i, j, []) -> doit ans (i, j + 1, [(c.(i).(j), j)])\n    | (i, j, ((ch, _) :: _ as xs)) when ch < c.(i).(j) -> doit ans (i, j + 1, (c.(i).(j), j) :: xs)\n    | (i, j, ((ch, _) :: _ as xs)) when ch > c.(i).(j) ->\n      let (ans, ys) = duduwa ans i j j xs in\n      doit ans (i, j + 1, ys)\n    | (i, j, xs) -> doit ans (i, j + 1, xs) in\n  doit 0 (0, 0, [])\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      doit 0 (read ())\n    done;\n    Printf.printf \"%d\\n\" (solve h w c)\n  | _ -> ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1631, "cpu_time_ms": 100, "memory_kb": 25240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s021787991", "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 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 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": 1501910633, "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/s021787991.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021787991", "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 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 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1463, "cpu_time_ms": 70, "memory_kb": 5140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s759159733", "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\ntype t = { h : int; i : int }\n\nlet max (x : int) y = if x > y then x else y\n\nlet solve w v =\n  let (m, _, xs) = Array.fold_left (fun (m, i, xs) h -> match xs with\n    | [] -> (m, i + 1, [ { h; i } ])\n    | x :: _ ->\n      if x.h = h then (m, i + 1, xs)\n      else if x.h < h then (m, i + 1, { h; i } :: xs)\n      else\n        let rec doit m j = function\n          | [] -> (m, i + 1, [ { h; i = j } ])\n          | x :: tl as xs ->\n            if x.h >= h then doit (max (x.h * (i - x.i)) m) x.i tl\n            else (m, i + 1, { h; i = j } :: xs) in\n        doit m i xs)\n    (0, 0, [])\n    v in\n  List.fold_left (fun m x -> max (x.h * (w - x.i)) m) m 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        let m = solve w t in\n        doit (i + 1) (max m ans)\n      end in\n    doit 0 0 |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501914010, "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/s759159733.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759159733", "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\ntype t = { h : int; i : int }\n\nlet max (x : int) y = if x > y then x else y\n\nlet solve w v =\n  let (m, _, xs) = Array.fold_left (fun (m, i, xs) h -> match xs with\n    | [] -> (m, i + 1, [ { h; i } ])\n    | x :: _ ->\n      if x.h = h then (m, i + 1, xs)\n      else if x.h < h then (m, i + 1, { h; i } :: xs)\n      else\n        let rec doit m j = function\n          | [] -> (m, i + 1, [ { h; i = j } ])\n          | x :: tl as xs ->\n            if x.h >= h then doit (max (x.h * (i - x.i)) m) x.i tl\n            else (m, i + 1, { h; i = j } :: xs) in\n        doit m i xs)\n    (0, 0, [])\n    v in\n  List.fold_left (fun m x -> max (x.h * (w - x.i)) m) m 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        let m = solve w t in\n        doit (i + 1) (max m ans)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1504, "cpu_time_ms": 70, "memory_kb": 4984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s346968727", "group_id": "codeNet:p02343", "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 solve n q =\n  let a = Array.init n (fun i -> (i, 0)) in\n  let rec find_set x =\n    if x <> fst a.(x) then a.(x) <- (find_set (fst a.(x)), snd a.(x));\n    fst a.(x) in\n  let link x y =\n    if snd a.(x) > snd a.(y) then a.(y) <- (x, snd a.(y))\n    else begin\n      a.(x) <- (y, snd a.(x));\n      if snd a.(x) = snd a.(y) then a.(y) <- (fst a.(y), snd a.(y) + 1)\n    end in\n  let unite x y = link (find_set x) (find_set y) in\n  let same_p x y = find_set x = find_set y 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 :: _ -> unite x y\n      | 1 :: x :: y :: _ -> print_endline (if same_p x y then \"1\" else \"0\")\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": 1476258008, "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/s346968727.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346968727", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n0\n1\n1\n1\n0\n1\n1\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 solve n q =\n  let a = Array.init n (fun i -> (i, 0)) in\n  let rec find_set x =\n    if x <> fst a.(x) then a.(x) <- (find_set (fst a.(x)), snd a.(x));\n    fst a.(x) in\n  let link x y =\n    if snd a.(x) > snd a.(y) then a.(y) <- (x, snd a.(y))\n    else begin\n      a.(x) <- (y, snd a.(x));\n      if snd a.(x) = snd a.(y) then a.(y) <- (fst a.(y), snd a.(y) + 1)\n    end in\n  let unite x y = link (find_set x) (find_set y) in\n  let same_p x y = find_set x = find_set y 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 :: _ -> unite x y\n      | 1 :: x :: y :: _ -> print_endline (if same_p x y then \"1\" else \"0\")\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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1125, "cpu_time_ms": 70, "memory_kb": 6740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s873716239", "group_id": "codeNet:p02343", "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 find_set s x =\n  let rec doit x =\n    if x <> fst s.(x) then s.(x) <- (doit (fst s.(x)), snd s.(x));\n    fst s.(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 snd s.(a) > snd s.(b) then s.(b) <- (a, snd s.(b))\n  else begin\n    s.(a) <- (b, snd s.(a));\n    if snd s.(a) = snd s.(b) then s.(b) <- (fst s.(b), snd s.(b) + 1)\n  end\n\nlet same_p s x y = find_set s x = find_set s y\n\nlet solve n q =\n  let s = Array.init n (fun i -> (i, 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 :: _ -> unite s x y\n      | 1 :: x :: y :: _ -> print_endline (if same_p s x y then \"1\" else \"0\")\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": 1476259812, "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/s873716239.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873716239", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n0\n1\n1\n1\n0\n1\n1\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 find_set s x =\n  let rec doit x =\n    if x <> fst s.(x) then s.(x) <- (doit (fst s.(x)), snd s.(x));\n    fst s.(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 snd s.(a) > snd s.(b) then s.(b) <- (a, snd s.(b))\n  else begin\n    s.(a) <- (b, snd s.(a));\n    if snd s.(a) = snd s.(b) then s.(b) <- (fst s.(b), snd s.(b) + 1)\n  end\n\nlet same_p s x y = find_set s x = find_set s y\n\nlet solve n q =\n  let s = Array.init n (fun i -> (i, 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 :: _ -> unite s x y\n      | 1 :: x :: y :: _ -> print_endline (if same_p s x y then \"1\" else \"0\")\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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1136, "cpu_time_ms": 70, "memory_kb": 6732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s408117294", "group_id": "codeNet:p02343", "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 readln () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nlet solve n q =\n  let s = Array.init n (fun i -> i) in\n  let rec find u =\n    if u = s.(u) then u\n    else begin\n      s.(u) <- find s.(u);\n      s.(u)\n    end in\n  for _ = 0 to q - 1 do\n    match readln () with\n    | n :: x :: y :: _ ->\n      if n = 0 then s.(find x) <- find y\n      else print_endline (if find x = find 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": 1501045619, "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/s408117294.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408117294", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n0\n1\n1\n1\n0\n1\n1\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 readln () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nlet solve n q =\n  let s = Array.init n (fun i -> i) in\n  let rec find u =\n    if u = s.(u) then u\n    else begin\n      s.(u) <- find s.(u);\n      s.(u)\n    end in\n  for _ = 0 to q - 1 do\n    match readln () with\n    | n :: x :: y :: _ ->\n      if n = 0 then s.(find x) <- find y\n      else print_endline (if find x = find 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 785, "cpu_time_ms": 50, "memory_kb": 4492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s988782207", "group_id": "codeNet:p02343", "input_text": "let solve (n, q) =\n  let s = Array.init n (fun i -> i) in\n  let rec find u =\n    if u = s.(u) then u\n    else begin\n      s.(u) <- find s.(u);\n      s.(u)\n    end in\n  for _ = 0 to q - 1 do\n    let (n, x, y) = Scanf.scanf \"%d %d %d \" (fun n x y -> (n, x, y)) in\n    if n = 0 then s.(find x) <- find y\n    else print_endline (if find x = find y then \"1\" else \"0\")\n  done\n\nlet () = Scanf.scanf \"%d %d \" (fun n q -> (n, q)) |> solve", "language": "OCaml", "metadata": {"date": 1501045752, "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/s988782207.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988782207", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n0\n1\n1\n1\n0\n1\n1\n", "input_to_evaluate": "let solve (n, q) =\n  let s = Array.init n (fun i -> i) in\n  let rec find u =\n    if u = s.(u) then u\n    else begin\n      s.(u) <- find s.(u);\n      s.(u)\n    end in\n  for _ = 0 to q - 1 do\n    let (n, x, y) = Scanf.scanf \"%d %d %d \" (fun n x y -> (n, x, y)) in\n    if n = 0 then s.(find x) <- find y\n    else print_endline (if find x = find y then \"1\" else \"0\")\n  done\n\nlet () = Scanf.scanf \"%d %d \" (fun n q -> (n, q)) |> solve", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 70, "memory_kb": 4688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s992878979", "group_id": "codeNet:p02345", "input_text": "open Printf\nopen Scanf\n\nmodule type Monoid = sig\n    type t\n    val append : t -> t -> t\n    val default : t\nend\n\nmodule Segtree(M : Monoid) = struct\n    type elt = M.t\n    type t = Leaf of elt | Node of t * elt * t * int\n\n    let value_of = function\n        | Leaf x -> x\n        | Node(_, x, _, _) -> x\n\n    let size = function\n        | Leaf _ -> 1\n        | Node(_, _, _, n) -> n\n\n    let rec range_query a b = function\n        | Leaf x -> if a <= 0 && 1 <= b then x else M.default\n        | Node(lch, x, rch, n) ->\n                if a <= 0 && n <= b then x\n                else if b <= 0 || n <= a then M.default\n                else\n                    let l_size = size lch in\n                    M.append (range_query a b lch) (range_query (a - l_size) (b - l_size) rch)\n\n    let rec updated k x = function\n        | Leaf _ -> Leaf x\n        | Node(lch, _, rch, n) ->\n                if k < size lch then\n                    let new_lch = updated k x lch in\n                    Node(new_lch, M.append (value_of new_lch) (value_of rch), rch, n)\n                else\n                    let new_rch = updated (k - size lch) x rch in\n                    Node(lch, M.append (value_of lch) (value_of new_rch), new_rch, n)\n\n    let rec build n =\n        if n <= 1 then Leaf M.default\n        else Node(build (n / 2), M.default, build (n - n / 2), n)\nend\n\nmodule RMQ = Segtree(\n    struct\n        type t = int\n        let append = min\n        let default = int_of_float (2. ** 31.) - 1\n    end)\n\nlet _ = scanf \"%d %d\\n\" (fun n q ->\n    let rec loop tree = function\n        | 0 -> ()\n        | i -> scanf \"%d %d %d\\n\" (fun com x y ->\n                if com = 0 then loop (RMQ.updated x y tree) (i - 1)\n                else begin\n                    printf \"%d\\n\" (RMQ.range_query x (y + 1) tree);\n                    loop tree (i - 1)\n                end) in\n    loop (RMQ.build n) q)", "language": "OCaml", "metadata": {"date": 1443930452, "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/s992878979.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992878979", "user_id": "u935017581"}, "prompt_components": {"gold_output": "1\n2\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nmodule type Monoid = sig\n    type t\n    val append : t -> t -> t\n    val default : t\nend\n\nmodule Segtree(M : Monoid) = struct\n    type elt = M.t\n    type t = Leaf of elt | Node of t * elt * t * int\n\n    let value_of = function\n        | Leaf x -> x\n        | Node(_, x, _, _) -> x\n\n    let size = function\n        | Leaf _ -> 1\n        | Node(_, _, _, n) -> n\n\n    let rec range_query a b = function\n        | Leaf x -> if a <= 0 && 1 <= b then x else M.default\n        | Node(lch, x, rch, n) ->\n                if a <= 0 && n <= b then x\n                else if b <= 0 || n <= a then M.default\n                else\n                    let l_size = size lch in\n                    M.append (range_query a b lch) (range_query (a - l_size) (b - l_size) rch)\n\n    let rec updated k x = function\n        | Leaf _ -> Leaf x\n        | Node(lch, _, rch, n) ->\n                if k < size lch then\n                    let new_lch = updated k x lch in\n                    Node(new_lch, M.append (value_of new_lch) (value_of rch), rch, n)\n                else\n                    let new_rch = updated (k - size lch) x rch in\n                    Node(lch, M.append (value_of lch) (value_of new_rch), new_rch, n)\n\n    let rec build n =\n        if n <= 1 then Leaf M.default\n        else Node(build (n / 2), M.default, build (n - n / 2), n)\nend\n\nmodule RMQ = Segtree(\n    struct\n        type t = int\n        let append = min\n        let default = int_of_float (2. ** 31.) - 1\n    end)\n\nlet _ = scanf \"%d %d\\n\" (fun n q ->\n    let rec loop tree = function\n        | 0 -> ()\n        | i -> scanf \"%d %d %d\\n\" (fun com x y ->\n                if com = 0 then loop (RMQ.updated x y tree) (i - 1)\n                else begin\n                    printf \"%d\\n\" (RMQ.range_query x (y + 1) tree);\n                    loop tree (i - 1)\n                end) in\n    loop (RMQ.build n) q)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1885, "cpu_time_ms": 180, "memory_kb": 20928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s759571552", "group_id": "codeNet:p02345", "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 update (s : int array) n i x =\n  let j = n + i - 1 in\n  s.(j) <- x;\n  let rec doit j =\n    if j > 0 then begin\n      let j = parent j in\n      s.(j) <- if s.(left j) < s.(right j) then s.(left j) else s.(right j);\n      doit j\n    end in\n  doit j\n\nlet find s n a b =\n  let rec doit a b k l r =\n    if r <= a || b <= l then 2147483647\n    else if a <= l && r <= b then s.(k)\n    else min (doit a b (left k) l ((l + r) / 2)) (doit a b (right k) ((l + r) / 2) r) in\n  doit a b 0 0 n\n\nlet solve n q =\n  let n = to_pow_of_2 n in\n  let s = Array.make (2*n-1) 2147483647 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 :: _ -> update s n x y\n      | 1 :: x :: y :: _ -> Printf.printf \"%d\\n\" (find s n x (y + 1))\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": 1476285196, "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/s759571552.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759571552", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1\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 update (s : int array) n i x =\n  let j = n + i - 1 in\n  s.(j) <- x;\n  let rec doit j =\n    if j > 0 then begin\n      let j = parent j in\n      s.(j) <- if s.(left j) < s.(right j) then s.(left j) else s.(right j);\n      doit j\n    end in\n  doit j\n\nlet find s n a b =\n  let rec doit a b k l r =\n    if r <= a || b <= l then 2147483647\n    else if a <= l && r <= b then s.(k)\n    else min (doit a b (left k) l ((l + r) / 2)) (doit a b (right k) ((l + r) / 2) r) in\n  doit a b 0 0 n\n\nlet solve n q =\n  let n = to_pow_of_2 n in\n  let s = Array.make (2*n-1) 2147483647 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 :: _ -> update s n x y\n      | 1 :: x :: y :: _ -> Printf.printf \"%d\\n\" (find s n x (y + 1))\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 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1422, "cpu_time_ms": 100, "memory_kb": 6472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s894599194", "group_id": "codeNet:p02348", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let n, q = scanf \"%d %d \" (fun x y -> (x, y)) in\n  let bl = 300 in\n  let ar = Array.make n 2147483647 in\n  let blk = Array.make (n / bl + 1) None in\n  let wb i = match blk.(i) with\n      None -> ()\n    | Some v -> let rec iter j =\n                  let m = i * bl + j in\n                  if j = bl || m = n then blk.(i) <- None\n                  else begin\n                      ar.(m) <- v;\n                      iter (j+1)\n                    end in\n                iter 0 in\n  let find i = match blk.(i / bl) with\n      None -> ar.(i)\n    | Some v -> v\n  in\n  let update s t x =\n    let rec iter i =\n      if i >= t then ()\n      else begin\n          if i mod bl = 0 && i + bl <= t then begin\n              blk.(i / bl) <- Some x;\n              iter (i+bl)\n            end\n          else begin\n              begin\n                match blk.(i / bl) with\n                  None -> ()\n                | Some v -> wb (i / bl)\n              end;\n              ar.(i) <- x;\n              iter (i+1)\n            end\n        end in\n    iter s in\n  let rec loop i =\n    if i = 0 then ()\n    else begin\n        let com = scanf \"%d \" (fun x -> x) in\n        begin\n          if com = 0 then\n            let s, t, x = scanf \"%d %d %d \" (fun x y z -> (x, y+1, z)) in\n            update s t x\n          else\n            let j = scanf \"%d \" (fun x -> x) in\n            find j |> printf \"%d\\n\"\n        end;\n        loop (i-1)\n      end in\n  loop q", "language": "OCaml", "metadata": {"date": 1503207824, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02348.html", "problem_id": "p02348", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02348/input.txt", "sample_output_relpath": "derived/input_output/data/p02348/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02348/OCaml/s894599194.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s894599194", "user_id": "u049242937"}, "prompt_components": {"gold_output": "1\n3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let n, q = scanf \"%d %d \" (fun x y -> (x, y)) in\n  let bl = 300 in\n  let ar = Array.make n 2147483647 in\n  let blk = Array.make (n / bl + 1) None in\n  let wb i = match blk.(i) with\n      None -> ()\n    | Some v -> let rec iter j =\n                  let m = i * bl + j in\n                  if j = bl || m = n then blk.(i) <- None\n                  else begin\n                      ar.(m) <- v;\n                      iter (j+1)\n                    end in\n                iter 0 in\n  let find i = match blk.(i / bl) with\n      None -> ar.(i)\n    | Some v -> v\n  in\n  let update s t x =\n    let rec iter i =\n      if i >= t then ()\n      else begin\n          if i mod bl = 0 && i + bl <= t then begin\n              blk.(i / bl) <- Some x;\n              iter (i+bl)\n            end\n          else begin\n              begin\n                match blk.(i / bl) with\n                  None -> ()\n                | Some v -> wb (i / bl)\n              end;\n              ar.(i) <- x;\n              iter (i+1)\n            end\n        end in\n    iter s in\n  let rec loop i =\n    if i = 0 then ()\n    else begin\n        let com = scanf \"%d \" (fun x -> x) in\n        begin\n          if com = 0 then\n            let s, t, x = scanf \"%d %d %d \" (fun x y z -> (x, y+1, z)) in\n            update s t x\n          else\n            let j = scanf \"%d \" (fun x -> x) in\n            find j |> printf \"%d\\n\"\n        end;\n        loop (i-1)\n      end in\n  loop q", "problem_context": "Range Update Query (RUQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:\n\nupdate(s, t, x): change as, as+1, ..., at to x.\n\nfind(i): output the value of ai.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\nquery1\nquery2\n:\nqueryq\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:\n\n0 s t x\n\nor\n\n1 i\n\nThe first digit represents the type of the query. '0' denotes update(s, t, x) and '1' denotes find(i).\n\nOutput\n\nFor each find operation, print the value.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\n0 ≤ s ≤ t < n\n\n0 ≤ i < n\n\n0 ≤ x < 231−1\n\nSample Input 1\n\n3 5\n0 0 1 1\n0 1 2 3\n0 2 2 2\n1 0\n1 1\n\nSample Output 1\n\n1\n3\n\nSample Input 2\n\n1 3\n1 0\n0 0 0 5\n1 0\n\nSample Output 2\n\n2147483647\n5", "sample_input": "3 5\n0 0 1 1\n0 1 2 3\n0 2 2 2\n1 0\n1 1\n"}, "reference_outputs": ["1\n3\n"], "source_document_id": "p02348", "source_text": "Range Update Query (RUQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:\n\nupdate(s, t, x): change as, as+1, ..., at to x.\n\nfind(i): output the value of ai.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\nquery1\nquery2\n:\nqueryq\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:\n\n0 s t x\n\nor\n\n1 i\n\nThe first digit represents the type of the query. '0' denotes update(s, t, x) and '1' denotes find(i).\n\nOutput\n\nFor each find operation, print the value.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\n0 ≤ s ≤ t < n\n\n0 ≤ i < n\n\n0 ≤ x < 231−1\n\nSample Input 1\n\n3 5\n0 0 1 1\n0 1 2 3\n0 2 2 2\n1 0\n1 1\n\nSample Output 1\n\n1\n3\n\nSample Input 2\n\n1 3\n1 0\n0 0 0 5\n1 0\n\nSample Output 2\n\n2147483647\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1470, "cpu_time_ms": 250, "memory_kb": 6936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s488636766", "group_id": "codeNet:p02351", "input_text": "open Printf\nopen Scanf\n\ntype ap = {a:int; p:int}\n\nlet () =\n  let n, q = scanf \"%d %d \" (fun a b -> (a, b)) in\n  let st = Array.make (4*n) {a=0; p=0} in\n  let add s t x =\n    let rec iter k l r =\n      if r <= s || t <= l then ()\n      else\n        if s <= l && r <= t then\n          st.(k) <- {st.(k) with a = st.(k).a + x}\n        else\n          begin\n            let v = (min t r - max s l) * x in\n            st.(k) <- {st.(k) with p = st.(k).p + v};\n            let m = (l + r) / 2 in\n            iter (2 * k) l m;\n            iter (2 * k + 1) m r\n          end\n    in iter 1 0 n\n  in\n  let get_sum s t =\n    let rec iter k l r =\n      if r <= s || t <= l then 0\n      else\n        if s <= l && r <= t then\n          (r - l) * st.(k).a + st.(k).p\n        else\n          let m = (l + r) / 2 in\n          (min t r - max s l) * st.(k).a +\n            iter (2 * k) l m + iter (2 * k + 1) m r\n    in iter 1 0 n\n  in\n  let rec iter u =\n    if u = 0 then ()\n    else\n      begin\n        (let com = scanf \"%d \" (fun a -> a) in\n         if com = 0 then\n           let s, t, x = scanf \"%d %d %d \" (fun a b c -> (a-1, b, c)) in\n           add s t x\n         else\n           let s, t = scanf \"%d %d \" (fun a b -> (a-1, b)) in\n           get_sum s t |> printf \"%d\\n\");\n        iter (u-1)\n      end\n  in\n  iter q", "language": "OCaml", "metadata": {"date": 1503927225, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02351.html", "problem_id": "p02351", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02351/input.txt", "sample_output_relpath": "derived/input_output/data/p02351/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02351/OCaml/s488636766.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488636766", "user_id": "u049242937"}, "prompt_components": {"gold_output": "4\n8\n", "input_to_evaluate": "open Printf\nopen Scanf\n\ntype ap = {a:int; p:int}\n\nlet () =\n  let n, q = scanf \"%d %d \" (fun a b -> (a, b)) in\n  let st = Array.make (4*n) {a=0; p=0} in\n  let add s t x =\n    let rec iter k l r =\n      if r <= s || t <= l then ()\n      else\n        if s <= l && r <= t then\n          st.(k) <- {st.(k) with a = st.(k).a + x}\n        else\n          begin\n            let v = (min t r - max s l) * x in\n            st.(k) <- {st.(k) with p = st.(k).p + v};\n            let m = (l + r) / 2 in\n            iter (2 * k) l m;\n            iter (2 * k + 1) m r\n          end\n    in iter 1 0 n\n  in\n  let get_sum s t =\n    let rec iter k l r =\n      if r <= s || t <= l then 0\n      else\n        if s <= l && r <= t then\n          (r - l) * st.(k).a + st.(k).p\n        else\n          let m = (l + r) / 2 in\n          (min t r - max s l) * st.(k).a +\n            iter (2 * k) l m + iter (2 * k + 1) m r\n    in iter 1 0 n\n  in\n  let rec iter u =\n    if u = 0 then ()\n    else\n      begin\n        (let com = scanf \"%d \" (fun a -> a) in\n         if com = 0 then\n           let s, t, x = scanf \"%d %d %d \" (fun a b c -> (a-1, b, c)) in\n           add s t x\n         else\n           let s, t = scanf \"%d %d \" (fun a b -> (a-1, b)) in\n           get_sum s t |> printf \"%d\\n\");\n        iter (u-1)\n      end\n  in\n  iter q", "problem_context": "RSQ and RAQ\n\nWrite a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:\n\nadd(s, t, x): add x to as, as+1, ..., at.\n\ngetSum(s, t): report 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\nquery1\nquery2\n:\nqueryq\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:\n\n0 s t x\n\nor\n\n1 s t\n\nThe first digit represents the type of the query. '0' denotes add(s, t, x) and '1' denotes getSum(s, t).\n\nOutput\n\nFor each getSum operation, print the sum;\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\n1 ≤ s ≤ t ≤ n\n\n0 ≤ x < 1000\n\nSample Input 1\n\n3 5\n0 1 2 1\n0 2 3 2\n0 3 3 3\n1 1 2\n1 2 3\n\nSample Output 1\n\n4\n8\n\nSample Input 2\n\n4 3\n1 1 4\n0 1 4 1\n1 1 4\n\nSample Output 2\n\n0\n4", "sample_input": "3 5\n0 1 2 1\n0 2 3 2\n0 3 3 3\n1 1 2\n1 2 3\n"}, "reference_outputs": ["4\n8\n"], "source_document_id": "p02351", "source_text": "RSQ and RAQ\n\nWrite a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:\n\nadd(s, t, x): add x to as, as+1, ..., at.\n\ngetSum(s, t): report 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\nquery1\nquery2\n:\nqueryq\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:\n\n0 s t x\n\nor\n\n1 s t\n\nThe first digit represents the type of the query. '0' denotes add(s, t, x) and '1' denotes getSum(s, t).\n\nOutput\n\nFor each getSum operation, print the sum;\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\n1 ≤ s ≤ t ≤ n\n\n0 ≤ x < 1000\n\nSample Input 1\n\n3 5\n0 1 2 1\n0 2 3 2\n0 3 3 3\n1 1 2\n1 2 3\n\nSample Output 1\n\n4\n8\n\nSample Input 2\n\n4 3\n1 1 4\n0 1 4 1\n1 1 4\n\nSample Output 2\n\n0\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1302, "cpu_time_ms": 210, "memory_kb": 16024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s511554504", "group_id": "codeNet:p02361", "input_text": "module ArrayL = ArrayLabels\nmodule ListL = ListLabels\n\nlet dbg = Printf.printf \"[debug]%s\"\n\nlet max_num = 1_000_000_000\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\nlet tuple3 x y z = (x,y,z)\nlet succ x = x + 1\nlet pred x = x - 1\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 scan fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scan_lines n fmt f =\n  List.map (fun _ -> scan fmt f) (0++^n)\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 string_to_list s =\n  List.map (String.get s) (0 ++^ String.length s)\n\nlet (v,e,r) = scan \"%d %d %d\" tuple3\nlet ls = scan_lines e \"%d %d %d\" tuple3\nlet edges =\n  let arr = Array.make v [] in\n  ListL.iter ls ~f:(fun (s,t,d)->\n      arr.(s) <- (t,d)::arr.(s));\n  arr\n\nlet dists = Array.make v max_num\nlet visited = Array.make v false\n\nmodule Heap = Set.Make(struct\n    type t = int*int\n    let compare (x0, y0) (x1,y1) =\n      match compare y0 y1 with\n      | 0 -> compare x0 x1\n      | c -> c\n  end)\n\nlet rec solve h =\n  if Heap.is_empty h then ()\n  else\n    let (t, dist) = Heap.min_elt h in\n    if visited.(t) then solve @@ Heap.remove (t, dist) h\n    else\n      begin\n        visited.(t) <- true; dists.(t) <- dist;\n        solve @@ ListL.fold_left edges.(t)\n          ~init:(Heap.remove (t, dist) h) ~f:(fun h (s, d) ->\n              if not visited.(s) then Heap.add (s, dists.(t) + d) h\n              else h)\n      end\n\nlet () =\n  solve @@ (Heap.empty |> Heap.add (r,0));\n  ArrayL.iter dists ~f:(fun v ->\n      if v = max_num then print_string \"INF\\n\"\n      else Printf.printf \"%d\\n\" v)\n\n", "language": "OCaml", "metadata": {"date": 1589384458, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02361.html", "problem_id": "p02361", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02361/input.txt", "sample_output_relpath": "derived/input_output/data/p02361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02361/OCaml/s511554504.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511554504", "user_id": "u827214117"}, "prompt_components": {"gold_output": "0\n1\n3\n4\n", "input_to_evaluate": "module ArrayL = ArrayLabels\nmodule ListL = ListLabels\n\nlet dbg = Printf.printf \"[debug]%s\"\n\nlet max_num = 1_000_000_000\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\nlet tuple3 x y z = (x,y,z)\nlet succ x = x + 1\nlet pred x = x - 1\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 scan fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scan_lines n fmt f =\n  List.map (fun _ -> scan fmt f) (0++^n)\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 string_to_list s =\n  List.map (String.get s) (0 ++^ String.length s)\n\nlet (v,e,r) = scan \"%d %d %d\" tuple3\nlet ls = scan_lines e \"%d %d %d\" tuple3\nlet edges =\n  let arr = Array.make v [] in\n  ListL.iter ls ~f:(fun (s,t,d)->\n      arr.(s) <- (t,d)::arr.(s));\n  arr\n\nlet dists = Array.make v max_num\nlet visited = Array.make v false\n\nmodule Heap = Set.Make(struct\n    type t = int*int\n    let compare (x0, y0) (x1,y1) =\n      match compare y0 y1 with\n      | 0 -> compare x0 x1\n      | c -> c\n  end)\n\nlet rec solve h =\n  if Heap.is_empty h then ()\n  else\n    let (t, dist) = Heap.min_elt h in\n    if visited.(t) then solve @@ Heap.remove (t, dist) h\n    else\n      begin\n        visited.(t) <- true; dists.(t) <- dist;\n        solve @@ ListL.fold_left edges.(t)\n          ~init:(Heap.remove (t, dist) h) ~f:(fun h (s, d) ->\n              if not visited.(s) then Heap.add (s, dists.(t) + d) h\n              else h)\n      end\n\nlet () =\n  solve @@ (Heap.empty |> Heap.add (r,0));\n  ArrayL.iter dists ~f:(fun v ->\n      if v = max_num then print_string \"INF\\n\"\n      else Printf.printf \"%d\\n\" v)\n\n", "problem_context": "Single Source Shortest Path\n\nFor a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).\n\nInput\n\nAn edge-weighted graph G (V, E) and the source r.\n\n|V| |E| r\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.\n\nOutput\n\nPrint the costs of SSSP in the following format.\n\nc0\nc1\n:\nc|V|-1\n\nThe output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print INF.\n\nConstraints\n\n1 ≤ |V| ≤ 100000\n\n0 ≤ di ≤ 10000\n\n0 ≤ |E| ≤ 500000\n\nThere are no parallel edges\n\nThere are no self-loops\n\nSample Input 1\n\n4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n\nSample Output 1\n\n0\n1\n3\n4\n\nSample Input 2\n\n4 6 1\n0 1 1\n0 2 4\n2 0 1\n1 2 2\n3 1 1\n3 2 5\n\nSample Output 2\n\n3\n0\n2\nINF", "sample_input": "4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n"}, "reference_outputs": ["0\n1\n3\n4\n"], "source_document_id": "p02361", "source_text": "Single Source Shortest Path\n\nFor a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).\n\nInput\n\nAn edge-weighted graph G (V, E) and the source r.\n\n|V| |E| r\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.\n\nOutput\n\nPrint the costs of SSSP in the following format.\n\nc0\nc1\n:\nc|V|-1\n\nThe output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print INF.\n\nConstraints\n\n1 ≤ |V| ≤ 100000\n\n0 ≤ di ≤ 10000\n\n0 ≤ |E| ≤ 500000\n\nThere are no parallel edges\n\nThere are no self-loops\n\nSample Input 1\n\n4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n\nSample Output 1\n\n0\n1\n3\n4\n\nSample Input 2\n\n4 6 1\n0 1 1\n0 2 4\n2 0 1\n1 2 2\n3 1 1\n3 2 5\n\nSample Output 2\n\n3\n0\n2\nINF", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1887, "cpu_time_ms": 1410, "memory_kb": 120456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s065998188", "group_id": "codeNet:p02363", "input_text": "module type SEMIRING = \nsig\n\ttype t\n\tval add : t -> t -> t\n\tval mul : t -> t -> t\n\tval unit : t\n\tval zero : t\n\t\n\tval debug : t -> string\nend\n\nmodule type VECT = \n\tfunctor (T : SEMIRING) ->\n\t\tsig\n\t\t\ttype t\n\t\t\tval zero : int -> t\n\t\t\tval list2vect : (T.t list) -> t \n\t\t\tval vect2list : t -> (T.t list)\n\t\t\tval add : t -> t -> t\n\t\t\tval dot : t -> t -> T.t\n\t\t\t\n\t\t\tval debug : t -> string\n\t\tend\n\nmodule Vect : VECT = \n\tfunctor (T : SEMIRING) -> struct\n\t\ttype t = (T.t list) \n\t\tlet list2vect xs = xs\n\t\tlet vect2list xs = xs\n\t\tlet rec zero n = if n = 0 then [] else T.zero :: zero (n-1)\n\t\t\n\t\tlet fzip f a b = List.map (fun (x,y) -> f x y) (List.combine a b)\n\t\tlet add a b = fzip T.add a b\n\t\tlet dot a b = List.fold_left T.add T.zero (fzip T.mul a b)\n\t\t\n\t\tlet debug v = Printf.sprintf \"[%s]\" (String.concat \"; \" (List.map T.debug v))\n\t\t\t\n\tend\n\nmodule type MAT = \n\tfunctor (T : SEMIRING) ->\n\t\tsig \n\t\t\ttype t\n\t\t\tval unit : int -> t\n\t\t\tval zero : int -> t\n\t\t\tval trans : t -> t (* ??¢??? *)\n\t\t\tval add : t -> t -> t\n\t\t\tval mul : t -> t -> t\n\t\t\tval list2mat : (T.t list) list -> t\n\t\t\tval mat2list : t -> (T.t list) list\n\t\t\tval vect2mat : Vect(T).t -> t\n\t\t\t\n\t\t\tval debug : t -> string\n\t\tend\n\nmodule IntSemiring = \nstruct\n\ttype t = int\n\tlet add a b = a + b\n\tlet mul a b = a * b\n\tlet unit = 1\n\tlet zero = 0\n\t\n\tlet debug v = Printf.sprintf \"%d\" v\nend\n\nmodule BoolSemiring = \nstruct\n\ttype t = bool\n\tlet add a b = a <> b\n\tlet mul a b = a && b\n\tlet unit = true\n\tlet zero = false\n\t\n\tlet debug v = if v then \"true\" else \"false\" \nend\n\ntype tropical = Int of int | Inf\n\nmodule TropicalSemiring = \nstruct\n\ttype t = tropical\n\tlet add a b = \n\t\tmatch a with \n\t\t| Inf -> b\n\t\t| Int ia -> \n\t\t\tmatch b with\n\t\t\t| Inf -> a\n\t\t\t| Int ib -> Int (min ia ib)\n\tlet mul a b = \n\t\tmatch a with \n\t\t| Inf -> Inf\n\t\t| Int ia -> \n\t\t\tmatch b with\n\t\t\t| Inf -> Inf\n\t\t\t| Int ib -> Int (ia + ib)\n\t\n\tlet unit = Int 0\n\tlet zero = Inf\n\t\n\tlet debug v = \n\t\tmatch v with \n\t\t| Inf -> \"INF\"\n\t\t| Int a -> Printf.sprintf \"%d\" a\nend\n\nmodule Mat : MAT = \n\tfunctor (T : SEMIRING) -> struct\n\t\tmodule Vt = Vect(T)\n\t\ttype t = Vt.t list\n\t\tlet fzip f a b = List.map (fun (x,y) -> f x y) (List.combine a b)\n\t\tlet trans v = \n\t\t\tlet vt = List.map Vt.vect2list v in\n\t\t\tlet rec trans_sub a = \n\t\t\t\tmatch a with\n\t\t\t\t| [] -> []\n\t\t\t\t| x :: xs -> \n\t\t\t\t\tif x = [] then [] else\n\t\t\t\t\t(Vt.list2vect (List.map List.hd a)) :: trans_sub (List.map List.tl a) in\n\t\t\ttrans_sub vt\n\t\tlet add a b = fzip Vt.add a b\n\t\tlet mul a b = \n\t\t\tlet tb = trans b in\n\t\t\tlet rec mul_sub va vb = \n\t\t\t\tmatch va with\n\t\t\t\t| [] -> []\n\t\t\t\t| x :: xs -> (Vt.list2vect (List.map (fun t -> Vt.dot x t) vb)) :: (mul_sub xs vb) in\n\t\t\tmul_sub a tb\n\t\tlet zero n = \n\t\t\tlet rec zero_sub nn = if nn = 0 then [] else Vt.zero n :: (zero_sub (nn-1)) \n\t\t\t\tin zero_sub n\n\t\tlet unit n = \n\t\t\tlet rec onehot nn x = \n\t\t\t\tif nn = 0 then [] else\n\t\t\t\t\t(if x = nn then T.unit else T.zero) :: (onehot (nn-1) x) in\n\t\t\tlet rec unit_sub a = \n\t\t\t\tif a = 0 then [] else\n\t\t\t\t\t(Vt.list2vect (onehot n a)) :: (unit_sub (a-1)) in\n\t\t\tunit_sub n\n\t\t\n\t\tlet list2mat v = List.map Vt.list2vect v\n\t\tlet mat2list v = List.map Vt.vect2list v\n\t\tlet vect2mat v = [v]\n\t\t\n\t\tlet debug v = Printf.sprintf \"[\\n%s]\" (String.concat \";\\n\" (List.map Vt.debug v))\n\t\t\n\tend\n\n\n\nmodule TropicalMat = Mat(TropicalSemiring)\n\n\nlet _ = \n\tlet (n,m) = Scanf.scanf \"%d %d\\n\" (fun a b -> (a,b)) in\n\tlet v = (Array.make_matrix n n Inf) in\n\tlet _ = \n\t\tfor i = 0 to (n-1) do\n\t\t\tArray.set v.(i) i (Int 0)\n\t\tdone;\n\t\tfor i = 0 to (m-1) do\n\t\t\tlet (s,t,d) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a,b,c)) in\n\t\t\tArray.set v.(s) t (Int d)\n\t\tdone in\n\tlet mat = TropicalMat.list2mat (Array.to_list (Array.map Array.to_list v)) in\n(*\n\tlet _ = (print_string (TropicalMat.debug mat)) in\n*)\n\tlet rec matpow x y b = \n\t\tif y = 1 then b else\n\t\t\tlet tx = matpow x (y/2) b in\n\t\t\tlet ttx = TropicalMat.mul tx tx in\n\t\t\tif y mod 2 = 1 then TropicalMat.mul ttx b else ttx in\n\tlet ansma = (matpow mat n mat) in\n(*\n\tlet _ = (print_string (TropicalMat.debug ansma)) in\n*)\n\tlet ans = Array.of_list (List.map Array.of_list (TropicalMat.mat2list ansma)) in\n\tlet ok = ref true in\n\tlet _ = \n\t\tfor i = 0 to (n-1) do\n\t\t\tmatch ans.(i).(i) with\n\t\t\t| Inf -> ok := false\n\t\t\t| Int x -> ok := (!ok) && (x >= 0)\n\t\tdone in\n\tif not !ok then Printf.printf \"NEGATIVE CYCLE\\n\" else\n\t\tfor i = 0 to (n-1) do\n\t\t\tfor j = 0 to (n-1) do\n\t\t\t\tPrintf.printf \"%s%c\" (TropicalSemiring.debug ans.(i).(j)) (if j = (n-1) then '\\n' else ' ')\n\t\t\tdone\n\t\tdone\n\t\n\t\n\t", "language": "OCaml", "metadata": {"date": 1494843117, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02363.html", "problem_id": "p02363", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02363/input.txt", "sample_output_relpath": "derived/input_output/data/p02363/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02363/OCaml/s065998188.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065998188", "user_id": "u182677953"}, "prompt_components": {"gold_output": "0 1 3 4\nINF 0 2 3\nINF INF 0 1\nINF INF 7 0\n", "input_to_evaluate": "module type SEMIRING = \nsig\n\ttype t\n\tval add : t -> t -> t\n\tval mul : t -> t -> t\n\tval unit : t\n\tval zero : t\n\t\n\tval debug : t -> string\nend\n\nmodule type VECT = \n\tfunctor (T : SEMIRING) ->\n\t\tsig\n\t\t\ttype t\n\t\t\tval zero : int -> t\n\t\t\tval list2vect : (T.t list) -> t \n\t\t\tval vect2list : t -> (T.t list)\n\t\t\tval add : t -> t -> t\n\t\t\tval dot : t -> t -> T.t\n\t\t\t\n\t\t\tval debug : t -> string\n\t\tend\n\nmodule Vect : VECT = \n\tfunctor (T : SEMIRING) -> struct\n\t\ttype t = (T.t list) \n\t\tlet list2vect xs = xs\n\t\tlet vect2list xs = xs\n\t\tlet rec zero n = if n = 0 then [] else T.zero :: zero (n-1)\n\t\t\n\t\tlet fzip f a b = List.map (fun (x,y) -> f x y) (List.combine a b)\n\t\tlet add a b = fzip T.add a b\n\t\tlet dot a b = List.fold_left T.add T.zero (fzip T.mul a b)\n\t\t\n\t\tlet debug v = Printf.sprintf \"[%s]\" (String.concat \"; \" (List.map T.debug v))\n\t\t\t\n\tend\n\nmodule type MAT = \n\tfunctor (T : SEMIRING) ->\n\t\tsig \n\t\t\ttype t\n\t\t\tval unit : int -> t\n\t\t\tval zero : int -> t\n\t\t\tval trans : t -> t (* ??¢??? *)\n\t\t\tval add : t -> t -> t\n\t\t\tval mul : t -> t -> t\n\t\t\tval list2mat : (T.t list) list -> t\n\t\t\tval mat2list : t -> (T.t list) list\n\t\t\tval vect2mat : Vect(T).t -> t\n\t\t\t\n\t\t\tval debug : t -> string\n\t\tend\n\nmodule IntSemiring = \nstruct\n\ttype t = int\n\tlet add a b = a + b\n\tlet mul a b = a * b\n\tlet unit = 1\n\tlet zero = 0\n\t\n\tlet debug v = Printf.sprintf \"%d\" v\nend\n\nmodule BoolSemiring = \nstruct\n\ttype t = bool\n\tlet add a b = a <> b\n\tlet mul a b = a && b\n\tlet unit = true\n\tlet zero = false\n\t\n\tlet debug v = if v then \"true\" else \"false\" \nend\n\ntype tropical = Int of int | Inf\n\nmodule TropicalSemiring = \nstruct\n\ttype t = tropical\n\tlet add a b = \n\t\tmatch a with \n\t\t| Inf -> b\n\t\t| Int ia -> \n\t\t\tmatch b with\n\t\t\t| Inf -> a\n\t\t\t| Int ib -> Int (min ia ib)\n\tlet mul a b = \n\t\tmatch a with \n\t\t| Inf -> Inf\n\t\t| Int ia -> \n\t\t\tmatch b with\n\t\t\t| Inf -> Inf\n\t\t\t| Int ib -> Int (ia + ib)\n\t\n\tlet unit = Int 0\n\tlet zero = Inf\n\t\n\tlet debug v = \n\t\tmatch v with \n\t\t| Inf -> \"INF\"\n\t\t| Int a -> Printf.sprintf \"%d\" a\nend\n\nmodule Mat : MAT = \n\tfunctor (T : SEMIRING) -> struct\n\t\tmodule Vt = Vect(T)\n\t\ttype t = Vt.t list\n\t\tlet fzip f a b = List.map (fun (x,y) -> f x y) (List.combine a b)\n\t\tlet trans v = \n\t\t\tlet vt = List.map Vt.vect2list v in\n\t\t\tlet rec trans_sub a = \n\t\t\t\tmatch a with\n\t\t\t\t| [] -> []\n\t\t\t\t| x :: xs -> \n\t\t\t\t\tif x = [] then [] else\n\t\t\t\t\t(Vt.list2vect (List.map List.hd a)) :: trans_sub (List.map List.tl a) in\n\t\t\ttrans_sub vt\n\t\tlet add a b = fzip Vt.add a b\n\t\tlet mul a b = \n\t\t\tlet tb = trans b in\n\t\t\tlet rec mul_sub va vb = \n\t\t\t\tmatch va with\n\t\t\t\t| [] -> []\n\t\t\t\t| x :: xs -> (Vt.list2vect (List.map (fun t -> Vt.dot x t) vb)) :: (mul_sub xs vb) in\n\t\t\tmul_sub a tb\n\t\tlet zero n = \n\t\t\tlet rec zero_sub nn = if nn = 0 then [] else Vt.zero n :: (zero_sub (nn-1)) \n\t\t\t\tin zero_sub n\n\t\tlet unit n = \n\t\t\tlet rec onehot nn x = \n\t\t\t\tif nn = 0 then [] else\n\t\t\t\t\t(if x = nn then T.unit else T.zero) :: (onehot (nn-1) x) in\n\t\t\tlet rec unit_sub a = \n\t\t\t\tif a = 0 then [] else\n\t\t\t\t\t(Vt.list2vect (onehot n a)) :: (unit_sub (a-1)) in\n\t\t\tunit_sub n\n\t\t\n\t\tlet list2mat v = List.map Vt.list2vect v\n\t\tlet mat2list v = List.map Vt.vect2list v\n\t\tlet vect2mat v = [v]\n\t\t\n\t\tlet debug v = Printf.sprintf \"[\\n%s]\" (String.concat \";\\n\" (List.map Vt.debug v))\n\t\t\n\tend\n\n\n\nmodule TropicalMat = Mat(TropicalSemiring)\n\n\nlet _ = \n\tlet (n,m) = Scanf.scanf \"%d %d\\n\" (fun a b -> (a,b)) in\n\tlet v = (Array.make_matrix n n Inf) in\n\tlet _ = \n\t\tfor i = 0 to (n-1) do\n\t\t\tArray.set v.(i) i (Int 0)\n\t\tdone;\n\t\tfor i = 0 to (m-1) do\n\t\t\tlet (s,t,d) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a,b,c)) in\n\t\t\tArray.set v.(s) t (Int d)\n\t\tdone in\n\tlet mat = TropicalMat.list2mat (Array.to_list (Array.map Array.to_list v)) in\n(*\n\tlet _ = (print_string (TropicalMat.debug mat)) in\n*)\n\tlet rec matpow x y b = \n\t\tif y = 1 then b else\n\t\t\tlet tx = matpow x (y/2) b in\n\t\t\tlet ttx = TropicalMat.mul tx tx in\n\t\t\tif y mod 2 = 1 then TropicalMat.mul ttx b else ttx in\n\tlet ansma = (matpow mat n mat) in\n(*\n\tlet _ = (print_string (TropicalMat.debug ansma)) in\n*)\n\tlet ans = Array.of_list (List.map Array.of_list (TropicalMat.mat2list ansma)) in\n\tlet ok = ref true in\n\tlet _ = \n\t\tfor i = 0 to (n-1) do\n\t\t\tmatch ans.(i).(i) with\n\t\t\t| Inf -> ok := false\n\t\t\t| Int x -> ok := (!ok) && (x >= 0)\n\t\tdone in\n\tif not !ok then Printf.printf \"NEGATIVE CYCLE\\n\" else\n\t\tfor i = 0 to (n-1) do\n\t\t\tfor j = 0 to (n-1) do\n\t\t\t\tPrintf.printf \"%s%c\" (TropicalSemiring.debug ans.(i).(j)) (if j = (n-1) then '\\n' else ' ')\n\t\t\tdone\n\t\tdone\n\t\n\t\n\t", "problem_context": "All Pairs Shortest Path\n\nInput\n\nAn edge-weighted graph G (V, E).\n\n|V| |E|\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.\n\nOutput\n\nIf the graph contains a negative cycle (a cycle whose sum of edge costs is a negative value), print\n\nNEGATIVE CYCLE\n\nin a line.\n\nOtherwise, print\n\nD0,0 D0,1 ... D0,|V|-1\nD1,0 D1,1 ... D1,|V|-1\n:\nD|V|-1,0 D1,1 ... D|V|-1,|V|-1\n\nThe output consists of |V| lines. For each ith line, print the cost of the shortest path from vertex i to each vertex j (j = 0, 1, ... |V|-1) respectively. If there is no path from vertex i to vertex j, print \"INF\". Print a space between the costs.\n\nConstraints\n\n1 ≤ |V| ≤ 100\n\n0 ≤ |E| ≤ 9900\n\n-2 × 107 ≤ di ≤ 2 × 107\n\nThere are no parallel edges\n\nThere are no self-loops\n\nSample Input 1\n\n4 6\n0 1 1\n0 2 5\n1 2 2\n1 3 4\n2 3 1\n3 2 7\n\nSample Output 1\n\n0 1 3 4\nINF 0 2 3\nINF INF 0 1\nINF INF 7 0\n\nSample Input 2\n\n4 6\n0 1 1\n0 2 -5\n1 2 2\n1 3 4\n2 3 1\n3 2 7\n\nSample Output 2\n\n0 1 -5 -4\nINF 0 2 3\nINF INF 0 1\nINF INF 7 0\n\nSample Input 3\n\n4 6\n0 1 1\n0 2 5\n1 2 2\n1 3 4\n2 3 1\n3 2 -7\n\nSample Output 3\n\nNEGATIVE CYCLE", "sample_input": "4 6\n0 1 1\n0 2 5\n1 2 2\n1 3 4\n2 3 1\n3 2 7\n"}, "reference_outputs": ["0 1 3 4\nINF 0 2 3\nINF INF 0 1\nINF INF 7 0\n"], "source_document_id": "p02363", "source_text": "All Pairs Shortest Path\n\nInput\n\nAn edge-weighted graph G (V, E).\n\n|V| |E|\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.\n\nOutput\n\nIf the graph contains a negative cycle (a cycle whose sum of edge costs is a negative value), print\n\nNEGATIVE CYCLE\n\nin a line.\n\nOtherwise, print\n\nD0,0 D0,1 ... D0,|V|-1\nD1,0 D1,1 ... D1,|V|-1\n:\nD|V|-1,0 D1,1 ... D|V|-1,|V|-1\n\nThe output consists of |V| lines. For each ith line, print the cost of the shortest path from vertex i to each vertex j (j = 0, 1, ... |V|-1) respectively. If there is no path from vertex i to vertex j, print \"INF\". Print a space between the costs.\n\nConstraints\n\n1 ≤ |V| ≤ 100\n\n0 ≤ |E| ≤ 9900\n\n-2 × 107 ≤ di ≤ 2 × 107\n\nThere are no parallel edges\n\nThere are no self-loops\n\nSample Input 1\n\n4 6\n0 1 1\n0 2 5\n1 2 2\n1 3 4\n2 3 1\n3 2 7\n\nSample Output 1\n\n0 1 3 4\nINF 0 2 3\nINF INF 0 1\nINF INF 7 0\n\nSample Input 2\n\n4 6\n0 1 1\n0 2 -5\n1 2 2\n1 3 4\n2 3 1\n3 2 7\n\nSample Output 2\n\n0 1 -5 -4\nINF 0 2 3\nINF INF 0 1\nINF INF 7 0\n\nSample Input 3\n\n4 6\n0 1 1\n0 2 5\n1 2 2\n1 3 4\n2 3 1\n3 2 -7\n\nSample Output 3\n\nNEGATIVE CYCLE", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4421, "cpu_time_ms": 180, "memory_kb": 9056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s425852504", "group_id": "codeNet:p02396", "input_text": "let rec f?(n=read_int())i=if n>0then f(Printf.printf\"Case %d: %d\n\"i n;i+1);;f 1", "language": "OCaml", "metadata": {"date": 1473843171, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02396.html", "problem_id": "p02396", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02396/input.txt", "sample_output_relpath": "derived/input_output/data/p02396/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02396/OCaml/s425852504.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s425852504", "user_id": "u809138450"}, "prompt_components": {"gold_output": "Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n", "input_to_evaluate": "let rec f?(n=read_int())i=if n>0then f(Printf.printf\"Case %d: %d\n\"i n;i+1);;f 1", "problem_context": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "sample_input": "3\n5\n11\n7\n8\n19\n0\n"}, "reference_outputs": ["Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n"], "source_document_id": "p02396", "source_text": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 4392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s075269015", "group_id": "codeNet:p02414", "input_text": "let r()=List.map int_of_string(Str.split(Str.regexp\" \")(read_line()))open Array;;match r()with[n;m;l]->(let($)s t=let a=make_matrix s t 0in for i=0to s-1do let x=of_list(r())in for j=0to t-1do a.(i).(j)<-x.(j)done done;a in let a=n$m and b=m$l in for i=0to n-1do for j=0to l-1do let c=ref 0in for k=0to m-1do c:=!c+a.(i).(k)*b.(k).(j)done;Printf.printf(if j=0then\"%d\"else\" %d\")!c done;print_newline()done)|_->()", "language": "OCaml", "metadata": {"date": 1473800675, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02414.html", "problem_id": "p02414", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02414/input.txt", "sample_output_relpath": "derived/input_output/data/p02414/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02414/OCaml/s075269015.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s075269015", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1 8 5\n0 9 6\n4 23 14\n", "input_to_evaluate": "let r()=List.map int_of_string(Str.split(Str.regexp\" \")(read_line()))open Array;;match r()with[n;m;l]->(let($)s t=let a=make_matrix s t 0in for i=0to s-1do let x=of_list(r())in for j=0to t-1do a.(i).(j)<-x.(j)done done;a in let a=n$m and b=m$l in for i=0to n-1do for j=0to l-1do let c=ref 0in for k=0to m-1do c:=!c+a.(i).(k)*b.(k).(j)done;Printf.printf(if j=0then\"%d\"else\" %d\")!c done;print_newline()done)|_->()", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMatrix Multiplication\n\nWrite a program which reads a $n \\times m$ matrix $A$ and a $m \\times l$ matrix $B$, and prints their product, a $n \\times l$ matrix $C$. An element of matrix $C$ is obtained by the following formula:\n\n\\[\nc_{ij} = \\sum_{k=1}^m a_{ik}b_{kj}\n\\]\n\nwhere $a_{ij}$, $b_{ij}$ and $c_{ij}$ are elements of $A$, $B$ and $C$ respectively.\n\nInput\n\nIn the first line, three integers $n$, $m$ and $l$ are given separated by space characters\n\nIn the following lines, the $n \\times m$ matrix $A$ and the $m \\times l$ matrix $B$ are given.\n\nOutput\n\nPrint elements of the $n \\times l$ matrix $C$ ($c_{ij}$). Print a single space character between adjacent elements.\n\nConstraints\n\n$1 \\leq n, m, l \\leq 100$\n\n$0 \\leq a_{ij}, b_{ij} \\leq 10000$\n\nSample Input\n\n3 2 3\n1 2\n0 3\n4 5\n1 2 1\n0 3 2\n\nSample Output\n\n1 8 5\n0 9 6\n4 23 14\n\nNote\n\n      解説", "sample_input": "3 2 3\n1 2\n0 3\n4 5\n1 2 1\n0 3 2\n"}, "reference_outputs": ["1 8 5\n0 9 6\n4 23 14\n"], "source_document_id": "p02414", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMatrix Multiplication\n\nWrite a program which reads a $n \\times m$ matrix $A$ and a $m \\times l$ matrix $B$, and prints their product, a $n \\times l$ matrix $C$. An element of matrix $C$ is obtained by the following formula:\n\n\\[\nc_{ij} = \\sum_{k=1}^m a_{ik}b_{kj}\n\\]\n\nwhere $a_{ij}$, $b_{ij}$ and $c_{ij}$ are elements of $A$, $B$ and $C$ respectively.\n\nInput\n\nIn the first line, three integers $n$, $m$ and $l$ are given separated by space characters\n\nIn the following lines, the $n \\times m$ matrix $A$ and the $m \\times l$ matrix $B$ are given.\n\nOutput\n\nPrint elements of the $n \\times l$ matrix $C$ ($c_{ij}$). Print a single space character between adjacent elements.\n\nConstraints\n\n$1 \\leq n, m, l \\leq 100$\n\n$0 \\leq a_{ij}, b_{ij} \\leq 10000$\n\nSample Input\n\n3 2 3\n1 2\n0 3\n4 5\n1 2 1\n0 3 2\n\nSample Output\n\n1 8 5\n0 9 6\n4 23 14\n\nNote\n\n      解説", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 411, "cpu_time_ms": 10, "memory_kb": 4656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s051796928", "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 cls =\n    let v0 = g |> A.findi (fun v -> not @@ G.getd g v) in\n    G.setdi g v0 true;\n    (* puti v0; *)\n    let cls_next = g |> G.frontier (fun v opnb g ->\n      opnb |> Ss.iter (fun w -> G.setdi g w true); true\n      ) (Ss.sing v0) cls in\n    (* print_list @@ Ss.to_list cls_next; *)\n    if Ss.size cls_next = n then (Ss.add v0 rvs)\n    else decomp (Ss.add v0 rvs) cls_next\n  in\n\n  let rvs = decomp Ss.empty Ss.empty in\n  puti @@ Ss.size rvs - 1;\n  ()\n", "language": "OCaml", "metadata": {"date": 1601171809, "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/s051796928.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s051796928", "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 cls =\n    let v0 = g |> A.findi (fun v -> not @@ G.getd g v) in\n    G.setdi g v0 true;\n    (* puti v0; *)\n    let cls_next = g |> G.frontier (fun v opnb g ->\n      opnb |> Ss.iter (fun w -> G.setdi g w true); true\n      ) (Ss.sing v0) cls in\n    (* print_list @@ Ss.to_list cls_next; *)\n    if Ss.size cls_next = n then (Ss.add v0 rvs)\n    else decomp (Ss.add v0 rvs) cls_next\n  in\n\n  let rvs = decomp Ss.empty 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10474, "cpu_time_ms": 2206, "memory_kb": 42520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s838177225", "group_id": "codeNet:p02538", "input_text": "module type LazySegtreeType = sig\n    type s\n    type f\n    type t\n\n    val make     : int -> t\n    val of_array : s array -> t\n    val set      : t -> int -> s -> unit\n    val get      : t -> int -> s\n    val prod     : t -> int -> int -> s\n    val all_prod : t -> s\n    val apply1   : t -> int -> f -> unit\n    val apply    : t -> int -> int -> f -> unit\n    val max_right: t -> int -> (s -> bool) -> int\n    val min_left : t -> int -> (s -> bool) -> int\nend\n\nmodule type LazySegtreeParam = sig\n    type s\n    type f\n\n    val op         : s -> s -> s\n    val e          : s\n    val mapping    : f -> s -> s\n    val composition: f -> f -> f \n    val id         : f\nend\n\nmodule LazySegtree = struct\n    module Make(LSP: LazySegtreeParam) :\n        LazySegtreeType with type s = LSP.s and\n                             type f = LSP.f = struct\n        type s = LSP.s\n        type f = LSP.f\n        type t = int * int * int * s array * f array\n\n        let ceil_pow2 n =\n            let rec loop x =\n                if 1 lsl x < n then loop (x + 1) else x\n            in\n            loop 0\n\n        let update d k = d.(k) <- LSP.op d.(2 * k) d.(2 * k + 1)\n\n        let all_apply (n, log, size, d, lz) k f =\n            d.(k) <- LSP.mapping f d.(k);\n            if k < size then lz.(k) <- LSP.composition f lz.(k)\n\n        let push ((n, log, size, d, lz) as lst) k =\n            all_apply lst (2 * k)     lz.(k);\n            all_apply lst (2 * k + 1) lz.(k);\n            lz.(k) <- LSP.id\n\n        let of_array v =\n            let n = Array.length v in\n            let log = ceil_pow2 n in\n            let size = 1 lsl log in\n            let d = Array.make (2 * size) LSP.e in\n            let lz = Array.make size LSP.id in\n            for i = 0 to n - 1 do d.(size + i) <- v.(i) done;\n            for i = size - 1 downto 1 do update d i done;\n            n, log, size, d, lz\n\n        let make n = of_array (Array.make n LSP.e)\n\n        let set ((n, log, size, d, lz) as lst) p x =\n            let p = p + size in\n            for i = log downto 1 do push lst (p lsr i) done;\n            d.(p) <- x;\n            for i = 1 to log do update d (p lsr i) done\n\n        let get ((n, log, size, d, lz) as lst) p =\n            let p = p + size in\n            for i = log downto 1 do push lst (p lsr i) done;\n            d.(p)\n\n        let prod ((n, log, size, d, lz) as lst) l r =\n            if l = r then LSP.e else (\n                let l = l + size in\n                let r = r + size in\n                for i = log downto 1 do\n                    if (l lsr i) lsl i <> l then push lst (l lsr i);\n                    if (r lsr i) lsl i <> r then push lst (r lsr i);\n                done;\n\n                let rec loop l r sml smr =\n                    if l >= r then LSP.op sml smr else\n                        let sml, l = if l land 1 = 0 then sml, l else LSP.op sml d.(l),     l + 1 in\n                        let smr, r = if r land 1 = 0 then smr, r else LSP.op d.(r - 1) smr, r - 1 in \n                        loop (l lsr 1) (r lsr 1) sml smr\n                in\n                loop l r LSP.e LSP.e\n            )\n\n        let all_prod (n, log, size, d, lz) = d.(1)\n\n        let apply1 ((n, log, size, d, lz) as lst) p f =\n            let p = p + size in\n            for i = log downto 1 do push lst (p lsr i) done;\n            d.(p) <- LSP.mapping f d.(p);\n            for i = 1 to log do update d (p lsr i) done\n\n        let apply ((n, log, size, d, lz) as lst) l r f =\n            if l <> r then (\n                let l = l + size in\n                let r = r + size in\n                for i = log downto 1 do\n                    if (l lsr i) lsl i <> l then push lst (l lsr i);\n                    if (r lsr i) lsl i <> r then push lst ((r - 1) lsr i);\n                done;\n\n                let rec loop l r =\n                    if l < r then (\n                        let l = if l land 1 = 0 then l else (all_apply lst l       f; l + 1) in\n                        let r = if r land 1 = 0 then r else (all_apply lst (r - 1) f; r - 1) in\n                        loop (l lsr 1) (r lsr 1)\n                    )\n                in\n                loop l r;\n\n                for i = 1 to log do\n                    if (l lsr i) lsl i <> l then update d (l lsr i);\n                    if (r lsr i) lsl i <> r then update d ((r - 1) lsr i);\n                done\n            )\n\n        let max_right ((n, log, size, d, lz) as lst) l g =\n            if l = n then n else (\n                let l = l + size in\n                for i = log downto 1 do push lst (l lsr i) done;\n                let rec loop l sm =\n                    let l =\n                        let rec div2 l =\n                            if l mod 2 = 0 then div2 (l lsr 1) else l\n                        in\n                        div2 l\n                    in\n                    if not (g (LSP.op sm d.(l))) then (\n                        let rec loop2 l sm =\n                            if l < size then (\n                                push lst l;\n                                let l = 2 * l in\n                                if g (LSP.op sm d.(l)) then\n                                    loop2 (l + 1) (LSP.op sm d.(l))\n                                else loop2 l sm\n                            ) else l - size\n                        in\n                        loop2 l sm\n                    ) else (\n                        let sm = LSP.op sm d.(l) in\n                        let l = l + 1 in\n                        if l land (-l) <> l then loop l sm else n\n                    )\n                in\n                loop l LSP.e\n            )\n\n        let min_left ((n, log, size, d, lz) as lst) r g =\n            if r = 0 then 0 else (\n                let r = r + size in\n                for i = log downto 1 do push lst ((r - 1) lsr i) done;\n                let rec loop r sm =\n                    let r = \n                        let rec div2 r = \n                            if r > 1 && r mod 2 = 1 then div2 (r lsr 1) else r\n                        in  \n                        div2 (r - 1)\n                    in\n                    if not (g (LSP.op d.(r) sm)) then (\n                        let rec loop2 r sm =\n                            if r < size then (\n                                push lst r;\n                                let r = 2 * r + 1 in\n                                if g (LSP.op d.(r) sm) then\n                                    loop2 (r - 1) (LSP.op d.(r) sm)\n                                else loop2 r sm\n                            ) else r + 1 - size\n                        in\n                        loop2 r sm\n                    ) else (\n                        let sm = LSP.op d.(r) sm in\n                        if r land (-r) <> r then loop r sm else 0\n                    )\n                in\n                loop r LSP.e\n            )\n    end\nend;;\nScanf.scanf \"%d %d\" (fun n q ->\n    let z = 998244353 in\n    let ten = Array.make n 1 in\n    let one = Array.make n 0 in \n    for i = 1 to n - 1 do ten.(i) <- (ten.(i - 1) * 10) mod z done;\n    for i = 1 to n - 1 do one.(i) <- (one.(i - 1) * 10 + 1) mod z done;\n    let module ST = LazySegtree.Make (struct\n        type s = int * int\n        let op (ll, lv) (rl, rv) = ll + rl, (lv * ten.(rl) + rv) mod z\n        let e = 0, 0\n        type f = int\n        let mapping f ((sl, sv) as s) = if f = 0 then s else sl, (one.(sl) * f) mod z\n        let composition l r = if l = 0 then r else l\n        let id = 0\n    end)\n        in\n    let seg = ST.of_array (Array.make n (1, 1)) in\n    for i = 1 to q do\n        Scanf.scanf \" %d %d %d\" (fun l r d ->\n            ST.apply seg (l - 1) r d;\n            let (_, v) = ST.all_prod seg in\n            Printf.printf \"%d\\n\" v\n        )\n    done\n)", "language": "OCaml", "metadata": {"date": 1601228579, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02538.html", "problem_id": "p02538", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02538/input.txt", "sample_output_relpath": "derived/input_output/data/p02538/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02538/OCaml/s838177225.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s838177225", "user_id": "u342443598"}, "prompt_components": {"gold_output": "11222211\n77772211\n77333333\n72333333\n72311333\n", "input_to_evaluate": "module type LazySegtreeType = sig\n    type s\n    type f\n    type t\n\n    val make     : int -> t\n    val of_array : s array -> t\n    val set      : t -> int -> s -> unit\n    val get      : t -> int -> s\n    val prod     : t -> int -> int -> s\n    val all_prod : t -> s\n    val apply1   : t -> int -> f -> unit\n    val apply    : t -> int -> int -> f -> unit\n    val max_right: t -> int -> (s -> bool) -> int\n    val min_left : t -> int -> (s -> bool) -> int\nend\n\nmodule type LazySegtreeParam = sig\n    type s\n    type f\n\n    val op         : s -> s -> s\n    val e          : s\n    val mapping    : f -> s -> s\n    val composition: f -> f -> f \n    val id         : f\nend\n\nmodule LazySegtree = struct\n    module Make(LSP: LazySegtreeParam) :\n        LazySegtreeType with type s = LSP.s and\n                             type f = LSP.f = struct\n        type s = LSP.s\n        type f = LSP.f\n        type t = int * int * int * s array * f array\n\n        let ceil_pow2 n =\n            let rec loop x =\n                if 1 lsl x < n then loop (x + 1) else x\n            in\n            loop 0\n\n        let update d k = d.(k) <- LSP.op d.(2 * k) d.(2 * k + 1)\n\n        let all_apply (n, log, size, d, lz) k f =\n            d.(k) <- LSP.mapping f d.(k);\n            if k < size then lz.(k) <- LSP.composition f lz.(k)\n\n        let push ((n, log, size, d, lz) as lst) k =\n            all_apply lst (2 * k)     lz.(k);\n            all_apply lst (2 * k + 1) lz.(k);\n            lz.(k) <- LSP.id\n\n        let of_array v =\n            let n = Array.length v in\n            let log = ceil_pow2 n in\n            let size = 1 lsl log in\n            let d = Array.make (2 * size) LSP.e in\n            let lz = Array.make size LSP.id in\n            for i = 0 to n - 1 do d.(size + i) <- v.(i) done;\n            for i = size - 1 downto 1 do update d i done;\n            n, log, size, d, lz\n\n        let make n = of_array (Array.make n LSP.e)\n\n        let set ((n, log, size, d, lz) as lst) p x =\n            let p = p + size in\n            for i = log downto 1 do push lst (p lsr i) done;\n            d.(p) <- x;\n            for i = 1 to log do update d (p lsr i) done\n\n        let get ((n, log, size, d, lz) as lst) p =\n            let p = p + size in\n            for i = log downto 1 do push lst (p lsr i) done;\n            d.(p)\n\n        let prod ((n, log, size, d, lz) as lst) l r =\n            if l = r then LSP.e else (\n                let l = l + size in\n                let r = r + size in\n                for i = log downto 1 do\n                    if (l lsr i) lsl i <> l then push lst (l lsr i);\n                    if (r lsr i) lsl i <> r then push lst (r lsr i);\n                done;\n\n                let rec loop l r sml smr =\n                    if l >= r then LSP.op sml smr else\n                        let sml, l = if l land 1 = 0 then sml, l else LSP.op sml d.(l),     l + 1 in\n                        let smr, r = if r land 1 = 0 then smr, r else LSP.op d.(r - 1) smr, r - 1 in \n                        loop (l lsr 1) (r lsr 1) sml smr\n                in\n                loop l r LSP.e LSP.e\n            )\n\n        let all_prod (n, log, size, d, lz) = d.(1)\n\n        let apply1 ((n, log, size, d, lz) as lst) p f =\n            let p = p + size in\n            for i = log downto 1 do push lst (p lsr i) done;\n            d.(p) <- LSP.mapping f d.(p);\n            for i = 1 to log do update d (p lsr i) done\n\n        let apply ((n, log, size, d, lz) as lst) l r f =\n            if l <> r then (\n                let l = l + size in\n                let r = r + size in\n                for i = log downto 1 do\n                    if (l lsr i) lsl i <> l then push lst (l lsr i);\n                    if (r lsr i) lsl i <> r then push lst ((r - 1) lsr i);\n                done;\n\n                let rec loop l r =\n                    if l < r then (\n                        let l = if l land 1 = 0 then l else (all_apply lst l       f; l + 1) in\n                        let r = if r land 1 = 0 then r else (all_apply lst (r - 1) f; r - 1) in\n                        loop (l lsr 1) (r lsr 1)\n                    )\n                in\n                loop l r;\n\n                for i = 1 to log do\n                    if (l lsr i) lsl i <> l then update d (l lsr i);\n                    if (r lsr i) lsl i <> r then update d ((r - 1) lsr i);\n                done\n            )\n\n        let max_right ((n, log, size, d, lz) as lst) l g =\n            if l = n then n else (\n                let l = l + size in\n                for i = log downto 1 do push lst (l lsr i) done;\n                let rec loop l sm =\n                    let l =\n                        let rec div2 l =\n                            if l mod 2 = 0 then div2 (l lsr 1) else l\n                        in\n                        div2 l\n                    in\n                    if not (g (LSP.op sm d.(l))) then (\n                        let rec loop2 l sm =\n                            if l < size then (\n                                push lst l;\n                                let l = 2 * l in\n                                if g (LSP.op sm d.(l)) then\n                                    loop2 (l + 1) (LSP.op sm d.(l))\n                                else loop2 l sm\n                            ) else l - size\n                        in\n                        loop2 l sm\n                    ) else (\n                        let sm = LSP.op sm d.(l) in\n                        let l = l + 1 in\n                        if l land (-l) <> l then loop l sm else n\n                    )\n                in\n                loop l LSP.e\n            )\n\n        let min_left ((n, log, size, d, lz) as lst) r g =\n            if r = 0 then 0 else (\n                let r = r + size in\n                for i = log downto 1 do push lst ((r - 1) lsr i) done;\n                let rec loop r sm =\n                    let r = \n                        let rec div2 r = \n                            if r > 1 && r mod 2 = 1 then div2 (r lsr 1) else r\n                        in  \n                        div2 (r - 1)\n                    in\n                    if not (g (LSP.op d.(r) sm)) then (\n                        let rec loop2 r sm =\n                            if r < size then (\n                                push lst r;\n                                let r = 2 * r + 1 in\n                                if g (LSP.op d.(r) sm) then\n                                    loop2 (r - 1) (LSP.op d.(r) sm)\n                                else loop2 r sm\n                            ) else r + 1 - size\n                        in\n                        loop2 r sm\n                    ) else (\n                        let sm = LSP.op d.(r) sm in\n                        if r land (-r) <> r then loop r sm else 0\n                    )\n                in\n                loop r LSP.e\n            )\n    end\nend;;\nScanf.scanf \"%d %d\" (fun n q ->\n    let z = 998244353 in\n    let ten = Array.make n 1 in\n    let one = Array.make n 0 in \n    for i = 1 to n - 1 do ten.(i) <- (ten.(i - 1) * 10) mod z done;\n    for i = 1 to n - 1 do one.(i) <- (one.(i - 1) * 10 + 1) mod z done;\n    let module ST = LazySegtree.Make (struct\n        type s = int * int\n        let op (ll, lv) (rl, rv) = ll + rl, (lv * ten.(rl) + rv) mod z\n        let e = 0, 0\n        type f = int\n        let mapping f ((sl, sv) as s) = if f = 0 then s else sl, (one.(sl) * f) mod z\n        let composition l r = if l = 0 then r else l\n        let id = 0\n    end)\n        in\n    let seg = ST.of_array (Array.make n (1, 1)) in\n    for i = 1 to q do\n        Scanf.scanf \" %d %d %d\" (fun l r d ->\n            ST.apply seg (l - 1) r d;\n            let (_, v) = ST.all_prod seg in\n            Printf.printf \"%d\\n\" v\n        )\n    done\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou have a string S of length N.\nInitially, all characters in S are 1s.\n\nYou will perform queries Q times.\nIn the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).\nThen, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.\n\nAfter each query, read the string S as a decimal integer, and print its value modulo 998,244,353.\n\nConstraints\n\n1 \\leq N, Q \\leq 200,000\n\n1 \\leq L_i \\leq R_i \\leq N\n\n1 \\leq D_i \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nL_1 R_1 D_1\n:\nL_Q R_Q D_Q\n\nOutput\n\nPrint Q lines.\nIn the i-th line print the value of S after the i-th query, modulo 998,244,353.\n\nSample Input 1\n\n8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n\nSample Output 1\n\n11222211\n77772211\n77333333\n72333333\n72311333\n\nSample Input 2\n\n200000 1\n123 456 7\n\nSample Output 2\n\n641437905\n\nDon't forget to take the modulo.", "sample_input": "8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n"}, "reference_outputs": ["11222211\n77772211\n77333333\n72333333\n72311333\n"], "source_document_id": "p02538", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou have a string S of length N.\nInitially, all characters in S are 1s.\n\nYou will perform queries Q times.\nIn the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).\nThen, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.\n\nAfter each query, read the string S as a decimal integer, and print its value modulo 998,244,353.\n\nConstraints\n\n1 \\leq N, Q \\leq 200,000\n\n1 \\leq L_i \\leq R_i \\leq N\n\n1 \\leq D_i \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nL_1 R_1 D_1\n:\nL_Q R_Q D_Q\n\nOutput\n\nPrint Q lines.\nIn the i-th line print the value of S after the i-th query, modulo 998,244,353.\n\nSample Input 1\n\n8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n\nSample Output 1\n\n11222211\n77772211\n77333333\n72333333\n72311333\n\nSample Input 2\n\n200000 1\n123 456 7\n\nSample Output 2\n\n641437905\n\nDon't forget to take the modulo.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7748, "cpu_time_ms": 1610, "memory_kb": 42548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s535897170", "group_id": "codeNet:p02548", "input_text": "open Printf\nopen Scanf\n\nlet input_int () =\n  scanf \"%d\\n\" (fun k -> k)\n\nlet g n =\n  let m = int_of_float (sqrt (float_of_int n)) in\n  let rec loop count k =\n    if k>m then\n      if m * m = n then\n        2 * count - 1\n      else\n        2 * count\n    else if n mod k = 0 then\n      loop (count+1) (k+1)\n    else\n      loop count (k+1)\n  in\n  loop 0 1\n\nlet f () =\n  let n = input_int () in\n  let rec loop tot c =\n    if c = n then\n      tot\n    else\n      loop (tot + g (n - c)) (c+1)\n  in\n  loop 0 1\n\nlet () =\n  let tot = f () in\n  printf \"%d\\n\" tot\n\n", "language": "OCaml", "metadata": {"date": 1600544169, "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/s535897170.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s535897170", "user_id": "u104829762"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet input_int () =\n  scanf \"%d\\n\" (fun k -> k)\n\nlet g n =\n  let m = int_of_float (sqrt (float_of_int n)) in\n  let rec loop count k =\n    if k>m then\n      if m * m = n then\n        2 * count - 1\n      else\n        2 * count\n    else if n mod k = 0 then\n      loop (count+1) (k+1)\n    else\n      loop count (k+1)\n  in\n  loop 0 1\n\nlet f () =\n  let n = input_int () in\n  let rec loop tot c =\n    if c = n then\n      tot\n    else\n      loop (tot + g (n - c)) (c+1)\n  in\n  loop 0 1\n\nlet () =\n  let tot = f () in\n  printf \"%d\\n\" tot\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "sample_input": "3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02548", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 552, "cpu_time_ms": 2205, "memory_kb": 5872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s850859944", "group_id": "codeNet:p02552", "input_text": "let () = Scanf.scanf \"%d\" @@ fun x -> Printf.printf \"%d\\n\" @@ if  x = 0 then 1 else 0", "language": "OCaml", "metadata": {"date": 1600628113, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/OCaml/s850859944.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s850859944", "user_id": "u052332717"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun x -> Printf.printf \"%d\\n\" @@ if  x = 0 then 1 else 0", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s712017015", "group_id": "codeNet:p02552", "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": 1600438819, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/OCaml/s712017015.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s712017015", "user_id": "u307426615"}, "prompt_components": {"gold_output": "0\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 : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s995492167", "group_id": "codeNet:p02553", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun a b c d ->\n    let l1 = if a <= 0 && 0 <= b then [| a; 0; b |] else [| a; a; b |] in\n    let l2 = if c <= 0 && 0 <= d then [| c; 0; d |] else [| c; c; d |] in\n\n    let rec loop_i i acc =\n        let rec loop_j j acc =\n            if j = 3 then loop_i (i + 1) acc else\n                loop_j (j + 1) (max acc (l1.(i) * l2.(j)))\n        in\n        if i = 3 then acc else loop_j 0 acc\n    in\n    loop_i 0 min_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1600024087, "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/s995492167.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s995492167", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun a b c d ->\n    let l1 = if a <= 0 && 0 <= b then [| a; 0; b |] else [| a; a; b |] in\n    let l2 = if c <= 0 && 0 <= d then [| c; 0; d |] else [| c; c; d |] in\n\n    let rec loop_i i acc =\n        let rec loop_j j acc =\n            if j = 3 then loop_i (i + 1) acc else\n                loop_j (j + 1) (max acc (l1.(i) * l2.(j)))\n        in\n        if i = 3 then acc else loop_j 0 acc\n    in\n    loop_i 0 min_int |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "sample_input": "1 2 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02553", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 466, "cpu_time_ms": 9, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s732516049", "group_id": "codeNet:p02556", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n\n    let calc f =\n        Array.sort f xy;\n        let x0, y0 = xy.(0) in\n        let rec loop i acc =\n            if i = n then acc else\n                let x1, y1 = xy.(i) in\n                let dist = abs (x1 - x0) + abs (y1 - y0) in\n                loop (i + 1) (max acc dist)\n        in\n        let d1 = loop 0 0 in\n\n        let x0, y0 = xy.(n - 1) in\n        let rec loop i acc =\n            if i = n then acc else\n                let x1, y1 = xy.(i) in\n                let dist = abs (x1 - x0) + abs (y1 - y0) in\n                loop (i + 1) (max acc dist)\n        in\n        let d2 = loop 0 0 in\n        max d1 d2\n     in\n\n    let m1 = calc (fun (x0, y0) (x1, y1) -> compare ( x0,  y0) ( x1,  y1)) in\n    let m2 = calc (fun (x0, y0) (x1, y1) -> compare ( x0, -y0) ( x1, -y1)) in\n    let m3 = calc (fun (x0, y0) (x1, y1) -> compare ( y0,  x0) ( y1,  x1)) in\n    let m4 = calc (fun (x0, y0) (x1, y1) -> compare ( y0, -x0) ( y1, -x1)) in\n\n    Printf.printf \"%d\\n\" @@ max (max m1 m2) (max m3 m4)\n)", "language": "OCaml", "metadata": {"date": 1600026294, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02556.html", "problem_id": "p02556", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02556/input.txt", "sample_output_relpath": "derived/input_output/data/p02556/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02556/OCaml/s732516049.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s732516049", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n\n    let calc f =\n        Array.sort f xy;\n        let x0, y0 = xy.(0) in\n        let rec loop i acc =\n            if i = n then acc else\n                let x1, y1 = xy.(i) in\n                let dist = abs (x1 - x0) + abs (y1 - y0) in\n                loop (i + 1) (max acc dist)\n        in\n        let d1 = loop 0 0 in\n\n        let x0, y0 = xy.(n - 1) in\n        let rec loop i acc =\n            if i = n then acc else\n                let x1, y1 = xy.(i) in\n                let dist = abs (x1 - x0) + abs (y1 - y0) in\n                loop (i + 1) (max acc dist)\n        in\n        let d2 = loop 0 0 in\n        max d1 d2\n     in\n\n    let m1 = calc (fun (x0, y0) (x1, y1) -> compare ( x0,  y0) ( x1,  y1)) in\n    let m2 = calc (fun (x0, y0) (x1, y1) -> compare ( x0, -y0) ( x1, -y1)) in\n    let m3 = calc (fun (x0, y0) (x1, y1) -> compare ( y0,  x0) ( y1,  x1)) in\n    let m4 = calc (fun (x0, y0) (x1, y1) -> compare ( y0, -x0) ( y1, -x1)) in\n\n    Printf.printf \"%d\\n\" @@ max (max m1 m2) (max m3 m4)\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "sample_input": "3\n1 1\n2 4\n3 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02556", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 773, "memory_kb": 12688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751511681", "group_id": "codeNet:p02557", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) 0 in\n    let b = Array.make (n + 1) 0 in\n    let bb = Array.make n 0 in\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> a.(j) <- a.(j) + 1) done;\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> b.(j) <- b.(j) + 1; bb.(i - 1) <- j) done;\n\n    let rec check i =\n        if i > n then true else if a.(i) + b.(i) > n then false else check (i + 1)\n    in\n    if check 1 then (\n        let c = Array.make (n + 1) 0 in\n        let d = Array.make (n + 1) 0 in\n        for i = 1 to n do\n            c.(i) <- c.(i - 1) + a.(i);\n            d.(i) <- d.(i - 1) + b.(i);\n        done;\n        let rec loop i mx =\n            if i > n then mx else loop (i + 1) (max mx (c.(i) - d.(i - 1)))\n        in\n        let x = loop 1 0 in\n        print_endline \"Yes\";\n        for i = 0 to n - 1 do\n            Printf.printf \"%d \" bb.((i - x + n) mod n)\n        done;\n        print_newline ()\n    ) else print_endline \"No\"\n)", "language": "OCaml", "metadata": {"date": 1600043886, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02557.html", "problem_id": "p02557", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02557/input.txt", "sample_output_relpath": "derived/input_output/data/p02557/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02557/OCaml/s751511681.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751511681", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n2 2 3 1 1 1\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) 0 in\n    let b = Array.make (n + 1) 0 in\n    let bb = Array.make n 0 in\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> a.(j) <- a.(j) + 1) done;\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> b.(j) <- b.(j) + 1; bb.(i - 1) <- j) done;\n\n    let rec check i =\n        if i > n then true else if a.(i) + b.(i) > n then false else check (i + 1)\n    in\n    if check 1 then (\n        let c = Array.make (n + 1) 0 in\n        let d = Array.make (n + 1) 0 in\n        for i = 1 to n do\n            c.(i) <- c.(i - 1) + a.(i);\n            d.(i) <- d.(i - 1) + b.(i);\n        done;\n        let rec loop i mx =\n            if i > n then mx else loop (i + 1) (max mx (c.(i) - d.(i - 1)))\n        in\n        let x = loop 1 0 in\n        print_endline \"Yes\";\n        for i = 0 to n - 1 do\n            Printf.printf \"%d \" bb.((i - x + n) mod n)\n        done;\n        print_newline ()\n    ) else print_endline \"No\"\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences A and B, both of length N.\nA and B are each sorted in the ascending order.\nCheck if it is possible to reorder the terms of B so that for each i (1 \\leq i \\leq N) A_i \\neq B_i holds, and if it is possible, output any of the reorderings that achieve it.\n\nConstraints\n\n1\\leq N \\leq 2 \\times 10^5\n\n1\\leq A_i,B_i \\leq N\n\nA and B are each sorted in the ascending order.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\nB_1 B_2 \\cdots B_N\n\nOutput\n\nIf there exist no reorderings that satisfy the condition, print No.\n\nIf there exists a reordering that satisfies the condition, print Yes on the first line.\nAfter that, print a reordering of B on the second line, separating terms with a whitespace.\n\nIf there are multiple reorderings that satisfy the condition, you can print any of them.\n\nSample Input 1\n\n6\n1 1 1 2 2 3\n1 1 1 2 2 3\n\nSample Output 1\n\nYes\n2 2 3 1 1 1\n\nSample Input 2\n\n3\n1 1 2\n1 1 3\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n1 1 2 3\n1 2 3 3\n\nSample Output 3\n\nYes\n3 3 1 2", "sample_input": "6\n1 1 1 2 2 3\n1 1 1 2 2 3\n"}, "reference_outputs": ["Yes\n2 2 3 1 1 1\n"], "source_document_id": "p02557", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences A and B, both of length N.\nA and B are each sorted in the ascending order.\nCheck if it is possible to reorder the terms of B so that for each i (1 \\leq i \\leq N) A_i \\neq B_i holds, and if it is possible, output any of the reorderings that achieve it.\n\nConstraints\n\n1\\leq N \\leq 2 \\times 10^5\n\n1\\leq A_i,B_i \\leq N\n\nA and B are each sorted in the ascending order.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\nB_1 B_2 \\cdots B_N\n\nOutput\n\nIf there exist no reorderings that satisfy the condition, print No.\n\nIf there exists a reordering that satisfies the condition, print Yes on the first line.\nAfter that, print a reordering of B on the second line, separating terms with a whitespace.\n\nIf there are multiple reorderings that satisfy the condition, you can print any of them.\n\nSample Input 1\n\n6\n1 1 1 2 2 3\n1 1 1 2 2 3\n\nSample Output 1\n\nYes\n2 2 3 1 1 1\n\nSample Input 2\n\n3\n1 1 2\n1 1 3\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n1 1 2 3\n1 2 3 3\n\nSample Output 3\n\nYes\n3 3 1 2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1046, "cpu_time_ms": 117, "memory_kb": 14104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s092230607", "group_id": "codeNet:p02557", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) 0 in\n    let b = Array.make (n + 1) 0 in\n    let bb = Array.make n 0 in\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> a.(j) <- a.(j) + 1) done;\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> b.(j) <- b.(j) + 1; bb.(i - 1) <- j) done;\n\n    let rec check i =\n        if i > n then true else if a.(i) + b.(i) > n then false else check (i + 1)\n    in\n    if check 1 then (\n        let c = Array.make (n + 1) 0 in\n        let d = Array.make (n + 1) 0 in\n        for i = 1 to n do\n            c.(i) <- c.(i) + a.(i);\n            d.(i) <- d.(i) + b.(i);\n        done;\n        let rec loop i mx =\n            if i > n then mx else loop (i + 1) (max mx (c.(i) - d.(i - 1)))\n        in\n        let x = loop 1 0 in\n        print_endline \"Yes\";\n        for i = 0 to n - 1 do\n            Printf.printf \"%d \" bb.((i + x) mod n)\n        done;\n        print_newline ()\n    ) else print_endline \"No\"\n)", "language": "OCaml", "metadata": {"date": 1600040208, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02557.html", "problem_id": "p02557", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02557/input.txt", "sample_output_relpath": "derived/input_output/data/p02557/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02557/OCaml/s092230607.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s092230607", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n2 2 3 1 1 1\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) 0 in\n    let b = Array.make (n + 1) 0 in\n    let bb = Array.make n 0 in\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> a.(j) <- a.(j) + 1) done;\n    for i = 1 to n do Scanf.scanf \" %d\" (fun j -> b.(j) <- b.(j) + 1; bb.(i - 1) <- j) done;\n\n    let rec check i =\n        if i > n then true else if a.(i) + b.(i) > n then false else check (i + 1)\n    in\n    if check 1 then (\n        let c = Array.make (n + 1) 0 in\n        let d = Array.make (n + 1) 0 in\n        for i = 1 to n do\n            c.(i) <- c.(i) + a.(i);\n            d.(i) <- d.(i) + b.(i);\n        done;\n        let rec loop i mx =\n            if i > n then mx else loop (i + 1) (max mx (c.(i) - d.(i - 1)))\n        in\n        let x = loop 1 0 in\n        print_endline \"Yes\";\n        for i = 0 to n - 1 do\n            Printf.printf \"%d \" bb.((i + x) mod n)\n        done;\n        print_newline ()\n    ) else print_endline \"No\"\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences A and B, both of length N.\nA and B are each sorted in the ascending order.\nCheck if it is possible to reorder the terms of B so that for each i (1 \\leq i \\leq N) A_i \\neq B_i holds, and if it is possible, output any of the reorderings that achieve it.\n\nConstraints\n\n1\\leq N \\leq 2 \\times 10^5\n\n1\\leq A_i,B_i \\leq N\n\nA and B are each sorted in the ascending order.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\nB_1 B_2 \\cdots B_N\n\nOutput\n\nIf there exist no reorderings that satisfy the condition, print No.\n\nIf there exists a reordering that satisfies the condition, print Yes on the first line.\nAfter that, print a reordering of B on the second line, separating terms with a whitespace.\n\nIf there are multiple reorderings that satisfy the condition, you can print any of them.\n\nSample Input 1\n\n6\n1 1 1 2 2 3\n1 1 1 2 2 3\n\nSample Output 1\n\nYes\n2 2 3 1 1 1\n\nSample Input 2\n\n3\n1 1 2\n1 1 3\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n1 1 2 3\n1 2 3 3\n\nSample Output 3\n\nYes\n3 3 1 2", "sample_input": "6\n1 1 1 2 2 3\n1 1 1 2 2 3\n"}, "reference_outputs": ["Yes\n2 2 3 1 1 1\n"], "source_document_id": "p02557", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two sequences A and B, both of length N.\nA and B are each sorted in the ascending order.\nCheck if it is possible to reorder the terms of B so that for each i (1 \\leq i \\leq N) A_i \\neq B_i holds, and if it is possible, output any of the reorderings that achieve it.\n\nConstraints\n\n1\\leq N \\leq 2 \\times 10^5\n\n1\\leq A_i,B_i \\leq N\n\nA and B are each sorted in the ascending order.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\nB_1 B_2 \\cdots B_N\n\nOutput\n\nIf there exist no reorderings that satisfy the condition, print No.\n\nIf there exists a reordering that satisfies the condition, print Yes on the first line.\nAfter that, print a reordering of B on the second line, separating terms with a whitespace.\n\nIf there are multiple reorderings that satisfy the condition, you can print any of them.\n\nSample Input 1\n\n6\n1 1 1 2 2 3\n1 1 1 2 2 3\n\nSample Output 1\n\nYes\n2 2 3 1 1 1\n\nSample Input 2\n\n3\n1 1 2\n1 1 3\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n1 1 2 3\n1 2 3 3\n\nSample Output 3\n\nYes\n3 3 1 2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1034, "cpu_time_ms": 115, "memory_kb": 14112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s263235549", "group_id": "codeNet:p02570", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun d t s ->\n  print_endline @@\n  if d <= t * s then \"Yes\" else \"No\"\n", "language": "OCaml", "metadata": {"date": 1598733820, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/OCaml/s263235549.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263235549", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun d t s ->\n  print_endline @@\n  if d <= t * s then \"Yes\" else \"No\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s243559147", "group_id": "codeNet:p02570", "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 d,t,s = rdi3 () in\n  putw (s*t >= d)\n", "language": "OCaml", "metadata": {"date": 1598728012, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/OCaml/s243559147.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s243559147", "user_id": "u970139668"}, "prompt_components": {"gold_output": "Yes\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 d,t,s = rdi3 () in\n  putw (s*t >= d)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7024, "cpu_time_ms": 10, "memory_kb": 5436}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s857962809", "group_id": "codeNet:p02570", "input_text": "open Printf\nopen Scanf\n\nlet num () = scanf \"%d\\n\" (fun x -> x)\nlet num2 () = scanf \"%d %d\\n\" (fun x y -> (x, y))\nlet num3 () = scanf \"%d %d %d\\n\" (fun x y z -> (x, y, z))\n\nlet () =\n  let (d, t, s) = num3 () in\n  if s * t >= d then\n    printf \"yes\\n\"\n  else\n    printf \"no\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1598727807, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/OCaml/s857962809.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s857962809", "user_id": "u104829762"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet num () = scanf \"%d\\n\" (fun x -> x)\nlet num2 () = scanf \"%d %d\\n\" (fun x y -> (x, y))\nlet num3 () = scanf \"%d %d %d\\n\" (fun x y z -> (x, y, z))\n\nlet () =\n  let (d, t, s) = num3 () in\n  if s * t >= d then\n    printf \"yes\\n\"\n  else\n    printf \"no\\n\"\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 276, "cpu_time_ms": 7, "memory_kb": 3744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s340878258", "group_id": "codeNet:p02571", "input_text": "let () = Scanf.scanf \" %s %s\" @@ fun s t ->\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left min max_int @@\n  Array.init (String.length s - String.length t + 1) @@ fun i ->\n    Array.fold_left ( + ) 0 @@\n    Array.init (String.length t) @@ fun j -> if s.[i + j] = t.[j] then 0 else 1", "language": "OCaml", "metadata": {"date": 1598803959, "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/s340878258.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340878258", "user_id": "u052332717"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \" %s %s\" @@ fun s t ->\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left min max_int @@\n  Array.init (String.length s - String.length t + 1) @@ fun i ->\n    Array.fold_left ( + ) 0 @@\n    Array.init (String.length t) @@ fun j -> if s.[i + j] = t.[j] then 0 else 1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "sample_input": "cabacc\nabc\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02571", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 9, "memory_kb": 5780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s207129239", "group_id": "codeNet:p02576", "input_text": "open Printf\nopen Scanf\n\nlet solve n x t =\n  let m = (n + x - 1) / x in m * t\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1598270841, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02576.html", "problem_id": "p02576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02576/input.txt", "sample_output_relpath": "derived/input_output/data/p02576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02576/OCaml/s207129239.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s207129239", "user_id": "u388783188"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve n x t =\n  let m = (n + x - 1) / x in m * t\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi loves takoyaki - a ball-shaped snack.\n\nWith a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.\n\nHow long does it take to make N takoyaki?\n\nConstraints\n\n1 \\leq N,X,T \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X T\n\nOutput\n\nPrint an integer representing the minimum number of minutes needed to make N pieces of takoyaki.\n\nSample Input 1\n\n20 12 6\n\nSample Output 1\n\n12\n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the next 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1 minute.\n\nSample Input 2\n\n1000 1 1000\n\nSample Output 2\n\n1000000\n\nIt seems to take a long time to make this kind of takoyaki.", "sample_input": "20 12 6\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02576", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi loves takoyaki - a ball-shaped snack.\n\nWith a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.\n\nHow long does it take to make N takoyaki?\n\nConstraints\n\n1 \\leq N,X,T \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X T\n\nOutput\n\nPrint an integer representing the minimum number of minutes needed to make N pieces of takoyaki.\n\nSample Input 1\n\n20 12 6\n\nSample Output 1\n\n12\n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the next 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1 minute.\n\nSample Input 2\n\n1000 1 1000\n\nSample Output 2\n\n1000000\n\nIt seems to take a long time to make this kind of takoyaki.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 130, "cpu_time_ms": 8, "memory_kb": 3840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s158261744", "group_id": "codeNet:p02576", "input_text": "(*\n * Vicfred\n * https://atcoder.jp/contests/abc176/tasks/abc176_a\n * implementation\n * *)\nScanf.scanf \"%d %d %d\" (fun n x t ->\n    Printf.printf \"%d\\n\" (((n + x - 1)/ x) * t))\n\n", "language": "OCaml", "metadata": {"date": 1598256800, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02576.html", "problem_id": "p02576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02576/input.txt", "sample_output_relpath": "derived/input_output/data/p02576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02576/OCaml/s158261744.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s158261744", "user_id": "u737840172"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "(*\n * Vicfred\n * https://atcoder.jp/contests/abc176/tasks/abc176_a\n * implementation\n * *)\nScanf.scanf \"%d %d %d\" (fun n x t ->\n    Printf.printf \"%d\\n\" (((n + x - 1)/ x) * t))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi loves takoyaki - a ball-shaped snack.\n\nWith a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.\n\nHow long does it take to make N takoyaki?\n\nConstraints\n\n1 \\leq N,X,T \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X T\n\nOutput\n\nPrint an integer representing the minimum number of minutes needed to make N pieces of takoyaki.\n\nSample Input 1\n\n20 12 6\n\nSample Output 1\n\n12\n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the next 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1 minute.\n\nSample Input 2\n\n1000 1 1000\n\nSample Output 2\n\n1000000\n\nIt seems to take a long time to make this kind of takoyaki.", "sample_input": "20 12 6\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02576", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi loves takoyaki - a ball-shaped snack.\n\nWith a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.\n\nHow long does it take to make N takoyaki?\n\nConstraints\n\n1 \\leq N,X,T \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X T\n\nOutput\n\nPrint an integer representing the minimum number of minutes needed to make N pieces of takoyaki.\n\nSample Input 1\n\n20 12 6\n\nSample Output 1\n\n12\n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the next 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1 minute.\n\nSample Input 2\n\n1000 1 1000\n\nSample Output 2\n\n1000000\n\nIt seems to take a long time to make this kind of takoyaki.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 178, "cpu_time_ms": 11, "memory_kb": 3836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s536998978", "group_id": "codeNet:p02577", "input_text": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n    let rec loop i acc =\n        if i = n then acc else loop (i + 1) (acc + int_of_char s.[i] - 48)\n    in\n    print_endline @@ if loop 0 0 mod 9 = 0 then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1598122978, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/OCaml/s536998978.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536998978", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n    let rec loop i acc =\n        if i = n then acc else loop (i + 1) (acc + int_of_char s.[i] - 48)\n    in\n    print_endline @@ if loop 0 0 mod 9 = 0 then \"Yes\" else \"No\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 16, "memory_kb": 4408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s263872060", "group_id": "codeNet:p02578", "input_text": "let () = 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\" @@\n  fst @@\n  Array.fold_left (fun (sum, prev) a ->\n    sum + max prev a - a, max prev a) (0, min_int) as_\n\n", "language": "OCaml", "metadata": {"date": 1598124252, "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/s263872060.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263872060", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\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  Printf.printf \"%d\\n\" @@\n  fst @@\n  Array.fold_left (fun (sum, prev) a ->\n    sum + max prev a - a, max prev a) (0, min_int) as_\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 61, "memory_kb": 7536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943944436", "group_id": "codeNet:p02579", "input_text": "module Weighted01DirectedGraph\n  (* 頂点を添字，経路長を要素とした配列の実装 *)\n  (Array : sig\n    type t\n    type key\n    type elt = int (* 全ての重さが0か1なグラフなので経路長は非負整数 *)\n    val get : t -> key -> elt\n    val set : t -> key -> elt -> unit\n  end)\n: sig\n  type vertex = Array.key\n\n  val shortest_path :\n    (* 全ての頂点についての経路長が無限大で初期化された配列 *)\n    Array.t ->\n    (* 最短経路を求めたいグラフの，ある頂点から伸びる辺に対してのイテレータ\n       重みが0の辺に対してはf0を，1の辺に対してはf1を用いる *)\n    (vertex -> f0:(vertex -> unit) -> f1:(vertex -> unit) -> unit) ->\n    (* 始点 *)\n    vertex ->\n    (* 終点を受け取って，始点からの最短距離を返す関数\n       始点から辿り着けない場合，無限大を返す\n       この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n    (vertex -> int)\nend =\nstruct\n  type vertex = Array.key\n\n  let shortest_path d es s =\n    (* 始点への経路長を0にする *)\n    Array.set d s 0;\n    let w = ref 1 in\n    let q = ref [s] in\n    let rec bfs t =\n      match !q with\n      (* もう既に全ての頂点までの経路が分かっているので返す *)\n      | [] -> Array.get d t\n      | us ->\n          match Array.get d t with\n          (* 既に終点までの距離が分かっているので返す *)\n          | x when x < !w -> x\n          (* 終点までの距離が分かっていないので，BFSを続行 *)\n          | _ ->\n              q := [];\n              List.iter dfs us;\n              incr w;\n              bfs t\n    and dfs u =\n      es u\n        ~f0:(fun v ->\n          if !w <= Array.get d v then\n            (Array.set d v (!w - 1); dfs v))\n        ~f1:(fun v ->\n          if !w < Array.get d v then\n            (Array.set d v !w; q := v :: !q)) in\n    bfs\nend\n\nmodule G = Weighted01DirectedGraph (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\nend)\n\nlet () = Scanf.scanf \"%d %d\\n%d %d\\n%d %d\\n\" @@ fun h w ch cw dh dw ->\n  let ss = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let d =\n    G.shortest_path\n      (let d = Bigarray.Genarray.create Bigarray.int Bigarray.c_layout [| h; w |] in Bigarray.Genarray.fill d max_int; d)\n      (fun [|i; j|] ~f0 ~f1 ->\n        List.iter (fun (i', j') ->\n          if 0 <= i' && i' < h && 0 <= j' && j' < w && ss.(i').[j'] = '.' then f0 [|i'; j'|])\n        [(i - 1, j); (i + 1, j); (i, j - 1); (i, j + 1)];\n        for i' = max 0 (i - 2) to min (h - 1) (i + 2) do\n          for j' = max 0 (j - 2) to min (w - 1) (j + 2) do\n            if ss.(i').[j'] = '.' then f1 [|i'; j'|]\n          done\n        done)\n      [|ch - 1; cw - 1|]\n      [|dh - 1; dw - 1|] in\n  Printf.printf \"%d\\n\" @@ if d = max_int then -1 else d\n\n", "language": "OCaml", "metadata": {"date": 1598124239, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02579.html", "problem_id": "p02579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02579/input.txt", "sample_output_relpath": "derived/input_output/data/p02579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02579/OCaml/s943944436.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943944436", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module Weighted01DirectedGraph\n  (* 頂点を添字，経路長を要素とした配列の実装 *)\n  (Array : sig\n    type t\n    type key\n    type elt = int (* 全ての重さが0か1なグラフなので経路長は非負整数 *)\n    val get : t -> key -> elt\n    val set : t -> key -> elt -> unit\n  end)\n: sig\n  type vertex = Array.key\n\n  val shortest_path :\n    (* 全ての頂点についての経路長が無限大で初期化された配列 *)\n    Array.t ->\n    (* 最短経路を求めたいグラフの，ある頂点から伸びる辺に対してのイテレータ\n       重みが0の辺に対してはf0を，1の辺に対してはf1を用いる *)\n    (vertex -> f0:(vertex -> unit) -> f1:(vertex -> unit) -> unit) ->\n    (* 始点 *)\n    vertex ->\n    (* 終点を受け取って，始点からの最短距離を返す関数\n       始点から辿り着けない場合，無限大を返す\n       この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n    (vertex -> int)\nend =\nstruct\n  type vertex = Array.key\n\n  let shortest_path d es s =\n    (* 始点への経路長を0にする *)\n    Array.set d s 0;\n    let w = ref 1 in\n    let q = ref [s] in\n    let rec bfs t =\n      match !q with\n      (* もう既に全ての頂点までの経路が分かっているので返す *)\n      | [] -> Array.get d t\n      | us ->\n          match Array.get d t with\n          (* 既に終点までの距離が分かっているので返す *)\n          | x when x < !w -> x\n          (* 終点までの距離が分かっていないので，BFSを続行 *)\n          | _ ->\n              q := [];\n              List.iter dfs us;\n              incr w;\n              bfs t\n    and dfs u =\n      es u\n        ~f0:(fun v ->\n          if !w <= Array.get d v then\n            (Array.set d v (!w - 1); dfs v))\n        ~f1:(fun v ->\n          if !w < Array.get d v then\n            (Array.set d v !w; q := v :: !q)) in\n    bfs\nend\n\nmodule G = Weighted01DirectedGraph (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\nend)\n\nlet () = Scanf.scanf \"%d %d\\n%d %d\\n%d %d\\n\" @@ fun h w ch cw dh dw ->\n  let ss = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let d =\n    G.shortest_path\n      (let d = Bigarray.Genarray.create Bigarray.int Bigarray.c_layout [| h; w |] in Bigarray.Genarray.fill d max_int; d)\n      (fun [|i; j|] ~f0 ~f1 ->\n        List.iter (fun (i', j') ->\n          if 0 <= i' && i' < h && 0 <= j' && j' < w && ss.(i').[j'] = '.' then f0 [|i'; j'|])\n        [(i - 1, j); (i + 1, j); (i, j - 1); (i, j + 1)];\n        for i' = max 0 (i - 2) to min (h - 1) (i + 2) do\n          for j' = max 0 (j - 2) to min (w - 1) (j + 2) do\n            if ss.(i').[j'] = '.' then f1 [|i'; j'|]\n          done\n        done)\n      [|ch - 1; cw - 1|]\n      [|dh - 1; dw - 1|] in\n  Printf.printf \"%d\\n\" @@ if d = max_int then -1 else d\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02579", "source_text": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3036, "cpu_time_ms": 388, "memory_kb": 16700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s005441433", "group_id": "codeNet:p02585", "input_text": "Scanf.scanf \"%d %d\" (fun n k ->\n    let p = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a - 1)) in\n    let c = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let par = Array.init n (fun i -> i) in\n    \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\n            par.(par.(b)) <- par.(a)\n    in\n    Array.iteri merge p;\n\n    let cluster = Array.init n root in\n    let size = Array.make n 0 in\n    Array.iter (fun v -> size.(v) <- size.(v) + 1) cluster;\n\n    let sum = Array.make n 0 in\n\n    let calc_loop_score start len =\n        let rec loop cur len acc =\n            if len = 0 then acc else\n                let cur = p.(cur) in\n                let acc = acc + c.(cur) in\n                loop cur (len - 1) acc\n        in\n        loop start len 0\n    in\n    Array.iteri (fun i sz -> if sz > 0 then sum.(i) <- calc_loop_score i sz) size;\n\n    let calc_best start len =\n        let rec loop cur len acc mx =\n            if len = 0 then mx else\n                let cur = p.(cur) in\n                let acc = acc + c.(cur) in\n                let mx = max mx acc in\n                loop cur (len - 1) acc mx\n        in\n        loop start len 0 (-100000000000000)\n    in\n\n    let score = Array.init n (fun i ->\n        let cl = cluster.(i) in\n        let sz = size.(cl) in\n        let kr = k / sz in\n        let base = if sum.(cl) > 0 then kr * sum.(cl) else 0 in\n        let len = k mod sz in\n        let len = if len = 0 then sz else len in\n        base + calc_best i len\n    ) in\n    (*\n    Array.iter (Printf.printf \"%d \") cluster;\n    print_newline ();\n    Array.iter (Printf.printf \"%d \") size;\n    print_newline ();\n    Array.iter (Printf.printf \"%d \") sum;\n    print_newline ();\n    Array.iter (Printf.printf \"%d \") score;\n    print_newline ();\n    *)\n    Array.fold_left max (-10000000000000) score |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1597542272, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/OCaml/s005441433.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s005441433", "user_id": "u342443598"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n k ->\n    let p = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a - 1)) in\n    let c = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let par = Array.init n (fun i -> i) in\n    \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\n            par.(par.(b)) <- par.(a)\n    in\n    Array.iteri merge p;\n\n    let cluster = Array.init n root in\n    let size = Array.make n 0 in\n    Array.iter (fun v -> size.(v) <- size.(v) + 1) cluster;\n\n    let sum = Array.make n 0 in\n\n    let calc_loop_score start len =\n        let rec loop cur len acc =\n            if len = 0 then acc else\n                let cur = p.(cur) in\n                let acc = acc + c.(cur) in\n                loop cur (len - 1) acc\n        in\n        loop start len 0\n    in\n    Array.iteri (fun i sz -> if sz > 0 then sum.(i) <- calc_loop_score i sz) size;\n\n    let calc_best start len =\n        let rec loop cur len acc mx =\n            if len = 0 then mx else\n                let cur = p.(cur) in\n                let acc = acc + c.(cur) in\n                let mx = max mx acc in\n                loop cur (len - 1) acc mx\n        in\n        loop start len 0 (-100000000000000)\n    in\n\n    let score = Array.init n (fun i ->\n        let cl = cluster.(i) in\n        let sz = size.(cl) in\n        let kr = k / sz in\n        let base = if sum.(cl) > 0 then kr * sum.(cl) else 0 in\n        let len = k mod sz in\n        let len = if len = 0 then sz else len in\n        base + calc_best i len\n    ) in\n    (*\n    Array.iter (Printf.printf \"%d \") cluster;\n    print_newline ();\n    Array.iter (Printf.printf \"%d \") size;\n    print_newline ();\n    Array.iter (Printf.printf \"%d \") sum;\n    print_newline ();\n    Array.iter (Printf.printf \"%d \") score;\n    print_newline ();\n    *)\n    Array.fold_left max (-10000000000000) score |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2008, "cpu_time_ms": 284, "memory_kb": 6228}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s621095480", "group_id": "codeNet:p02595", "input_text": "type point = {x:int; y:int}\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n d ->\n  let pp = Array.init n @@ fun _ ->\n    Scanf.scanf \" %d %d\" @@ fun a b -> {x = a; y = b}\n  in\n  let ans = ref 0 in\n  for i = 0 to n - 1 do\n    if pp.(i).x * pp.(i).x + pp.(i).y * pp.(i).y <= d * d then ans := !ans + 1\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1596743118, "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/s621095480.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621095480", "user_id": "u052332717"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "type point = {x:int; y:int}\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n d ->\n  let pp = Array.init n @@ fun _ ->\n    Scanf.scanf \" %d %d\" @@ fun a b -> {x = a; y = b}\n  in\n  let ans = ref 0 in\n  for i = 0 to n - 1 do\n    if pp.(i).x * pp.(i).x + pp.(i).y * pp.(i).y <= d * d then ans := !ans + 1\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 94, "memory_kb": 12612}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s679292613", "group_id": "codeNet:p02600", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun x ->\n  Printf.printf \"%d\\n\"\n    (if 400 <= x && x < 600 then 8\n     else if 600 <= x && x < 800 then 7\n     else if 800 <= x && x < 1000 then 6\n     else if 1000 <= x && x < 1200 then 5\n     else if 1200 <= x && x < 1400 then 4\n     else if 1400 <= x && x < 1600 then 3\n     else if 1600 <= x && x < 1800 then 2\n     else 1)", "language": "OCaml", "metadata": {"date": 1596587373, "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/s679292613.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s679292613", "user_id": "u307426615"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun x ->\n  Printf.printf \"%d\\n\"\n    (if 400 <= x && x < 600 then 8\n     else if 600 <= x && x < 800 then 7\n     else if 800 <= x && x < 1000 then 6\n     else if 1000 <= x && x < 1200 then 5\n     else if 1200 <= x && x < 1400 then 4\n     else if 1400 <= x && x < 1600 then 3\n     else if 1600 <= x && x < 1800 then 2\n     else 1)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 361, "cpu_time_ms": 10, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s908498538", "group_id": "codeNet:p02600", "input_text": "let kyu x =\n  if 400 <= x && x <= 599 then 8\n  else if 600 <= x && x <= 799 then 7\n  else if 800 <= x && x <= 999 then 6\n  else if 1000 <= x && x <= 1199 then 5\n  else if 1200 <= x && x <= 1399 then 4\n  else if 1400 <= x && x <= 1599 then 3\n  else if 1600 <= x && x <= 1799 then 2\n  else 1\n\nlet () = Printf.printf \"%d\\n\" (kyu (read_int ()))", "language": "OCaml", "metadata": {"date": 1595725562, "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/s908498538.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908498538", "user_id": "u272377260"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let kyu x =\n  if 400 <= x && x <= 599 then 8\n  else if 600 <= x && x <= 799 then 7\n  else if 800 <= x && x <= 999 then 6\n  else if 1000 <= x && x <= 1199 then 5\n  else if 1200 <= x && x <= 1399 then 4\n  else if 1400 <= x && x <= 1599 then 3\n  else if 1600 <= x && x <= 1799 then 2\n  else 1\n\nlet () = Printf.printf \"%d\\n\" (kyu (read_int ()))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s045920707", "group_id": "codeNet:p02601", "input_text": "open Printf\nopen Scanf\n\nlet solve a b c k =\n  let rec f x y z = if x < y then (y, z) else f x (y * 2) (z + 1) in\n  let (b2, k2) = f a b 0 in\n  let (_, k3) = f b2 c k2 in\n  if k >= k3 then \"Yes\" else \"No\"\n\nlet () =\n  scanf \"%d %d %d %d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1595959397, "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/s045920707.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s045920707", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b c k =\n  let rec f x y z = if x < y then (y, z) else f x (y * 2) (z + 1) in\n  let (b2, k2) = f a b 0 in\n  let (_, k3) = f b2 c k2 in\n  if k >= k3 then \"Yes\" else \"No\"\n\nlet () =\n  scanf \"%d %d %d %d \" solve |> printf \"%s\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s993346399", "group_id": "codeNet:p02602", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let rec makeHyoka i k ans =\n    if k = 0 then ans else makeHyoka (i-1) (k-1) (arr.(i)*ans) in\n  let brr = Array.make (n-k+1) 0 in\n  for i = k to n do\n    if i = k then brr.(i-k) <- makeHyoka (i-1) k 1\n    else brr.(i-k) <- brr.(i-k-1) * arr.(i-1) / arr.(i-k-1)\n  done;\n  let h::t = Array.to_list brr in\n  let bfr = ref h in\n  List.iter (fun x -> if !bfr < x then (bfr := x; print_endline \"Yes\")\n              else (bfr := x; print_endline \"No\")) t", "language": "OCaml", "metadata": {"date": 1596576661, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/OCaml/s993346399.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s993346399", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let rec makeHyoka i k ans =\n    if k = 0 then ans else makeHyoka (i-1) (k-1) (arr.(i)*ans) in\n  let brr = Array.make (n-k+1) 0 in\n  for i = k to n do\n    if i = k then brr.(i-k) <- makeHyoka (i-1) k 1\n    else brr.(i-k) <- brr.(i-k-1) * arr.(i-1) / arr.(i-k-1)\n  done;\n  let h::t = Array.to_list brr in\n  let bfr = ref h in\n  List.iter (fun x -> if !bfr < x then (bfr := x; print_endline \"Yes\")\n              else (bfr := x; print_endline \"No\")) t", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 359, "memory_kb": 11780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s014074066", "group_id": "codeNet:p02602", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet solve n k =\n  let aa = Array.init n @@ fun _ -> scanf \"%d \" id in\n  for i = k to n - 1 do\n    printf \"%s\\n\" @@ if aa.(i-k) < aa.(i) then \"Yes\" else \"No\"\n  done\n\nlet () =\n  scanf \"%d %d \" solve\n", "language": "OCaml", "metadata": {"date": 1596046746, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/OCaml/s014074066.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s014074066", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet solve n k =\n  let aa = Array.init n @@ fun _ -> scanf \"%d \" id in\n  for i = k to n - 1 do\n    printf \"%s\\n\" @@ if aa.(i-k) < aa.(i) then \"Yes\" else \"No\"\n  done\n\nlet () =\n  scanf \"%d %d \" solve\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 235, "cpu_time_ms": 69, "memory_kb": 7428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s548409766", "group_id": "codeNet:p02602", "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 0 ls\n\n  let partial_mul 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 1 0 ls\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, k) = rdi2 () in\n  let al = rdhi () |> L.map i2f |> L.map log in\n  let scores = A.make (n+1) 0.0 in\n  scores.(k) <- Gal.partial_sum k al;\n  let aa = A.of_list (1.0::al) in\n  R.iter ((k+1)---n)  (fun t ->\n    scores.(t) <- scores.(t - 1) +. aa.(t) -. aa.(t - k));\n  R.iter ((k+1)---n) (fun i -> putw (scores.(i - 1) < scores.(i)));\n  ()\n", "language": "OCaml", "metadata": {"date": 1595731096, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/OCaml/s548409766.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s548409766", "user_id": "u970139668"}, "prompt_components": {"gold_output": "Yes\nNo\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 0 ls\n\n  let partial_mul 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 1 0 ls\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, k) = rdi2 () in\n  let al = rdhi () |> L.map i2f |> L.map log in\n  let scores = A.make (n+1) 0.0 in\n  scores.(k) <- Gal.partial_sum k al;\n  let aa = A.of_list (1.0::al) in\n  R.iter ((k+1)---n)  (fun t ->\n    scores.(t) <- scores.(t - 1) +. aa.(t) -. aa.(t - k));\n  R.iter ((k+1)---n) (fun i -> putw (scores.(i - 1) < scores.(i)));\n  ()\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7452, "cpu_time_ms": 401, "memory_kb": 31000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s977863226", "group_id": "codeNet:p02602", "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\n  let partial_mul 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 1 0 ls\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, k) = rdi2 () in\n  let al = rdhi () in\n  let scores = A.make (n+1) 0 in\n  scores.(k) <- Gal.partial_mul k al;\n  let aa = A.of_list (1::al) in\n  R.iter ((k+1)---n)  (fun t ->\n    scores.(t) <- scores.(t - 1) * aa.(t) / aa.(t - k));\n  R.iter ((k+1)---n) (fun i -> putw (scores.(i - 1) < scores.(i)));\n  ()\n", "language": "OCaml", "metadata": {"date": 1595729299, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/OCaml/s977863226.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s977863226", "user_id": "u970139668"}, "prompt_components": {"gold_output": "Yes\nNo\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\n  let partial_mul 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 1 0 ls\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, k) = rdi2 () in\n  let al = rdhi () in\n  let scores = A.make (n+1) 0 in\n  scores.(k) <- Gal.partial_mul k al;\n  let aa = A.of_list (1::al) in\n  R.iter ((k+1)---n)  (fun t ->\n    scores.(t) <- scores.(t - 1) * aa.(t) / aa.(t - k));\n  R.iter ((k+1)---n) (fun i -> putw (scores.(i - 1) < scores.(i)));\n  ()\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7417, "cpu_time_ms": 360, "memory_kb": 29148}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s108048746", "group_id": "codeNet:p02604", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let xyp = Array.init n (fun _ -> Scanf.scanf \" %d %d %d\" (fun x y p -> x, y, p)) in\n\n    let vp = Array.init n (fun i ->\n        let me, _, p = xyp.(i) in\n        Array.init (1 lsl n) (fun bit ->\n            let rec loop j acc =\n                if j = n then acc * p else\n                    if bit land (1 lsl j) = 0 then loop (j + 1) acc else\n                        let k, _, _ = xyp.(j) in\n                        let acc = min acc (abs (k - me)) in\n                        loop (j + 1) acc\n            in\n            loop 0 (abs me)\n        )\n    ) in\n    let hp = Array.init n (fun i ->\n        let _, me, p = xyp.(i) in\n        Array.init (1 lsl n) (fun bit ->\n            let rec loop j acc =\n                if j = n then acc * p else\n                    if bit land (1 lsl j) = 0 then loop (j + 1) acc else\n                        let _, k, _ = xyp.(j) in\n                        let acc = min acc (abs (k - me)) in\n                        loop (j + 1) acc\n            in\n            loop 0 (abs me)\n        )\n    ) in\n\n    let best = Array.make (n + 1) max_int in\n    let calc h v =\n        let rec loop i acc =\n            if i = n then acc else\n                loop (i + 1) (acc + min vp.(i).(v) hp.(i).(h))\n        in\n        loop 0 0\n    in\n\n    let rec loop i c hbit vbit =\n        best.(c) <- if best.(c) = 0 then 0 else min best.(c) (calc hbit vbit);\n        if i < n then (\n            let li = 1 lsl i in\n            loop (i + 1) c       hbit          vbit;\n            loop (i + 1) (c + 1) (hbit lor li) vbit;\n            loop (i + 1) (c + 1) hbit          (vbit lor li);\n        )\n    in\n    loop 0 0 0 0;\n\n    Array.iter (Printf.printf \"%d\\n\") best;\n)", "language": "OCaml", "metadata": {"date": 1595815233, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02604.html", "problem_id": "p02604", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02604/input.txt", "sample_output_relpath": "derived/input_output/data/p02604/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02604/OCaml/s108048746.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s108048746", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2900\n900\n0\n0\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let xyp = Array.init n (fun _ -> Scanf.scanf \" %d %d %d\" (fun x y p -> x, y, p)) in\n\n    let vp = Array.init n (fun i ->\n        let me, _, p = xyp.(i) in\n        Array.init (1 lsl n) (fun bit ->\n            let rec loop j acc =\n                if j = n then acc * p else\n                    if bit land (1 lsl j) = 0 then loop (j + 1) acc else\n                        let k, _, _ = xyp.(j) in\n                        let acc = min acc (abs (k - me)) in\n                        loop (j + 1) acc\n            in\n            loop 0 (abs me)\n        )\n    ) in\n    let hp = Array.init n (fun i ->\n        let _, me, p = xyp.(i) in\n        Array.init (1 lsl n) (fun bit ->\n            let rec loop j acc =\n                if j = n then acc * p else\n                    if bit land (1 lsl j) = 0 then loop (j + 1) acc else\n                        let _, k, _ = xyp.(j) in\n                        let acc = min acc (abs (k - me)) in\n                        loop (j + 1) acc\n            in\n            loop 0 (abs me)\n        )\n    ) in\n\n    let best = Array.make (n + 1) max_int in\n    let calc h v =\n        let rec loop i acc =\n            if i = n then acc else\n                loop (i + 1) (acc + min vp.(i).(v) hp.(i).(h))\n        in\n        loop 0 0\n    in\n\n    let rec loop i c hbit vbit =\n        best.(c) <- if best.(c) = 0 then 0 else min best.(c) (calc hbit vbit);\n        if i < n then (\n            let li = 1 lsl i in\n            loop (i + 1) c       hbit          vbit;\n            loop (i + 1) (c + 1) (hbit lor li) vbit;\n            loop (i + 1) (c + 1) hbit          (vbit lor li);\n        )\n    in\n    loop 0 0 0 0;\n\n    Array.iter (Printf.printf \"%d\\n\") best;\n)", "problem_context": "Score: 500 points\n\nProblem Statement\n\nNew AtCoder City has an infinite grid of streets, as follows:\n\nAt the center of the city stands a clock tower. Let (0, 0) be the coordinates of this point.\n\nA straight street, which we will call East-West Main Street, runs east-west and passes the clock tower. It corresponds to the x-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to East-West Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, y = -2, y = -1, y = 1, y = 2, \\ldots in the two-dimensional coordinate plane.\n\nA straight street, which we will call North-South Main Street, runs north-south and passes the clock tower. It corresponds to the y-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to North-South Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, x = -2, x = -1, x = 1, x = 2, \\ldots in the two-dimensional coordinate plane.\n\nThere are N residential areas in New AtCoder City. The i-th area is located at the intersection with the coordinates (X_i, Y_i) and has a population of P_i. Each citizen in the city lives in one of these areas.\n\nThe city currently has only two railroads, stretching infinitely, one along East-West Main Street and the other along North-South Main Street.\n\nM-kun, the mayor, thinks that they are not enough for the commuters, so he decides to choose K streets and build a railroad stretching infinitely along each of those streets.\n\nLet the walking distance of each citizen be the distance from his/her residential area to the nearest railroad.\n\nM-kun wants to build railroads so that the sum of the walking distances of all citizens, S, is minimized.\n\nFor each K = 0, 1, 2, \\dots, N, what is the minimum possible value of S after building railroads?\n\nConstraints\n\n1 \\leq N \\leq 15\n\n-10 \\ 000 \\leq X_i \\leq 10 \\ 000\n\n-10 \\ 000 \\leq Y_i \\leq 10 \\ 000\n\n1 \\leq P_i \\leq 1 \\ 000 \\ 000\n\nThe locations of the N residential areas, (X_i, Y_i), are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 P_1\nX_2 Y_2 P_2\n: : :\nX_N Y_N P_N\n\nOutput\n\nPrint the answer in N+1 lines.\n\nThe i-th line (i = 1, \\ldots, N+1) should contain the minimum possible value of S after building railroads for the case K = i-1.\n\nSample Input 1\n\n3\n1 2 300\n3 3 600\n1 4 800\n\nSample Output 1\n\n2900\n900\n0\n0\n\nWhen K = 0, the residents of Area 1, 2, and 3 have to walk the distances of 1, 3, and 1, respectively, to reach a railroad.\n\nThus, the sum of the walking distances of all citizens, S, is 1 \\times 300 + 3 \\times 600 + 1 \\times 800 = 2900.\n\nWhen K = 1, if we build a railroad along the street corresponding to the line y = 4 in the coordinate plane, the walking distances of the citizens of Area 1, 2, and 3 become 1, 1, and 0, respectively.\n\nThen, S = 1 \\times 300 + 1 \\times 600 + 0 \\times 800 = 900.\n\nWe have many other options for where we build the railroad, but none of them makes S less than 900.\n\nWhen K = 2, if we build a railroad along the street corresponding to the lines x = 1 and x = 3 in the coordinate plane, all citizens can reach a railroad with the walking distance of 0, so S = 0. We can also have S = 0 when K = 3.\n\nThe figure below shows the optimal way to build railroads for the cases K = 0, 1, 2.\n\nThe street painted blue represents the roads along which we build railroads.\n\nSample Input 2\n\n5\n3 5 400\n5 3 700\n5 5 1000\n5 7 700\n7 5 400\n\nSample Output 2\n\n13800\n1600\n0\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the cases K = 1, 2.\n\nSample Input 3\n\n6\n2 5 1000\n5 2 1100\n5 5 1700\n-2 -5 900\n-5 -2 600\n-5 -5 2200\n\nSample Output 3\n\n26700\n13900\n3200\n1200\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 3.\n\nSample Input 4\n\n8\n2 2 286017\n3 1 262355\n2 -2 213815\n1 -3 224435\n-2 -2 136860\n-3 -1 239338\n-2 2 217647\n-1 3 141903\n\nSample Output 4\n\n2576709\n1569381\n868031\n605676\n366338\n141903\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 4.", "sample_input": "3\n1 2 300\n3 3 600\n1 4 800\n"}, "reference_outputs": ["2900\n900\n0\n0\n"], "source_document_id": "p02604", "source_text": "Score: 500 points\n\nProblem Statement\n\nNew AtCoder City has an infinite grid of streets, as follows:\n\nAt the center of the city stands a clock tower. Let (0, 0) be the coordinates of this point.\n\nA straight street, which we will call East-West Main Street, runs east-west and passes the clock tower. It corresponds to the x-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to East-West Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, y = -2, y = -1, y = 1, y = 2, \\ldots in the two-dimensional coordinate plane.\n\nA straight street, which we will call North-South Main Street, runs north-south and passes the clock tower. It corresponds to the y-axis in the two-dimensional coordinate plane.\n\nThere are also other infinitely many streets parallel to North-South Main Street, with a distance of 1 between them. They correspond to the lines \\ldots, x = -2, x = -1, x = 1, x = 2, \\ldots in the two-dimensional coordinate plane.\n\nThere are N residential areas in New AtCoder City. The i-th area is located at the intersection with the coordinates (X_i, Y_i) and has a population of P_i. Each citizen in the city lives in one of these areas.\n\nThe city currently has only two railroads, stretching infinitely, one along East-West Main Street and the other along North-South Main Street.\n\nM-kun, the mayor, thinks that they are not enough for the commuters, so he decides to choose K streets and build a railroad stretching infinitely along each of those streets.\n\nLet the walking distance of each citizen be the distance from his/her residential area to the nearest railroad.\n\nM-kun wants to build railroads so that the sum of the walking distances of all citizens, S, is minimized.\n\nFor each K = 0, 1, 2, \\dots, N, what is the minimum possible value of S after building railroads?\n\nConstraints\n\n1 \\leq N \\leq 15\n\n-10 \\ 000 \\leq X_i \\leq 10 \\ 000\n\n-10 \\ 000 \\leq Y_i \\leq 10 \\ 000\n\n1 \\leq P_i \\leq 1 \\ 000 \\ 000\n\nThe locations of the N residential areas, (X_i, Y_i), are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 P_1\nX_2 Y_2 P_2\n: : :\nX_N Y_N P_N\n\nOutput\n\nPrint the answer in N+1 lines.\n\nThe i-th line (i = 1, \\ldots, N+1) should contain the minimum possible value of S after building railroads for the case K = i-1.\n\nSample Input 1\n\n3\n1 2 300\n3 3 600\n1 4 800\n\nSample Output 1\n\n2900\n900\n0\n0\n\nWhen K = 0, the residents of Area 1, 2, and 3 have to walk the distances of 1, 3, and 1, respectively, to reach a railroad.\n\nThus, the sum of the walking distances of all citizens, S, is 1 \\times 300 + 3 \\times 600 + 1 \\times 800 = 2900.\n\nWhen K = 1, if we build a railroad along the street corresponding to the line y = 4 in the coordinate plane, the walking distances of the citizens of Area 1, 2, and 3 become 1, 1, and 0, respectively.\n\nThen, S = 1 \\times 300 + 1 \\times 600 + 0 \\times 800 = 900.\n\nWe have many other options for where we build the railroad, but none of them makes S less than 900.\n\nWhen K = 2, if we build a railroad along the street corresponding to the lines x = 1 and x = 3 in the coordinate plane, all citizens can reach a railroad with the walking distance of 0, so S = 0. We can also have S = 0 when K = 3.\n\nThe figure below shows the optimal way to build railroads for the cases K = 0, 1, 2.\n\nThe street painted blue represents the roads along which we build railroads.\n\nSample Input 2\n\n5\n3 5 400\n5 3 700\n5 5 1000\n5 7 700\n7 5 400\n\nSample Output 2\n\n13800\n1600\n0\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the cases K = 1, 2.\n\nSample Input 3\n\n6\n2 5 1000\n5 2 1100\n5 5 1700\n-2 -5 900\n-5 -2 600\n-5 -5 2200\n\nSample Output 3\n\n26700\n13900\n3200\n1200\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 3.\n\nSample Input 4\n\n8\n2 2 286017\n3 1 262355\n2 -2 213815\n1 -3 224435\n-2 -2 136860\n-3 -1 239338\n-2 2 217647\n-1 3 141903\n\nSample Output 4\n\n2576709\n1569381\n868031\n605676\n366338\n141903\n0\n0\n0\n\nThe figure below shows the optimal way to build railroads for the case K = 4.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1705, "cpu_time_ms": 3308, "memory_kb": 13676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s774558607", "group_id": "codeNet:p02606", "input_text": "Scanf.scanf \"%d %d %d\" (fun l r d -> Printf.printf \"%d\" (r / d - (l - 1) / d))", "language": "OCaml", "metadata": {"date": 1596417400, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/OCaml/s774558607.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774558607", "user_id": "u752907799"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun l r d -> Printf.printf \"%d\" (r / d - (l - 1) / d))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 6, "memory_kb": 3832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s324495298", "group_id": "codeNet:p02606", "input_text": "open Printf\nopen Scanf\n\nlet solve l r d = r / d - (l - 1) / d\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1594657353, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/OCaml/s324495298.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324495298", "user_id": "u388783188"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve l r d = r / d - (l - 1) / d\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 3, "memory_kb": 3732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380505187", "group_id": "codeNet:p02610", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet rec inchworm i j m (((k, d) :: klrs') as klrs) c =\n  if i < k\n  then c klrs j m\n  else inchworm i (j + 1) (IntMap.update d (fun o -> Some (1 + Option.value ~default:0 o)) m) klrs' c\n\nlet rec sieve i k j m =\n  if j <= i + 1\n  then k j m\n  else\n    sieve i k (j - 1) @@\n    match IntMap.min_binding m with\n    | (d, 1) -> IntMap.remove d m\n    | (d, n) -> IntMap.add d (n - 1) m\n\nlet rec solve n i klrs j m =\n  if n <= i\n  then IntMap.fold (fun d n -> ( + ) @@ d * n) m 0\n  else\n    inchworm i j m klrs @@ fun klrs ->\n      sieve i @@ solve n (i + 1) klrs\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun t ->\n  for i = 1 to t do\n    Scanf.scanf \"%d\\n\" @@ fun n ->\n      let klrs = List.init n @@ fun _ ->\n        Scanf.scanf \"%d %d %d\\n\" @@ fun k l r -> (k - 1, l, r) in\n      let left, right = List.partition (fun (_, l, r) -> r <= l) klrs in\n      Printf.printf \"%d\\n\" @@\n      List.fold_left (fun sum (_, l, r) -> sum + min l r) 0 klrs\n      + solve n 0\n          (List.sort (fun (k, _) (k', _) -> compare k k')\n            ((n, 0) :: List.map (fun (k, l, r) -> (k, l - r)) left)) 0 IntMap.empty\n      + solve n 0\n          (List.sort (fun (k, _) (k', _) -> compare k k')\n            ((n, 0) :: List.filter_map (fun (k, l, r) -> if n - k - 2 < 0 then None else Some (n - k - 2, r - l)) right)) 0 IntMap.empty\n  done", "language": "OCaml", "metadata": {"date": 1594539124, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02610.html", "problem_id": "p02610", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02610/input.txt", "sample_output_relpath": "derived/input_output/data/p02610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02610/OCaml/s380505187.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380505187", "user_id": "u504158101"}, "prompt_components": {"gold_output": "25\n221\n1354\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet rec inchworm i j m (((k, d) :: klrs') as klrs) c =\n  if i < k\n  then c klrs j m\n  else inchworm i (j + 1) (IntMap.update d (fun o -> Some (1 + Option.value ~default:0 o)) m) klrs' c\n\nlet rec sieve i k j m =\n  if j <= i + 1\n  then k j m\n  else\n    sieve i k (j - 1) @@\n    match IntMap.min_binding m with\n    | (d, 1) -> IntMap.remove d m\n    | (d, n) -> IntMap.add d (n - 1) m\n\nlet rec solve n i klrs j m =\n  if n <= i\n  then IntMap.fold (fun d n -> ( + ) @@ d * n) m 0\n  else\n    inchworm i j m klrs @@ fun klrs ->\n      sieve i @@ solve n (i + 1) klrs\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun t ->\n  for i = 1 to t do\n    Scanf.scanf \"%d\\n\" @@ fun n ->\n      let klrs = List.init n @@ fun _ ->\n        Scanf.scanf \"%d %d %d\\n\" @@ fun k l r -> (k - 1, l, r) in\n      let left, right = List.partition (fun (_, l, r) -> r <= l) klrs in\n      Printf.printf \"%d\\n\" @@\n      List.fold_left (fun sum (_, l, r) -> sum + min l r) 0 klrs\n      + solve n 0\n          (List.sort (fun (k, _) (k', _) -> compare k k')\n            ((n, 0) :: List.map (fun (k, l, r) -> (k, l - r)) left)) 0 IntMap.empty\n      + solve n 0\n          (List.sort (fun (k, _) (k', _) -> compare k k')\n            ((n, 0) :: List.filter_map (fun (k, l, r) -> if n - k - 2 < 0 then None else Some (n - k - 2, r - l)) right)) 0 IntMap.empty\n  done", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N camels numbered 1,2,\\ldots,N.\nSnuke has decided to make them line up in a row.\n\nThe happiness of Camel i will be L_i if it is among the K_i frontmost camels, and R_i otherwise.\n\nSnuke wants to maximize the total happiness of the camels. Find the maximum possible total happiness of the camel.\n\nSolve this problem for each of the T test cases given.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 10^5\n\n1 \\leq N \\leq 2 \\times 10^{5}\n\n1 \\leq K_i \\leq N\n\n1 \\leq L_i, R_i \\leq 10^9\n\nThe sum of values of N in each input file is at most 2 \\times 10^5.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\\mathrm{case}_1\n\\vdots\n\\mathrm{case}_T\n\nEach case is given in the following format:\n\nN\nK_1 L_1 R_1\n\\vdots\nK_N L_N R_N\n\nOutput\n\nPrint T lines. The i-th line should contain the answer to the i-th test case.\n\nSample Input 1\n\n3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 67 78\n12 16 60\n18 48 28\n5 4 24\n12 97 97\n4 57 87\n19 91 74\n18 100 76\n7 86 46\n9 100 57\n3 76 73\n6 84 93\n1 6 84\n11 75 94\n19 15 3\n12 11 34\n\nSample Output 1\n\n25\n221\n1354\n\nIn the first test case, it is optimal to line up the camels in the order 2, 1.\n\nCamel 1 is not the frontmost camel, so its happiness will be 10.\n\nCamel 2 is among the two frontmost camels, so its happiness will be 15.\n\nIn the second test case, it is optimal to line up the camels in the order 2, 1, 3.\n\nCamel 1 is among the two frontmost camels, so its happiness will be 93.\n\nCamel 2 is the frontmost camel, so its happiness will be 71.\n\nCamel 3 is among the three frontmost camels, so its happiness will be 57.", "sample_input": "3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 67 78\n12 16 60\n18 48 28\n5 4 24\n12 97 97\n4 57 87\n19 91 74\n18 100 76\n7 86 46\n9 100 57\n3 76 73\n6 84 93\n1 6 84\n11 75 94\n19 15 3\n12 11 34\n"}, "reference_outputs": ["25\n221\n1354\n"], "source_document_id": "p02610", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N camels numbered 1,2,\\ldots,N.\nSnuke has decided to make them line up in a row.\n\nThe happiness of Camel i will be L_i if it is among the K_i frontmost camels, and R_i otherwise.\n\nSnuke wants to maximize the total happiness of the camels. Find the maximum possible total happiness of the camel.\n\nSolve this problem for each of the T test cases given.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 10^5\n\n1 \\leq N \\leq 2 \\times 10^{5}\n\n1 \\leq K_i \\leq N\n\n1 \\leq L_i, R_i \\leq 10^9\n\nThe sum of values of N in each input file is at most 2 \\times 10^5.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\\mathrm{case}_1\n\\vdots\n\\mathrm{case}_T\n\nEach case is given in the following format:\n\nN\nK_1 L_1 R_1\n\\vdots\nK_N L_N R_N\n\nOutput\n\nPrint T lines. The i-th line should contain the answer to the i-th test case.\n\nSample Input 1\n\n3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 67 78\n12 16 60\n18 48 28\n5 4 24\n12 97 97\n4 57 87\n19 91 74\n18 100 76\n7 86 46\n9 100 57\n3 76 73\n6 84 93\n1 6 84\n11 75 94\n19 15 3\n12 11 34\n\nSample Output 1\n\n25\n221\n1354\n\nIn the first test case, it is optimal to line up the camels in the order 2, 1.\n\nCamel 1 is not the frontmost camel, so its happiness will be 10.\n\nCamel 2 is among the two frontmost camels, so its happiness will be 15.\n\nIn the second test case, it is optimal to line up the camels in the order 2, 1, 3.\n\nCamel 1 is among the two frontmost camels, so its happiness will be 93.\n\nCamel 2 is the frontmost camel, so its happiness will be 71.\n\nCamel 3 is among the three frontmost camels, so its happiness will be 57.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1386, "cpu_time_ms": 510, "memory_kb": 53228}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s606620224", "group_id": "codeNet:p02610", "input_text": "Scanf.scanf \"%d\" (fun t ->\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    for i = 1 to t do\n        Scanf.scanf \" %d\" (fun n ->\n            let klr = Array.init n (fun _ -> Scanf.scanf \" %d %d %d\" (fun k l r -> k, l, r)) in\n            let sum = Array.fold_left (fun acc (_, l, r) -> acc + min l r) 0 klr in\n\n            let rec loop i left right =\n                if i = n then Array.of_list left, Array.of_list right else\n                    let k, l, r = klr.(i) in\n                    if l > r then loop (i + 1) ((k, l - r) :: left) right\n                             else loop (i + 1) left ((n - k, r - l) :: right)\n            in\n            let left, right = loop 0 [] [] in\n            Array.sort compare left;\n            Array.sort compare right;\n            let proc a =\n                let len = Array.length a in\n                let rec loop i j acc set ct =\n                    if i = len then acc else\n                        let k, dif =  a.(i) in\n                        if k > j then loop i (j + 1) acc set ct else\n                            let set = S.add (dif, i) set in\n                            let ct = ct + 1 in\n                            let acc = acc + dif in\n                            if ct <= k then loop (i + 1) j acc set ct else\n                                let ((dif, _) as m) = S.min_elt set in\n                                let set = S.remove m set in\n                                let ct = ct - 1 in\n                                let acc = acc - dif in\n                                loop (i + 1) j acc set ct\n                in\n                loop 0 0 0 S.empty 0\n            in\n            Printf.printf \"%d\\n\" @@ sum + proc left + proc right\n        )\n    done\n)", "language": "OCaml", "metadata": {"date": 1594533943, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02610.html", "problem_id": "p02610", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02610/input.txt", "sample_output_relpath": "derived/input_output/data/p02610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02610/OCaml/s606620224.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s606620224", "user_id": "u342443598"}, "prompt_components": {"gold_output": "25\n221\n1354\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun t ->\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    for i = 1 to t do\n        Scanf.scanf \" %d\" (fun n ->\n            let klr = Array.init n (fun _ -> Scanf.scanf \" %d %d %d\" (fun k l r -> k, l, r)) in\n            let sum = Array.fold_left (fun acc (_, l, r) -> acc + min l r) 0 klr in\n\n            let rec loop i left right =\n                if i = n then Array.of_list left, Array.of_list right else\n                    let k, l, r = klr.(i) in\n                    if l > r then loop (i + 1) ((k, l - r) :: left) right\n                             else loop (i + 1) left ((n - k, r - l) :: right)\n            in\n            let left, right = loop 0 [] [] in\n            Array.sort compare left;\n            Array.sort compare right;\n            let proc a =\n                let len = Array.length a in\n                let rec loop i j acc set ct =\n                    if i = len then acc else\n                        let k, dif =  a.(i) in\n                        if k > j then loop i (j + 1) acc set ct else\n                            let set = S.add (dif, i) set in\n                            let ct = ct + 1 in\n                            let acc = acc + dif in\n                            if ct <= k then loop (i + 1) j acc set ct else\n                                let ((dif, _) as m) = S.min_elt set in\n                                let set = S.remove m set in\n                                let ct = ct - 1 in\n                                let acc = acc - dif in\n                                loop (i + 1) j acc set ct\n                in\n                loop 0 0 0 S.empty 0\n            in\n            Printf.printf \"%d\\n\" @@ sum + proc left + proc right\n        )\n    done\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N camels numbered 1,2,\\ldots,N.\nSnuke has decided to make them line up in a row.\n\nThe happiness of Camel i will be L_i if it is among the K_i frontmost camels, and R_i otherwise.\n\nSnuke wants to maximize the total happiness of the camels. Find the maximum possible total happiness of the camel.\n\nSolve this problem for each of the T test cases given.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 10^5\n\n1 \\leq N \\leq 2 \\times 10^{5}\n\n1 \\leq K_i \\leq N\n\n1 \\leq L_i, R_i \\leq 10^9\n\nThe sum of values of N in each input file is at most 2 \\times 10^5.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\\mathrm{case}_1\n\\vdots\n\\mathrm{case}_T\n\nEach case is given in the following format:\n\nN\nK_1 L_1 R_1\n\\vdots\nK_N L_N R_N\n\nOutput\n\nPrint T lines. The i-th line should contain the answer to the i-th test case.\n\nSample Input 1\n\n3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 67 78\n12 16 60\n18 48 28\n5 4 24\n12 97 97\n4 57 87\n19 91 74\n18 100 76\n7 86 46\n9 100 57\n3 76 73\n6 84 93\n1 6 84\n11 75 94\n19 15 3\n12 11 34\n\nSample Output 1\n\n25\n221\n1354\n\nIn the first test case, it is optimal to line up the camels in the order 2, 1.\n\nCamel 1 is not the frontmost camel, so its happiness will be 10.\n\nCamel 2 is among the two frontmost camels, so its happiness will be 15.\n\nIn the second test case, it is optimal to line up the camels in the order 2, 1, 3.\n\nCamel 1 is among the two frontmost camels, so its happiness will be 93.\n\nCamel 2 is the frontmost camel, so its happiness will be 71.\n\nCamel 3 is among the three frontmost camels, so its happiness will be 57.", "sample_input": "3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 67 78\n12 16 60\n18 48 28\n5 4 24\n12 97 97\n4 57 87\n19 91 74\n18 100 76\n7 86 46\n9 100 57\n3 76 73\n6 84 93\n1 6 84\n11 75 94\n19 15 3\n12 11 34\n"}, "reference_outputs": ["25\n221\n1354\n"], "source_document_id": "p02610", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N camels numbered 1,2,\\ldots,N.\nSnuke has decided to make them line up in a row.\n\nThe happiness of Camel i will be L_i if it is among the K_i frontmost camels, and R_i otherwise.\n\nSnuke wants to maximize the total happiness of the camels. Find the maximum possible total happiness of the camel.\n\nSolve this problem for each of the T test cases given.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 10^5\n\n1 \\leq N \\leq 2 \\times 10^{5}\n\n1 \\leq K_i \\leq N\n\n1 \\leq L_i, R_i \\leq 10^9\n\nThe sum of values of N in each input file is at most 2 \\times 10^5.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\\mathrm{case}_1\n\\vdots\n\\mathrm{case}_T\n\nEach case is given in the following format:\n\nN\nK_1 L_1 R_1\n\\vdots\nK_N L_N R_N\n\nOutput\n\nPrint T lines. The i-th line should contain the answer to the i-th test case.\n\nSample Input 1\n\n3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 67 78\n12 16 60\n18 48 28\n5 4 24\n12 97 97\n4 57 87\n19 91 74\n18 100 76\n7 86 46\n9 100 57\n3 76 73\n6 84 93\n1 6 84\n11 75 94\n19 15 3\n12 11 34\n\nSample Output 1\n\n25\n221\n1354\n\nIn the first test case, it is optimal to line up the camels in the order 2, 1.\n\nCamel 1 is not the frontmost camel, so its happiness will be 10.\n\nCamel 2 is among the two frontmost camels, so its happiness will be 15.\n\nIn the second test case, it is optimal to line up the camels in the order 2, 1, 3.\n\nCamel 1 is among the two frontmost camels, so its happiness will be 93.\n\nCamel 2 is the frontmost camel, so its happiness will be 71.\n\nCamel 3 is among the three frontmost camels, so its happiness will be 57.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1759, "cpu_time_ms": 521, "memory_kb": 38280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s595010114", "group_id": "codeNet:p02613", "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 putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule JunkList = 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 = JunkList\n\nmodule JunkArray = 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 = JunkArray\n\nmodule JunkString = 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 = JunkString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule JunkSortedSet = 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 = JunkSortedSet\n\nmodule JunkSortedMap  = 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 = JunkSortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule JunkIntArithmetic = struct\n\n  let rec power x e =\n    if e = 0 then x\n    else \n      let rec loop r x2 e' =\n        if e' = 0 then r\n        else if e' land 1 = 0 then loop r (x2 * x2) (e' lsr 1)\n        else loop (r * x2) (x2 * x2) (e' lsr 1)\n      in loop 1 x e\n\n  let rec powers_le_1000 x =\n    if x > 32 then [x]\n    else\n      L.init 9 (fun e -> power x (e + 1))\n      |> L.filter (fun y -> y < 1000)\n\n  let primes_le_1000 = [2;3;5;7;11;13;17;19;23;29;31;37;41;\n    43;47;53;59;61;67;71;73;79;83;89;97;101;\n    103;107;109;113;127;131;137;139;149;151;157;163;167;\n    173;179;181;191;193;197;199;211;223;227;229;233;239;\n    241;251;257;263;269;271;277;281;283;293;307;311;313;\n    317;331;337;347;349;353;359;367;373;379;383;389;397;\n    401;409;419;421;431;433;439;443;449;457;461;463;467;\n    479;487;491;499;503;509;521;523;541;547;557;563;569;\n    571;577;587;593;599;601;607;613;617;619;631;641;643;\n    647;653;659;661;673;677;683;691;701;709;719;727;733;\n    739;743;751;757;761;769;773;787;797;809;811;821;823;\n    827;829;839;853;857;859;863;877;881;883;887;907;911;\n    919;929;937;941;947;953;967;971;977;983;991;997]\n\n    let primes_and_powers_le_1000 =\n      [2;3;4;5;7;8;9;11;13;16;17;19;23;25;27;29;31;32;37;41;\n      43;47;49;53;59;61;64;67;71;73;79;81;83;89;97;\n      101;103;107;109;113;121;125;127;128;131;137;139;149;151;\n      157;163;167;169;173;179;181;191;193;197;199;211;223;227;\n      229;233;239;241;243;251;256;257;263;269;271;277;281;283;\n      289;293;307;311;313;317;331;337;343;347;349;353;359;361;\n      367;373;379;383;389;397;401;409;419;421;431;433;439;443;\n      449;457;461;463;467;479;487;491;499;503;509;512;521;523;\n      529;541;547;557;563;569;571;577;587;593;599;601;607;613;\n      617;619;625;631;641;643;647;653;659;661;673;677;683;691;\n      701;709;719;727;729;733;739;743;751;757;761;769;773;787;\n      797;809;811;821;823;827;829;839;841;853;857;859;863;877;\n      881;883;887;907;911;919;929;937;941;947;953;961;967;971;\n      977;983;991;997]\n\n  let factorize_with ps n =\n    let rec loop acc ps e n' =\n      if n' <= 1 then ([], n') \n      else\n        match ps with\n        | [] -> (acc, n')\n        | p::t ->\n          let r = n' mod p in\n          if r = 0 then (\n            if n' = p then ((p, e + 1) :: acc, 1)\n            else loop acc ps (e + 1) (n' / p)\n          ) else\n            loop (if e = 0 then acc else (p, e) :: acc) t 0 n'\n    in\n    let (fs, r) = loop [] ps 0 n in\n    (L.rev fs, r)\n\n  let factorize_le_million n =\n    factorize_with primes_le_1000 n\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \n\nend\n\nmodule N = JunkIntArithmetic\n\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 _ =\n  let n = rdi () in\n  let ss = rdv n rds in\n  let res = A.make 4 0 in \n\n  let inc i = res.(i) <- res.(i) + 1 in\n\n  let rec loop = function\n  | [] -> ()\n  | \"AC\"::t -> inc 0; loop t\n  | \"WA\"::t -> inc 1; loop t \n  | \"TLE\"::t -> inc 2; loop t\n  | \"RE\"::t -> inc 3; loop t\n  | _ -> ()\n  in\n\n  loop ss;\n  printf \"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\" res.(0) res.(1) res.(2) res.(3);\n  ()\n", "language": "OCaml", "metadata": {"date": 1593998040, "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/s595010114.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595010114", "user_id": "u970139668"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\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 putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule JunkList = 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 = JunkList\n\nmodule JunkArray = 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 = JunkArray\n\nmodule JunkString = 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 = JunkString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule JunkSortedSet = 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 = JunkSortedSet\n\nmodule JunkSortedMap  = 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 = JunkSortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule JunkIntArithmetic = struct\n\n  let rec power x e =\n    if e = 0 then x\n    else \n      let rec loop r x2 e' =\n        if e' = 0 then r\n        else if e' land 1 = 0 then loop r (x2 * x2) (e' lsr 1)\n        else loop (r * x2) (x2 * x2) (e' lsr 1)\n      in loop 1 x e\n\n  let rec powers_le_1000 x =\n    if x > 32 then [x]\n    else\n      L.init 9 (fun e -> power x (e + 1))\n      |> L.filter (fun y -> y < 1000)\n\n  let primes_le_1000 = [2;3;5;7;11;13;17;19;23;29;31;37;41;\n    43;47;53;59;61;67;71;73;79;83;89;97;101;\n    103;107;109;113;127;131;137;139;149;151;157;163;167;\n    173;179;181;191;193;197;199;211;223;227;229;233;239;\n    241;251;257;263;269;271;277;281;283;293;307;311;313;\n    317;331;337;347;349;353;359;367;373;379;383;389;397;\n    401;409;419;421;431;433;439;443;449;457;461;463;467;\n    479;487;491;499;503;509;521;523;541;547;557;563;569;\n    571;577;587;593;599;601;607;613;617;619;631;641;643;\n    647;653;659;661;673;677;683;691;701;709;719;727;733;\n    739;743;751;757;761;769;773;787;797;809;811;821;823;\n    827;829;839;853;857;859;863;877;881;883;887;907;911;\n    919;929;937;941;947;953;967;971;977;983;991;997]\n\n    let primes_and_powers_le_1000 =\n      [2;3;4;5;7;8;9;11;13;16;17;19;23;25;27;29;31;32;37;41;\n      43;47;49;53;59;61;64;67;71;73;79;81;83;89;97;\n      101;103;107;109;113;121;125;127;128;131;137;139;149;151;\n      157;163;167;169;173;179;181;191;193;197;199;211;223;227;\n      229;233;239;241;243;251;256;257;263;269;271;277;281;283;\n      289;293;307;311;313;317;331;337;343;347;349;353;359;361;\n      367;373;379;383;389;397;401;409;419;421;431;433;439;443;\n      449;457;461;463;467;479;487;491;499;503;509;512;521;523;\n      529;541;547;557;563;569;571;577;587;593;599;601;607;613;\n      617;619;625;631;641;643;647;653;659;661;673;677;683;691;\n      701;709;719;727;729;733;739;743;751;757;761;769;773;787;\n      797;809;811;821;823;827;829;839;841;853;857;859;863;877;\n      881;883;887;907;911;919;929;937;941;947;953;961;967;971;\n      977;983;991;997]\n\n  let factorize_with ps n =\n    let rec loop acc ps e n' =\n      if n' <= 1 then ([], n') \n      else\n        match ps with\n        | [] -> (acc, n')\n        | p::t ->\n          let r = n' mod p in\n          if r = 0 then (\n            if n' = p then ((p, e + 1) :: acc, 1)\n            else loop acc ps (e + 1) (n' / p)\n          ) else\n            loop (if e = 0 then acc else (p, e) :: acc) t 0 n'\n    in\n    let (fs, r) = loop [] ps 0 n in\n    (L.rev fs, r)\n\n  let factorize_le_million n =\n    factorize_with primes_le_1000 n\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \n\nend\n\nmodule N = JunkIntArithmetic\n\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 _ =\n  let n = rdi () in\n  let ss = rdv n rds in\n  let res = A.make 4 0 in \n\n  let inc i = res.(i) <- res.(i) + 1 in\n\n  let rec loop = function\n  | [] -> ()\n  | \"AC\"::t -> inc 0; loop t\n  | \"WA\"::t -> inc 1; loop t \n  | \"TLE\"::t -> inc 2; loop t\n  | \"RE\"::t -> inc 3; loop t\n  | _ -> ()\n  in\n\n  loop ss;\n  printf \"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\" res.(0) res.(1) res.(2) res.(3);\n  ()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9824, "cpu_time_ms": 48, "memory_kb": 14080}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s038190845", "group_id": "codeNet:p02613", "input_text": "let () =\n\tlet arr = Array.make 4 0 in\n\tScanf.scanf \"%d\\n\" @@ fun n ->\n    for i = 0 to n - 1 do\n    \tScanf.scanf \"%s\\n\" @@ fun s -> \n        if s = \"AC\" then arr.(0) <- arr.(0) + 1\n        else if s = \"WA\" then arr.(1) <- arr.(1) + 1\n        else if s = \"TLE\" then arr.(2) <- arr.(2) + 1\n        else arr.(3) <- arr.(3) + 1\n    done;\n    Printf.printf \"AC x %d\\n\" arr.(0);\n    Printf.printf \"WA x %d\\n\" arr.(1);\n    Printf.printf \"TLE x %d\\n\" arr.(2);\n    Printf.printf \"RE x %d\\n\" arr.(3);", "language": "OCaml", "metadata": {"date": 1593997596, "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/s038190845.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038190845", "user_id": "u307426615"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "let () =\n\tlet arr = Array.make 4 0 in\n\tScanf.scanf \"%d\\n\" @@ fun n ->\n    for i = 0 to n - 1 do\n    \tScanf.scanf \"%s\\n\" @@ fun s -> \n        if s = \"AC\" then arr.(0) <- arr.(0) + 1\n        else if s = \"WA\" then arr.(1) <- arr.(1) + 1\n        else if s = \"TLE\" then arr.(2) <- arr.(2) + 1\n        else arr.(3) <- arr.(3) + 1\n    done;\n    Printf.printf \"AC x %d\\n\" arr.(0);\n    Printf.printf \"WA x %d\\n\" arr.(1);\n    Printf.printf \"TLE x %d\\n\" arr.(2);\n    Printf.printf \"RE x %d\\n\" arr.(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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 5908}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s435835276", "group_id": "codeNet:p02615", "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 |> List.sort compare |> List.rev\n\nlet rec loop sum acc = function\n  | 0 -> sum\n  | 1 -> sum + (List.hd acc)\n  | i -> loop (sum + (List.hd acc) * 2) (List.tl acc) (i - 2)\n\nlet () = Printf.printf \"%d\\n\" @@ loop (List.hd a) (List.tl a) (n - 2)", "language": "OCaml", "metadata": {"date": 1593998895, "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/s435835276.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435835276", "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 |> List.sort compare |> List.rev\n\nlet rec loop sum acc = function\n  | 0 -> sum\n  | 1 -> sum + (List.hd acc)\n  | i -> loop (sum + (List.hd acc) * 2) (List.tl acc) (i - 2)\n\nlet () = Printf.printf \"%d\\n\" @@ loop (List.hd a) (List.tl a) (n - 2)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "sample_input": "4\n2 2 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02615", "source_text": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 436, "cpu_time_ms": 169, "memory_kb": 31180}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s914440775", "group_id": "codeNet:p02616", "input_text": "let m = 1000000007\nlet ( *^ ) x y = (x * y) mod m\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let pos, neg =\n    List.partition (( <= ) 0) @@\n    List.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let l = List.length pos in\n  let l' = List.length neg in\n  let pos' = Array.make (l + 1) 1 in\n  let pos'' = Array.make (l + 1) 0.  in\n  let neg' = Array.make (l' + 1) 1 in\n  let neg'' = Array.make (l' + 1) 0.  in\n  let neg''' = Array.make (l' + 1) 1 in\n  let neg'''' = Array.make (l' + 1) 0.  in\n  List.iteri (fun i a ->\n    pos'.(i + 1) <- pos'.(i) *^ a;\n    pos''.(i + 1) <- pos''.(i) +. log (float_of_int a)) (List.sort (Fun.flip compare) pos);\n  List.iteri (fun i a ->\n    neg'.(i + 1) <- neg'.(i) *^ (a + m);\n    neg''.(i + 1) <- neg''.(i) +. log (float_of_int (~- a))) (List.sort compare neg);\n  List.iteri (fun i a ->\n    neg'''.(i + 1) <- neg'''.(i) *^ (a + m);\n    neg''''.(i + 1) <- neg''''.(i) +. log (float_of_int (~- a))) (List.sort (Fun.flip compare) neg);\n  Printf.printf \"%d\\n\" @@\n  snd @@\n  snd @@\n  Array.fold_left max (0, (neg_infinity, 0)) @@\n  Array.init (1 + k) @@ fun i ->\n    if l < k - i || l' < i then (0, (neg_infinity, 0))\n    else if i mod 2 = 1\n    then (0, (~-. (pos''.(k - i)) -. neg''''.(i), pos'.(k - i) *^ neg'''.(i)))\n    else (1, (pos''.(k - i) +. neg''.(i), pos'.(k - i) *^ neg'.(i)))", "language": "OCaml", "metadata": {"date": 1593981714, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02616.html", "problem_id": "p02616", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02616/input.txt", "sample_output_relpath": "derived/input_output/data/p02616/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02616/OCaml/s914440775.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s914440775", "user_id": "u504158101"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let m = 1000000007\nlet ( *^ ) x y = (x * y) mod m\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let pos, neg =\n    List.partition (( <= ) 0) @@\n    List.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let l = List.length pos in\n  let l' = List.length neg in\n  let pos' = Array.make (l + 1) 1 in\n  let pos'' = Array.make (l + 1) 0.  in\n  let neg' = Array.make (l' + 1) 1 in\n  let neg'' = Array.make (l' + 1) 0.  in\n  let neg''' = Array.make (l' + 1) 1 in\n  let neg'''' = Array.make (l' + 1) 0.  in\n  List.iteri (fun i a ->\n    pos'.(i + 1) <- pos'.(i) *^ a;\n    pos''.(i + 1) <- pos''.(i) +. log (float_of_int a)) (List.sort (Fun.flip compare) pos);\n  List.iteri (fun i a ->\n    neg'.(i + 1) <- neg'.(i) *^ (a + m);\n    neg''.(i + 1) <- neg''.(i) +. log (float_of_int (~- a))) (List.sort compare neg);\n  List.iteri (fun i a ->\n    neg'''.(i + 1) <- neg'''.(i) *^ (a + m);\n    neg''''.(i + 1) <- neg''''.(i) +. log (float_of_int (~- a))) (List.sort (Fun.flip compare) neg);\n  Printf.printf \"%d\\n\" @@\n  snd @@\n  snd @@\n  Array.fold_left max (0, (neg_infinity, 0)) @@\n  Array.init (1 + k) @@ fun i ->\n    if l < k - i || l' < i then (0, (neg_infinity, 0))\n    else if i mod 2 = 1\n    then (0, (~-. (pos''.(k - i)) -. neg''''.(i), pos'.(k - i) *^ neg'''.(i)))\n    else (1, (pos''.(k - i) +. neg''.(i), pos'.(k - i) *^ neg'.(i)))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "sample_input": "4 2\n1 2 -3 -4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02616", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1333, "cpu_time_ms": 251, "memory_kb": 38760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s198737119", "group_id": "codeNet:p02616", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n, k = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n k -> (n, k)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet 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\n\nlet rec take res n acc = match (n, acc) with\n  | (_, []) | (0, _) -> List.rev res\n  | (i, x :: xs) -> take (x :: res) (n - 1) xs\nlet take = take []\n\nlet rec drop n acc = match (n, acc) with\n  | (0, acc) -> acc\n  | (_, []) -> []\n  | (n, x :: xs) -> drop (n - 1) xs\n\nlet rec split a b = function\n  | [] -> (List.sort compare a |> List.rev, List.sort compare b)\n  | x :: rest when x > 0 -> split (x :: a) b rest\n  | x :: rest -> split a (x :: b) rest\nlet plus, minus = split [] [] a\n\nlet rec two res = function\n  | [] -> res\n  | x :: [] -> (x, 1) :: res\n  | x :: y :: rest -> two ((x, y) :: res) rest\n\nlet solve1 () = \n  let ps = two [] plus in\n  let ms = two [] minus in\n  let acc = (ps @ ms) |> List.sort (fun (a, b) (c, d) -> abs (c * d) - abs (a * b)) in\n  let sum = List.fold_left (fun sum (a, b) -> sum *^ a *^ b) 1 @@ take (k / 2) acc in\n  let rec g sum = function\n    | [] -> failwith \"\"\n    | (a, _) :: _ when a > 0 -> sum *^ a\n    | _ :: rest -> g sum rest \n  in\n  if k mod 2 = 1 then g sum (drop (k / 2) acc) else sum\n\nlet solve2 () =\n  let rec take res n acc = match (n, acc) with\n    | (_, []) | (0, _) -> List.rev res\n    | (i, x :: xs) -> take (x :: res) (n - 1) xs in\n  let take = take [] in\n  let a = List.sort (fun a b -> abs a - abs b) a in\n  List.fold_left ( *^ ) 1 @@ take k a\n\nlet f n = (n + m_1e9) mod m_1e9\n  \nlet () =\n  let p_len = List.length plus in\n  Printf.printf \"%d\\n\" @@ f @@\n  if p_len >= k || (k - p_len) mod 2 = 0 then solve1 () else solve2 ()", "language": "OCaml", "metadata": {"date": 1593981118, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02616.html", "problem_id": "p02616", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02616/input.txt", "sample_output_relpath": "derived/input_output/data/p02616/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02616/OCaml/s198737119.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s198737119", "user_id": "u811309788"}, "prompt_components": {"gold_output": "12\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, k)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet 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\n\nlet rec take res n acc = match (n, acc) with\n  | (_, []) | (0, _) -> List.rev res\n  | (i, x :: xs) -> take (x :: res) (n - 1) xs\nlet take = take []\n\nlet rec drop n acc = match (n, acc) with\n  | (0, acc) -> acc\n  | (_, []) -> []\n  | (n, x :: xs) -> drop (n - 1) xs\n\nlet rec split a b = function\n  | [] -> (List.sort compare a |> List.rev, List.sort compare b)\n  | x :: rest when x > 0 -> split (x :: a) b rest\n  | x :: rest -> split a (x :: b) rest\nlet plus, minus = split [] [] a\n\nlet rec two res = function\n  | [] -> res\n  | x :: [] -> (x, 1) :: res\n  | x :: y :: rest -> two ((x, y) :: res) rest\n\nlet solve1 () = \n  let ps = two [] plus in\n  let ms = two [] minus in\n  let acc = (ps @ ms) |> List.sort (fun (a, b) (c, d) -> abs (c * d) - abs (a * b)) in\n  let sum = List.fold_left (fun sum (a, b) -> sum *^ a *^ b) 1 @@ take (k / 2) acc in\n  let rec g sum = function\n    | [] -> failwith \"\"\n    | (a, _) :: _ when a > 0 -> sum *^ a\n    | _ :: rest -> g sum rest \n  in\n  if k mod 2 = 1 then g sum (drop (k / 2) acc) else sum\n\nlet solve2 () =\n  let rec take res n acc = match (n, acc) with\n    | (_, []) | (0, _) -> List.rev res\n    | (i, x :: xs) -> take (x :: res) (n - 1) xs in\n  let take = take [] in\n  let a = List.sort (fun a b -> abs a - abs b) a in\n  List.fold_left ( *^ ) 1 @@ take k a\n\nlet f n = (n + m_1e9) mod m_1e9\n  \nlet () =\n  let p_len = List.length plus in\n  Printf.printf \"%d\\n\" @@ f @@\n  if p_len >= k || (k - p_len) mod 2 = 0 then solve1 () else solve2 ()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "sample_input": "4 2\n1 2 -3 -4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02616", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1865, "cpu_time_ms": 284, "memory_kb": 43592}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s732825559", "group_id": "codeNet:p02617", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let es = Array.init (n - 1) @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun u v -> u, v in\n  let vs =\n    Array.fold_left ( + ) 0 @@\n    Array.init n @@ fun i -> (i + 1) * (n - i) in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left (fun acc (u, v) ->\n    let [u; v] = List.sort compare [u; v] in\n    acc - u * (n - v + 1)) vs es", "language": "OCaml", "metadata": {"date": 1593981682, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02617.html", "problem_id": "p02617", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02617/input.txt", "sample_output_relpath": "derived/input_output/data/p02617/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02617/OCaml/s732825559.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s732825559", "user_id": "u504158101"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let es = Array.init (n - 1) @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun u v -> u, v in\n  let vs =\n    Array.fold_left ( + ) 0 @@\n    Array.init n @@ fun i -> (i + 1) * (n - i) in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left (fun acc (u, v) ->\n    let [u; v] = List.sort compare [u; v] in\n    acc - u * (n - v + 1)) vs es", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices and N-1 edges, respectively numbered 1, 2,\\cdots, N and 1, 2, \\cdots, N-1. Edge i connects Vertex u_i and v_i.\n\nFor integers L, R (1 \\leq L \\leq R \\leq N), let us define a function f(L, R) as follows:\n\nLet S be the set of the vertices numbered L through R. f(L, R) represents the number of connected components in the subgraph formed only from the vertex set S and the edges whose endpoints both belong to S.\n\nCompute \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq u_i, v_i \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nSample Input 1\n\n3\n1 3\n2 3\n\nSample Output 1\n\n7\n\nWe have six possible pairs (L, R) as follows:\n\nFor L = 1, R = 1, S = \\{1\\} and we have 1 connected component.\n\nFor L = 1, R = 2, S = \\{1, 2\\} and we have 2 connected components.\n\nFor L = 1, R = 3, S = \\{1, 2, 3\\} and we have 1 connected component, since S contains both endpoints of each of the edges 1, 2.\n\nFor L = 2, R = 2, S = \\{2\\} and we have 1 connected component.\n\nFor L = 2, R = 3, S = \\{2, 3\\} and we have 1 connected component, since S contains both endpoints of Edge 2.\n\nFor L = 3, R = 3, S = \\{3\\} and we have 1 connected component.\n\nThe sum of these is 7.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n10\n5 3\n5 7\n8 9\n1 9\n9 10\n8 4\n7 4\n6 10\n7 2\n\nSample Output 3\n\n113", "sample_input": "3\n1 3\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02617", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices and N-1 edges, respectively numbered 1, 2,\\cdots, N and 1, 2, \\cdots, N-1. Edge i connects Vertex u_i and v_i.\n\nFor integers L, R (1 \\leq L \\leq R \\leq N), let us define a function f(L, R) as follows:\n\nLet S be the set of the vertices numbered L through R. f(L, R) represents the number of connected components in the subgraph formed only from the vertex set S and the edges whose endpoints both belong to S.\n\nCompute \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq u_i, v_i \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nSample Input 1\n\n3\n1 3\n2 3\n\nSample Output 1\n\n7\n\nWe have six possible pairs (L, R) as follows:\n\nFor L = 1, R = 1, S = \\{1\\} and we have 1 connected component.\n\nFor L = 1, R = 2, S = \\{1, 2\\} and we have 2 connected components.\n\nFor L = 1, R = 3, S = \\{1, 2, 3\\} and we have 1 connected component, since S contains both endpoints of each of the edges 1, 2.\n\nFor L = 2, R = 2, S = \\{2\\} and we have 1 connected component.\n\nFor L = 2, R = 3, S = \\{2, 3\\} and we have 1 connected component, since S contains both endpoints of Edge 2.\n\nFor L = 3, R = 3, S = \\{3\\} and we have 1 connected component.\n\nThe sum of these is 7.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n10\n5 3\n5 7\n8 9\n1 9\n9 10\n8 4\n7 4\n6 10\n7 2\n\nSample Output 3\n\n113", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 100, "memory_kb": 14264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s820437054", "group_id": "codeNet:p02619", "input_text": "Scanf.scanf \"%d\" (fun d ->\n    let c = Array.init 26 (fun _ -> Scanf.scanf \" %d\" (fun c -> c)) in\n    let s = Array.init d (fun _ ->\n        Array.init 26 (fun _ ->\n            Scanf.scanf \" %d\" (fun s -> s)))\n    in\n    let t = Array.init d (fun _ -> Scanf.scanf \" %d\" (fun t -> t - 1)) in\n    let last = Array.make 26 (-1) in\n    let rec loop i sat =\n        if i < d then (\n            let sat = sat + s.(i).(t.(i)) in\n            last.(t.(i)) <- i;\n            let rec loop2 j sat =\n                if j = 26 then sat else\n                    loop2 (j + 1) (sat - c.(j) * (i - last.(j)))\n            in\n            let sat = loop2 0 sat in\n            Printf.printf \"%d\\n\" sat;\n            loop (i + 1) sat\n        )\n    in\n    loop 0 0\n)\n", "language": "OCaml", "metadata": {"date": 1593394423, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02619.html", "problem_id": "p02619", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02619/input.txt", "sample_output_relpath": "derived/input_output/data/p02619/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02619/OCaml/s820437054.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820437054", "user_id": "u342443598"}, "prompt_components": {"gold_output": "18398\n35037\n51140\n65837\n79325\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun d ->\n    let c = Array.init 26 (fun _ -> Scanf.scanf \" %d\" (fun c -> c)) in\n    let s = Array.init d (fun _ ->\n        Array.init 26 (fun _ ->\n            Scanf.scanf \" %d\" (fun s -> s)))\n    in\n    let t = Array.init d (fun _ -> Scanf.scanf \" %d\" (fun t -> t - 1)) in\n    let last = Array.make 26 (-1) in\n    let rec loop i sat =\n        if i < d then (\n            let sat = sat + s.(i).(t.(i)) in\n            last.(t.(i)) <- i;\n            let rec loop2 j sat =\n                if j = 26 then sat else\n                    loop2 (j + 1) (sat - c.(j) * (i - last.(j)))\n            in\n            let sat = loop2 0 sat in\n            Printf.printf \"%d\\n\" sat;\n            loop (i + 1) sat\n        )\n    in\n    loop 0 0\n)\n", "problem_context": "(Please read problem A first. The maximum score you can get by solving this problem B is 1, which will have almost no effect on your ranking.)\n\nBeginner's Guide\n\nLet's first write a program to calculate the score from a pair of input and output. You can know the total score by submitting your solution, or an official program to calculate a score is often provided for local evaluation as in this contest. Nevertheless, writing a score calculator by yourself is still useful to check your understanding of the problem specification. Moreover, the source code of the score calculator can often be reused for solving the problem or debugging your solution. So it is worthwhile to write a score calculator unless it is very complicated.\n\nProblem Statement\n\nYou will be given a contest schedule for D days.\nFor each d=1,2,\\ldots,D, calculate the satisfaction at the end of day d.\n\nInput\n\nInput is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\nt_1\nt_2\n\\vdots\nt_D\n\nThe constraints and generation methods for the input part are the same as those for Problem A.\n\nFor each d, t_d is an integer satisfying 1\\leq t_d \\leq 26, and your program is expected to work correctly for any value that meets the constraints.\n\nOutput\n\nLet v_d be the satisfaction at the end of day d.\nPrint D integers v_d to Standard Output in the following format:\n\nv_1\nv_2\n\\vdots\nv_D\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n1\n17\n13\n14\n13\n\nSample Output 1\n\n18398\n35037\n51140\n65837\n79325\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case.\n\nNext Step\n\nWe can build a solution (schedule) for this problem in the order of day 1, day 2, and so on. And for every partial solution we have built, we can calculate the goodness (satisfaction) by using the above score calculator. So we can construct the following algorithm: for each d=1,2,\\ldots,D, we select the contest type that maximizes the satisfaction at the end of day d. You may have already encountered this kind of \"greedy algorithms\" in algorithm contests such as ABC. Greedy algorithms can guarantee the optimality for several problems, but unfortunately, it doesn't ensure optimality for this problem. However, even if it does not ensure optimality, we can still obtain a reasonable solution in many cases. Let's go back to Problem A and implement the greedy algorithm by utilizing the score calculator you just implemented!\n\nGreedy methods can be applied to a variety of problems, are easy to implement, and often run relatively fast compared to other methods. Greedy is often the most powerful method when we need to process huge inputs.\nWe can further improve the score by changing the greedy selection criteria (evaluation function), keeping multiple candidates instead of focusing on one best partial solution (beam search), or using the output of greedy algorithms as an initial solution of other methods.\nFor more information, please refer to the editorial that will be published after the contest.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n1\n17\n13\n14\n13\n"}, "reference_outputs": ["18398\n35037\n51140\n65837\n79325\n"], "source_document_id": "p02619", "source_text": "(Please read problem A first. The maximum score you can get by solving this problem B is 1, which will have almost no effect on your ranking.)\n\nBeginner's Guide\n\nLet's first write a program to calculate the score from a pair of input and output. You can know the total score by submitting your solution, or an official program to calculate a score is often provided for local evaluation as in this contest. Nevertheless, writing a score calculator by yourself is still useful to check your understanding of the problem specification. Moreover, the source code of the score calculator can often be reused for solving the problem or debugging your solution. So it is worthwhile to write a score calculator unless it is very complicated.\n\nProblem Statement\n\nYou will be given a contest schedule for D days.\nFor each d=1,2,\\ldots,D, calculate the satisfaction at the end of day d.\n\nInput\n\nInput is given from Standard Input in the form of the input of Problem A followed by the output of Problem A.\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\nt_1\nt_2\n\\vdots\nt_D\n\nThe constraints and generation methods for the input part are the same as those for Problem A.\n\nFor each d, t_d is an integer satisfying 1\\leq t_d \\leq 26, and your program is expected to work correctly for any value that meets the constraints.\n\nOutput\n\nLet v_d be the satisfaction at the end of day d.\nPrint D integers v_d to Standard Output in the following format:\n\nv_1\nv_2\n\\vdots\nv_D\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n1\n17\n13\n14\n13\n\nSample Output 1\n\n18398\n35037\n51140\n65837\n79325\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case.\n\nNext Step\n\nWe can build a solution (schedule) for this problem in the order of day 1, day 2, and so on. And for every partial solution we have built, we can calculate the goodness (satisfaction) by using the above score calculator. So we can construct the following algorithm: for each d=1,2,\\ldots,D, we select the contest type that maximizes the satisfaction at the end of day d. You may have already encountered this kind of \"greedy algorithms\" in algorithm contests such as ABC. Greedy algorithms can guarantee the optimality for several problems, but unfortunately, it doesn't ensure optimality for this problem. However, even if it does not ensure optimality, we can still obtain a reasonable solution in many cases. Let's go back to Problem A and implement the greedy algorithm by utilizing the score calculator you just implemented!\n\nGreedy methods can be applied to a variety of problems, are easy to implement, and often run relatively fast compared to other methods. Greedy is often the most powerful method when we need to process huge inputs.\nWe can further improve the score by changing the greedy selection criteria (evaluation function), keeping multiple candidates instead of focusing on one best partial solution (beam search), or using the output of greedy algorithms as an initial solution of other methods.\nFor more information, please refer to the editorial that will be published after the contest.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 5916}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s622084974", "group_id": "codeNet:p02621", "input_text": "open Scanf\nopen Printf\n\nlet a = scanf \"%d\" (fun a -> a)\nlet () = printf \"%d\\n\" (a + a * a + a * a * a)\n", "language": "OCaml", "metadata": {"date": 1593306074, "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/s622084974.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s622084974", "user_id": "u809832909"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet a = scanf \"%d\" (fun a -> a)\nlet () = printf \"%d\\n\" (a + a * a + a * a * a)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 103, "cpu_time_ms": 5, "memory_kb": 3836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s054137015", "group_id": "codeNet:p02621", "input_text": "Scanf.scanf \"%d\" (fun a ->\n    Printf.printf \"%d\\n\" @@ a + a * a + a * a * a\n)", "language": "OCaml", "metadata": {"date": 1593306047, "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/s054137015.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s054137015", "user_id": "u342443598"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun a ->\n    Printf.printf \"%d\\n\" @@ a + a * a + a * a * a\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 7, "memory_kb": 3796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s653455659", "group_id": "codeNet:p02622", "input_text": "open Scanf\nopen Printf\n\nlet () =\n  let s,t = scanf \"%s %s\" (fun s t -> (s, t)) in\n  let s_length = String.length s in\n  let rec loop s t i =\n    if i > s_length -1 then 0\n    else if s.[i] <> t.[i] then 1 + loop s t (i + 1)\n                           else loop s t (i + 1)\n  in\n    printf \"%d\\n\" (loop s t 0)", "language": "OCaml", "metadata": {"date": 1596342844, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02622/input.txt", "sample_output_relpath": "derived/input_output/data/p02622/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02622/OCaml/s653455659.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s653455659", "user_id": "u272377260"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () =\n  let s,t = scanf \"%s %s\" (fun s t -> (s, t)) in\n  let s_length = String.length s in\n  let rec loop s t i =\n    if i > s_length -1 then 0\n    else if s.[i] <> t.[i] then 1 + loop s t (i + 1)\n                           else loop s t (i + 1)\n  in\n    printf \"%d\\n\" (loop s t 0)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 22, "memory_kb": 7856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s092938917", "group_id": "codeNet:p02627", "input_text": "let () =\n  let num = Array.make 100001 0 in\n  let sum = ref 0 in\n  let n = Scanf.scanf \"%d\\n\" @@ fun n -> n in\n  for i = 0 to n - 1 do\n    Scanf.scanf \"%d \" @@ fun d ->\n    num.(d) <- num.(d) + 1; sum := !sum + d\n  done;\n  Scanf.scanf \"%d\\n\" @@ fun q ->\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun b c ->\n    sum := !sum + (c - b) * num.(b); num.(c) <- num.(c) + num.(b); num.(b) <- 0;\n    Printf.printf \"%d\\n\" !sum\n  done;", "language": "OCaml", "metadata": {"date": 1593832822, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/OCaml/s092938917.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s092938917", "user_id": "u307426615"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "let () =\n  let num = Array.make 100001 0 in\n  let sum = ref 0 in\n  let n = Scanf.scanf \"%d\\n\" @@ fun n -> n in\n  for i = 0 to n - 1 do\n    Scanf.scanf \"%d \" @@ fun d ->\n    num.(d) <- num.(d) + 1; sum := !sum + d\n  done;\n  Scanf.scanf \"%d\\n\" @@ fun q ->\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun b c ->\n    sum := !sum + (c - b) * num.(b); num.(c) <- num.(c) + num.(b); num.(b) <- 0;\n    Printf.printf \"%d\\n\" !sum\n  done;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 4572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s261948934", "group_id": "codeNet:p02627", "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 s = scan \"%s\" id\n\nlet () =\n  if s = String.uppercase s then\n    Printf.printf \"A\\n\"\n  else\n    Printf.printf \"a\\n\"\n", "language": "OCaml", "metadata": {"date": 1593819597, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/OCaml/s261948934.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s261948934", "user_id": "u106804623"}, "prompt_components": {"gold_output": "A\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 s = scan \"%s\" id\n\nlet () =\n  if s = String.uppercase s then\n    Printf.printf \"A\\n\"\n  else\n    Printf.printf \"a\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1215, "cpu_time_ms": 7, "memory_kb": 5244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s636731641", "group_id": "codeNet:p02627", "input_text": "let () =\n  Scanf.scanf \"%s\\n\" @@ fun a ->\n  let b = (a = String.uppercase a) in\n  Printf.printf \"%s\\n\" (if b then \"A\" else \"a\")", "language": "OCaml", "metadata": {"date": 1593718648, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/OCaml/s636731641.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636731641", "user_id": "u307426615"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%s\\n\" @@ fun a ->\n  let b = (a = String.uppercase a) in\n  Printf.printf \"%s\\n\" (if b then \"A\" else \"a\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 9, "memory_kb": 3656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s278706294", "group_id": "codeNet:p02627", "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 putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule JunkList = 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\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 = JunkList\n\nmodule JunkArray = 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 = JunkArray\n\nmodule JunkString = 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 = JunkString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule JunkSortedSet = 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 = JunkSortedSet\n\nmodule JunkSortedMap  = 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 = JunkSortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule JunkIntArithmetic = struct\n\n  let rec power x e =\n    if e = 0 then x\n    else \n      let rec loop r x2 e' =\n        if e' = 0 then r\n        else if e' land 1 = 0 then loop r (x2 * x2) (e' lsr 1)\n        else loop (r * x2) (x2 * x2) (e' lsr 1)\n      in loop 1 x e\n\n  let rec powers_le_1000 x =\n    if x > 32 then [x]\n    else\n      L.init 9 (fun e -> power x (e + 1))\n      |> L.filter (fun y -> y < 1000)\n\n  let primes_le_1000 = [2;3;5;7;11;13;17;19;23;29;31;37;41;\n    43;47;53;59;61;67;71;73;79;83;89;97;101;\n    103;107;109;113;127;131;137;139;149;151;157;163;167;\n    173;179;181;191;193;197;199;211;223;227;229;233;239;\n    241;251;257;263;269;271;277;281;283;293;307;311;313;\n    317;331;337;347;349;353;359;367;373;379;383;389;397;\n    401;409;419;421;431;433;439;443;449;457;461;463;467;\n    479;487;491;499;503;509;521;523;541;547;557;563;569;\n    571;577;587;593;599;601;607;613;617;619;631;641;643;\n    647;653;659;661;673;677;683;691;701;709;719;727;733;\n    739;743;751;757;761;769;773;787;797;809;811;821;823;\n    827;829;839;853;857;859;863;877;881;883;887;907;911;\n    919;929;937;941;947;953;967;971;977;983;991;997]\n\n    let primes_and_powers_le_1000 =\n      [2;3;4;5;7;8;9;11;13;16;17;19;23;25;27;29;31;32;37;41;\n      43;47;49;53;59;61;64;67;71;73;79;81;83;89;97;\n      101;103;107;109;113;121;125;127;128;131;137;139;149;151;\n      157;163;167;169;173;179;181;191;193;197;199;211;223;227;\n      229;233;239;241;243;251;256;257;263;269;271;277;281;283;\n      289;293;307;311;313;317;331;337;343;347;349;353;359;361;\n      367;373;379;383;389;397;401;409;419;421;431;433;439;443;\n      449;457;461;463;467;479;487;491;499;503;509;512;521;523;\n      529;541;547;557;563;569;571;577;587;593;599;601;607;613;\n      617;619;625;631;641;643;647;653;659;661;673;677;683;691;\n      701;709;719;727;729;733;739;743;751;757;761;769;773;787;\n      797;809;811;821;823;827;829;839;841;853;857;859;863;877;\n      881;883;887;907;911;919;929;937;941;947;953;961;967;971;\n      977;983;991;997]\n\n  let factorize_with ps n =\n    let rec loop acc ps e n' =\n      if n' <= 1 then ([], n') \n      else\n        match ps with\n        | [] -> (acc, n')\n        | p::t ->\n          let r = n' mod p in\n          if r = 0 then (\n            if n' = p then ((p, e + 1) :: acc, 1)\n            else loop acc ps (e + 1) (n' / p)\n          ) else\n            loop (if e = 0 then acc else (p, e) :: acc) t 0 n'\n    in\n    let (fs, r) = loop [] ps 0 n in\n    (L.rev fs, r)\n\n  let factorize_le_million n =\n    factorize_with primes_le_1000 n\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \n\nend\n\nmodule N = JunkIntArithmetic\n\n\nmodule JunkMatrix = struct\n\n  type 'a t = { w : int; h : int; e : 'a array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let from_columns w h e0 elems =\n    let matr = make w h e0 in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e0 mat =\n    let matr = make w2 h2 e0 in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\nend\n\nmodule M = JunkMatrix\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule JunkLinearAlgebra (Fop : FieldOps) = struct\n\n  type t = Fop.elt M.t\n\n  let zero w h = M.make w h Fop.zero\n\n  let prod (mat1 : t) (mat2 : t) =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero (mat : t) =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) (mat : t) =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 (mat : t) =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule JunkGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = JunkGraph\n\nmodule JunkGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = JunkGraphAlgorithms (\n  struct\n    type t = int\n    let compare = compare\n    let default = 0\n  end)\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 _ =\n  let a = L.hd @@ s2cl @@ rds () in\n  puts @@ if Char.is_lowercase a then \"a\" else \"A\";\n\n();;\n", "language": "OCaml", "metadata": {"date": 1592788007, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/OCaml/s278706294.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278706294", "user_id": "u970139668"}, "prompt_components": {"gold_output": "A\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 putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule JunkList = 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\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 = JunkList\n\nmodule JunkArray = 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 = JunkArray\n\nmodule JunkString = 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 = JunkString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule JunkSortedSet = 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 = JunkSortedSet\n\nmodule JunkSortedMap  = 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 = JunkSortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule JunkIntArithmetic = struct\n\n  let rec power x e =\n    if e = 0 then x\n    else \n      let rec loop r x2 e' =\n        if e' = 0 then r\n        else if e' land 1 = 0 then loop r (x2 * x2) (e' lsr 1)\n        else loop (r * x2) (x2 * x2) (e' lsr 1)\n      in loop 1 x e\n\n  let rec powers_le_1000 x =\n    if x > 32 then [x]\n    else\n      L.init 9 (fun e -> power x (e + 1))\n      |> L.filter (fun y -> y < 1000)\n\n  let primes_le_1000 = [2;3;5;7;11;13;17;19;23;29;31;37;41;\n    43;47;53;59;61;67;71;73;79;83;89;97;101;\n    103;107;109;113;127;131;137;139;149;151;157;163;167;\n    173;179;181;191;193;197;199;211;223;227;229;233;239;\n    241;251;257;263;269;271;277;281;283;293;307;311;313;\n    317;331;337;347;349;353;359;367;373;379;383;389;397;\n    401;409;419;421;431;433;439;443;449;457;461;463;467;\n    479;487;491;499;503;509;521;523;541;547;557;563;569;\n    571;577;587;593;599;601;607;613;617;619;631;641;643;\n    647;653;659;661;673;677;683;691;701;709;719;727;733;\n    739;743;751;757;761;769;773;787;797;809;811;821;823;\n    827;829;839;853;857;859;863;877;881;883;887;907;911;\n    919;929;937;941;947;953;967;971;977;983;991;997]\n\n    let primes_and_powers_le_1000 =\n      [2;3;4;5;7;8;9;11;13;16;17;19;23;25;27;29;31;32;37;41;\n      43;47;49;53;59;61;64;67;71;73;79;81;83;89;97;\n      101;103;107;109;113;121;125;127;128;131;137;139;149;151;\n      157;163;167;169;173;179;181;191;193;197;199;211;223;227;\n      229;233;239;241;243;251;256;257;263;269;271;277;281;283;\n      289;293;307;311;313;317;331;337;343;347;349;353;359;361;\n      367;373;379;383;389;397;401;409;419;421;431;433;439;443;\n      449;457;461;463;467;479;487;491;499;503;509;512;521;523;\n      529;541;547;557;563;569;571;577;587;593;599;601;607;613;\n      617;619;625;631;641;643;647;653;659;661;673;677;683;691;\n      701;709;719;727;729;733;739;743;751;757;761;769;773;787;\n      797;809;811;821;823;827;829;839;841;853;857;859;863;877;\n      881;883;887;907;911;919;929;937;941;947;953;961;967;971;\n      977;983;991;997]\n\n  let factorize_with ps n =\n    let rec loop acc ps e n' =\n      if n' <= 1 then ([], n') \n      else\n        match ps with\n        | [] -> (acc, n')\n        | p::t ->\n          let r = n' mod p in\n          if r = 0 then (\n            if n' = p then ((p, e + 1) :: acc, 1)\n            else loop acc ps (e + 1) (n' / p)\n          ) else\n            loop (if e = 0 then acc else (p, e) :: acc) t 0 n'\n    in\n    let (fs, r) = loop [] ps 0 n in\n    (L.rev fs, r)\n\n  let factorize_le_million n =\n    factorize_with primes_le_1000 n\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \n\nend\n\nmodule N = JunkIntArithmetic\n\n\nmodule JunkMatrix = struct\n\n  type 'a t = { w : int; h : int; e : 'a array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let from_columns w h e0 elems =\n    let matr = make w h e0 in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e0 mat =\n    let matr = make w2 h2 e0 in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\nend\n\nmodule M = JunkMatrix\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule JunkLinearAlgebra (Fop : FieldOps) = struct\n\n  type t = Fop.elt M.t\n\n  let zero w h = M.make w h Fop.zero\n\n  let prod (mat1 : t) (mat2 : t) =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero (mat : t) =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) (mat : t) =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 (mat : t) =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule JunkGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = JunkGraph\n\nmodule JunkGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = JunkGraphAlgorithms (\n  struct\n    type t = int\n    let compare = compare\n    let default = 0\n  end)\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 _ =\n  let a = L.hd @@ s2cl @@ rds () in\n  puts @@ if Char.is_lowercase a then \"a\" else \"A\";\n\n();;\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14354, "cpu_time_ms": 7, "memory_kb": 5536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s535990349", "group_id": "codeNet:p02627", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet ch = Scanf.sscanf (read_line ()) \"%c\" ( fun ch -> ch)\n\nlet () =\n        (\n                if Char.is_lowercase ch then\n                        'a'\n                else\n                        'A'\n        ) |> Printf.printf \"%c\\n\"\n", "language": "OCaml", "metadata": {"date": 1592787859, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/OCaml/s535990349.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s535990349", "user_id": "u280335093"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet ch = Scanf.sscanf (read_line ()) \"%c\" ( fun ch -> ch)\n\nlet () =\n        (\n                if Char.is_lowercase ch then\n                        'a'\n                else\n                        'A'\n        ) |> Printf.printf \"%c\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 5292}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s284026033", "group_id": "codeNet:p02628", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let array = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  Array.sort compare array;\n  let k_array = Array.sub array 0 k in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 k_array \n    ", "language": "OCaml", "metadata": {"date": 1592957291, "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/s284026033.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284026033", "user_id": "u052332717"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let array = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  Array.sort compare array;\n  let k_array = Array.sub array 0 k in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 k_array \n    ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 7, "memory_kb": 4032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s712393905", "group_id": "codeNet:p02629", "input_text": "let () =\n  let soc = fun n -> Char.escaped (char_of_int (97+n)) in\n  let rec check n m l = if n <= m then (n-1, l-1) else check (n-m) (m*26) (l+1) in\n  let rec make (n, k) =\n    if k = 0 && n = 0 then soc n\n    else if k = 0 then soc n\n    else\n      let y = int_of_float (26. ** (float_of_int k)) in\n      let x, m = n / y, n mod y in soc x ^ make (m, (k-1)) in\n  Scanf.scanf \"%d\\n\" @@ fun n -> Printf.printf \"%s\\n\" (make (check n 26 1))", "language": "OCaml", "metadata": {"date": 1593814903, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02629.html", "problem_id": "p02629", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02629/input.txt", "sample_output_relpath": "derived/input_output/data/p02629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02629/OCaml/s712393905.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s712393905", "user_id": "u307426615"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "let () =\n  let soc = fun n -> Char.escaped (char_of_int (97+n)) in\n  let rec check n m l = if n <= m then (n-1, l-1) else check (n-m) (m*26) (l+1) in\n  let rec make (n, k) =\n    if k = 0 && n = 0 then soc n\n    else if k = 0 then soc n\n    else\n      let y = int_of_float (26. ** (float_of_int k)) in\n      let x, m = n / y, n mod y in soc x ^ make (m, (k-1)) in\n  Scanf.scanf \"%d\\n\" @@ fun n -> Printf.printf \"%s\\n\" (make (check n 26 1))", "problem_context": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "sample_input": "2\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02629", "source_text": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 12, "memory_kb": 4152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s280451061", "group_id": "codeNet:p02629", "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 \"%Ld\" id\n\nlet () =\n  let s = \"zabcdefghijklmnopqrstuvwxy\" in\n  let rec aux n acc =\n    if Int64.equal n 0L then String.of_list acc\n    else\n      let i = Int64.to_int @@ Int64.modulo n 26L in\n      if i = 0 then\n        aux (Int64.pred (Int64.div n 26L))\n          (String.get s i::acc)\n      else\n        aux (Int64.div n 26L)\n          (String.get s i::acc)\n  in\n  Printf.printf \"%s\\n\" @@ aux n []\n", "language": "OCaml", "metadata": {"date": 1592790792, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02629.html", "problem_id": "p02629", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02629/input.txt", "sample_output_relpath": "derived/input_output/data/p02629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02629/OCaml/s280451061.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s280451061", "user_id": "u802614675"}, "prompt_components": {"gold_output": "b\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 \"%Ld\" id\n\nlet () =\n  let s = \"zabcdefghijklmnopqrstuvwxy\" in\n  let rec aux n acc =\n    if Int64.equal n 0L then String.of_list acc\n    else\n      let i = Int64.to_int @@ Int64.modulo n 26L in\n      if i = 0 then\n        aux (Int64.pred (Int64.div n 26L))\n          (String.get s i::acc)\n      else\n        aux (Int64.div n 26L)\n          (String.get s i::acc)\n  in\n  Printf.printf \"%s\\n\" @@ aux n []\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "sample_input": "2\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02629", "source_text": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2565, "cpu_time_ms": 9, "memory_kb": 5328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943366879", "group_id": "codeNet:p02630", "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 putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule JunkList = 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\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 = JunkList\n\nmodule JunkArray = 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 = JunkArray\n\nmodule JunkString = 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 = JunkString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule JunkSortedSet = 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 = JunkSortedSet\n\nmodule JunkSortedMap  = 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 = JunkSortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule JunkIntArithmetic = struct\n\n  let rec power x e =\n    if e = 0 then x\n    else \n      let rec loop r x2 e' =\n        if e' = 0 then r\n        else if e' land 1 = 0 then loop r (x2 * x2) (e' lsr 1)\n        else loop (r * x2) (x2 * x2) (e' lsr 1)\n      in loop 1 x e\n\n  let rec powers_le_1000 x =\n    if x > 32 then [x]\n    else\n      L.init 9 (fun e -> power x (e + 1))\n      |> L.filter (fun y -> y < 1000)\n\n  let primes_le_1000 = [2;3;5;7;11;13;17;19;23;29;31;37;41;\n    43;47;53;59;61;67;71;73;79;83;89;97;101;\n    103;107;109;113;127;131;137;139;149;151;157;163;167;\n    173;179;181;191;193;197;199;211;223;227;229;233;239;\n    241;251;257;263;269;271;277;281;283;293;307;311;313;\n    317;331;337;347;349;353;359;367;373;379;383;389;397;\n    401;409;419;421;431;433;439;443;449;457;461;463;467;\n    479;487;491;499;503;509;521;523;541;547;557;563;569;\n    571;577;587;593;599;601;607;613;617;619;631;641;643;\n    647;653;659;661;673;677;683;691;701;709;719;727;733;\n    739;743;751;757;761;769;773;787;797;809;811;821;823;\n    827;829;839;853;857;859;863;877;881;883;887;907;911;\n    919;929;937;941;947;953;967;971;977;983;991;997]\n\n    let primes_and_powers_le_1000 =\n      [2;3;4;5;7;8;9;11;13;16;17;19;23;25;27;29;31;32;37;41;\n      43;47;49;53;59;61;64;67;71;73;79;81;83;89;97;\n      101;103;107;109;113;121;125;127;128;131;137;139;149;151;\n      157;163;167;169;173;179;181;191;193;197;199;211;223;227;\n      229;233;239;241;243;251;256;257;263;269;271;277;281;283;\n      289;293;307;311;313;317;331;337;343;347;349;353;359;361;\n      367;373;379;383;389;397;401;409;419;421;431;433;439;443;\n      449;457;461;463;467;479;487;491;499;503;509;512;521;523;\n      529;541;547;557;563;569;571;577;587;593;599;601;607;613;\n      617;619;625;631;641;643;647;653;659;661;673;677;683;691;\n      701;709;719;727;729;733;739;743;751;757;761;769;773;787;\n      797;809;811;821;823;827;829;839;841;853;857;859;863;877;\n      881;883;887;907;911;919;929;937;941;947;953;961;967;971;\n      977;983;991;997]\n\n  let factorize_with ps n =\n    let rec loop acc ps e n' =\n      if n' <= 1 then ([], n') \n      else\n        match ps with\n        | [] -> (acc, n')\n        | p::t ->\n          let r = n' mod p in\n          if r = 0 then (\n            if n' = p then ((p, e + 1) :: acc, 1)\n            else loop acc ps (e + 1) (n' / p)\n          ) else\n            loop (if e = 0 then acc else (p, e) :: acc) t 0 n'\n    in\n    let (fs, r) = loop [] ps 0 n in\n    (L.rev fs, r)\n\n  let factorize_le_million n =\n    factorize_with primes_le_1000 n\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \n\nend\n\nmodule N = JunkIntArithmetic\n\n\nmodule JunkMatrix = struct\n\n  type 'a t = { w : int; h : int; e : 'a array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let from_columns w h e0 elems =\n    let matr = make w h e0 in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e0 mat =\n    let matr = make w2 h2 e0 in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\nend\n\nmodule M = JunkMatrix\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule JunkLinearAlgebra (Fop : FieldOps) = struct\n\n  type t = Fop.elt M.t\n\n  let zero w h = M.make w h Fop.zero\n\n  let prod (mat1 : t) (mat2 : t) =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero (mat : t) =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) (mat : t) =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 (mat : t) =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule JunkGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = JunkGraph\n\nmodule JunkGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = JunkGraphAlgorithms (\n  struct\n    type t = int\n    let compare = compare\n    let default = 0\n  end)\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 _ =\n  let n = rdi () in\n  let ass = rdhi () in\n  let q = rdi () in\n  let bcs = rdvi2 q in\n\n  let rec make_cnt cnt = function\n  | [] -> cnt\n  | h::t -> cnt.(h) <- cnt.(h) + 1; make_cnt cnt t\n  in\n\n  let cnt = make_cnt (Array.make 100001 0) ass in\n\n  let rec replace = function\n  | [] -> ()\n  | h::t ->\n    let (b, c) = h in\n    let pb = cnt.(b) and pc = cnt.(c) in\n    cnt.(c) <- pc + pb;\n    cnt.(b) <- 0;\n    let sum = A.sum @@ A.mapi (fun i x -> x * i) cnt in\n    puti sum;\n    replace t\n  in\n  \n  replace bcs;\n\n();;\n", "language": "OCaml", "metadata": {"date": 1592792996, "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/s943366879.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s943366879", "user_id": "u970139668"}, "prompt_components": {"gold_output": "11\n12\n16\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 putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule JunkList = 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\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 = JunkList\n\nmodule JunkArray = 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 = JunkArray\n\nmodule JunkString = 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 = JunkString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule JunkSortedSet = 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 = JunkSortedSet\n\nmodule JunkSortedMap  = 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 = JunkSortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule JunkIntArithmetic = struct\n\n  let rec power x e =\n    if e = 0 then x\n    else \n      let rec loop r x2 e' =\n        if e' = 0 then r\n        else if e' land 1 = 0 then loop r (x2 * x2) (e' lsr 1)\n        else loop (r * x2) (x2 * x2) (e' lsr 1)\n      in loop 1 x e\n\n  let rec powers_le_1000 x =\n    if x > 32 then [x]\n    else\n      L.init 9 (fun e -> power x (e + 1))\n      |> L.filter (fun y -> y < 1000)\n\n  let primes_le_1000 = [2;3;5;7;11;13;17;19;23;29;31;37;41;\n    43;47;53;59;61;67;71;73;79;83;89;97;101;\n    103;107;109;113;127;131;137;139;149;151;157;163;167;\n    173;179;181;191;193;197;199;211;223;227;229;233;239;\n    241;251;257;263;269;271;277;281;283;293;307;311;313;\n    317;331;337;347;349;353;359;367;373;379;383;389;397;\n    401;409;419;421;431;433;439;443;449;457;461;463;467;\n    479;487;491;499;503;509;521;523;541;547;557;563;569;\n    571;577;587;593;599;601;607;613;617;619;631;641;643;\n    647;653;659;661;673;677;683;691;701;709;719;727;733;\n    739;743;751;757;761;769;773;787;797;809;811;821;823;\n    827;829;839;853;857;859;863;877;881;883;887;907;911;\n    919;929;937;941;947;953;967;971;977;983;991;997]\n\n    let primes_and_powers_le_1000 =\n      [2;3;4;5;7;8;9;11;13;16;17;19;23;25;27;29;31;32;37;41;\n      43;47;49;53;59;61;64;67;71;73;79;81;83;89;97;\n      101;103;107;109;113;121;125;127;128;131;137;139;149;151;\n      157;163;167;169;173;179;181;191;193;197;199;211;223;227;\n      229;233;239;241;243;251;256;257;263;269;271;277;281;283;\n      289;293;307;311;313;317;331;337;343;347;349;353;359;361;\n      367;373;379;383;389;397;401;409;419;421;431;433;439;443;\n      449;457;461;463;467;479;487;491;499;503;509;512;521;523;\n      529;541;547;557;563;569;571;577;587;593;599;601;607;613;\n      617;619;625;631;641;643;647;653;659;661;673;677;683;691;\n      701;709;719;727;729;733;739;743;751;757;761;769;773;787;\n      797;809;811;821;823;827;829;839;841;853;857;859;863;877;\n      881;883;887;907;911;919;929;937;941;947;953;961;967;971;\n      977;983;991;997]\n\n  let factorize_with ps n =\n    let rec loop acc ps e n' =\n      if n' <= 1 then ([], n') \n      else\n        match ps with\n        | [] -> (acc, n')\n        | p::t ->\n          let r = n' mod p in\n          if r = 0 then (\n            if n' = p then ((p, e + 1) :: acc, 1)\n            else loop acc ps (e + 1) (n' / p)\n          ) else\n            loop (if e = 0 then acc else (p, e) :: acc) t 0 n'\n    in\n    let (fs, r) = loop [] ps 0 n in\n    (L.rev fs, r)\n\n  let factorize_le_million n =\n    factorize_with primes_le_1000 n\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \n\nend\n\nmodule N = JunkIntArithmetic\n\n\nmodule JunkMatrix = struct\n\n  type 'a t = { w : int; h : int; e : 'a array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let from_columns w h e0 elems =\n    let matr = make w h e0 in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e0 mat =\n    let matr = make w2 h2 e0 in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\nend\n\nmodule M = JunkMatrix\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule JunkLinearAlgebra (Fop : FieldOps) = struct\n\n  type t = Fop.elt M.t\n\n  let zero w h = M.make w h Fop.zero\n\n  let prod (mat1 : t) (mat2 : t) =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero (mat : t) =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) (mat : t) =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 (mat : t) =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule JunkGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = JunkGraph\n\nmodule JunkGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = JunkGraphAlgorithms (\n  struct\n    type t = int\n    let compare = compare\n    let default = 0\n  end)\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 _ =\n  let n = rdi () in\n  let ass = rdhi () in\n  let q = rdi () in\n  let bcs = rdvi2 q in\n\n  let rec make_cnt cnt = function\n  | [] -> cnt\n  | h::t -> cnt.(h) <- cnt.(h) + 1; make_cnt cnt t\n  in\n\n  let cnt = make_cnt (Array.make 100001 0) ass in\n\n  let rec replace = function\n  | [] -> ()\n  | h::t ->\n    let (b, c) = h in\n    let pb = cnt.(b) and pc = cnt.(c) in\n    cnt.(c) <- pc + pb;\n    cnt.(b) <- 0;\n    let sum = A.sum @@ A.mapi (fun i x -> x * i) cnt in\n    puti sum;\n    replace t\n  in\n  \n  replace bcs;\n\n();;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14775, "cpu_time_ms": 2207, "memory_kb": 41748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s157321884", "group_id": "codeNet:p02640", "input_text": "open Base\nopen Stdio\n\nlet () =\n  let (x, y) = Caml.Scanf.scanf \"%d %d\" (fun x y -> x, y) in\n  let ans = ref \"No\" in\n  for i = 0 to x do\n    let a = i in\n    let b = x - i in\n    if phys_equal (2 * a + 4 * b) y\n    then ans := \"Yes\"\n  done;\n  print_endline !ans;\n", "language": "OCaml", "metadata": {"date": 1593706954, "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/s157321884.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s157321884", "user_id": "u368970787"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Base\nopen Stdio\n\nlet () =\n  let (x, y) = Caml.Scanf.scanf \"%d %d\" (fun x y -> x, y) in\n  let ans = ref \"No\" in\n  for i = 0 to x do\n    let a = i in\n    let b = x - i in\n    if phys_equal (2 * a + 4 * b) y\n    then ans := \"Yes\"\n  done;\n  print_endline !ans;\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s057447536", "group_id": "codeNet:p02640", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc170/tasks/abc170_b\n * brute force *)\nlet solve x y =\n    let a, b = 4*x - y, y - 2*x in\n    if a mod 2 = 0 && b mod 2 = 0 && a >= 0 && b >= 0 then \"Yes\" else \"No\"\n\nlet main =\n    Scanf.scanf \"%d %d\" solve |> Printf.printf \"%s\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1593399395, "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/s057447536.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s057447536", "user_id": "u737840172"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc170/tasks/abc170_b\n * brute force *)\nlet solve x y =\n    let a, b = 4*x - y, y - 2*x in\n    if a mod 2 = 0 && b mod 2 = 0 && a >= 0 && b >= 0 then \"Yes\" else \"No\"\n\nlet main =\n    Scanf.scanf \"%d %d\" solve |> Printf.printf \"%s\\n\"\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 9, "memory_kb": 3660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s203925968", "group_id": "codeNet:p02641", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun x n ->\n  let ps = List.init n @@ fun _ -> Scanf.scanf \"%d \" Fun.id in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun y y' ->\n    if abs (y - x) <= abs (y' - x) then y else y') 0 @@\n  List.filter (fun y -> List.for_all (( <> ) y) ps) @@\n  List.init 102 Fun.id\n\n", "language": "OCaml", "metadata": {"date": 1592188950, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/OCaml/s203925968.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203925968", "user_id": "u504158101"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun x n ->\n  let ps = List.init n @@ fun _ -> Scanf.scanf \"%d \" Fun.id in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun y y' ->\n    if abs (y - x) <= abs (y' - x) then y else y') 0 @@\n  List.filter (fun y -> List.for_all (( <> ) y) ps) @@\n  List.init 102 Fun.id\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 3832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s960646344", "group_id": "codeNet:p02641", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet x, n = Scanf.sscanf (read_line ()) \"%d %d\" ( fun x n -> x, n)\nlet lst = Str.split (Str.regexp \" \") (read_line ())\n          |> List.map int_of_string\n\nlet () = \n        let (ans, _) = \n                (\n                        if lst = [] then\n                                (x, 0)\n                        else\n                                let set = \n                                        (\n                                                let max = List.max lst in\n                                                let pset = List.range 0 `To max\n                                                           |> Set.of_list in\n                                                let sset = Set.of_list lst in\n                                                        Set.diff pset sset \n                                        ) in\n                                let lst = Set.to_list set in\n                                        List.map (fun elmnt -> (elmnt, abs (elmnt - x))) lst \n                                        |> List.sort (fun (el1, diff1) (el2, diff2) -> compare diff1 diff2)\n                                        |> List.hd\n                ) in\n                Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1592185324, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/OCaml/s960646344.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s960646344", "user_id": "u280335093"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet x, n = Scanf.sscanf (read_line ()) \"%d %d\" ( fun x n -> x, n)\nlet lst = Str.split (Str.regexp \" \") (read_line ())\n          |> List.map int_of_string\n\nlet () = \n        let (ans, _) = \n                (\n                        if lst = [] then\n                                (x, 0)\n                        else\n                                let set = \n                                        (\n                                                let max = List.max lst in\n                                                let pset = List.range 0 `To max\n                                                           |> Set.of_list in\n                                                let sset = Set.of_list lst in\n                                                        Set.diff pset sset \n                                        ) in\n                                let lst = Set.to_list set in\n                                        List.map (fun elmnt -> (elmnt, abs (elmnt - x))) lst \n                                        |> List.sort (fun (el1, diff1) (el2, diff2) -> compare diff1 diff2)\n                                        |> List.hd\n                ) in\n                Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1293, "cpu_time_ms": 8, "memory_kb": 5488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s900142289", "group_id": "codeNet:p02641", "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 = float_of_int\nlet i2f = int_of_float\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule ToyList = 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 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = ToyList\n\nmodule ToyArray = 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  (* 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 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 *)\nend\n\nmodule A = ToyArray\n\nmodule ToyString = 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 = ToyString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule ToySortedSet = 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 = ToySortedSet\n\nmodule ToySortedMap  = 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 = ToySortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule ToyIntArithmetic = struct\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \nend\n\nmodule N = ToyIntArithmetic\n\n\nmodule ToyMatrix = struct\n\n  type 'a t = { w : int; h : int; e : 'a array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let from_columns w h e0 elems =\n    let matr = make w h e0 in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e0 mat =\n    let matr = make w2 h2 e0 in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\nend\n\nmodule M = ToyMatrix\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule ToyLinearAlgebra (Fop : FieldOps) = struct\n\n  type t = Fop.elt M.t\n\n  let zero w h = M.make w h Fop.zero\n\n  let prod (mat1 : t) (mat2 : t) =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero (mat : t) =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) (mat : t) =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 (mat : t) =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule ToyGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = ToyGraph\n\nmodule ToyGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = ToyGraphAlgorithms (\n  struct\n    type t = int\n    let compare = compare\n    let default = 0\n  end)\n\nlet _ =\n  let (x, n) = rdi2 () in\n  if n = 0 then (ignore @@ rds (); puti x)\n  else (\n    let ps = Ss.of_list @@ rdhi () in\n    let nps = L.range 0 `To 101 |> L.filter (fun z -> Ss.nmem z ps) in\n    let difs = nps |> L.map (fun z -> (abs (x - z), z)) in\n    let (_, p) = difs\n      |> L.sort (fun (a, _) (b, _) -> compare a b)\n      |> L.hd\n    in\n    puti p)\n;;\n", "language": "OCaml", "metadata": {"date": 1592184789, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/OCaml/s900142289.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900142289", "user_id": "u970139668"}, "prompt_components": {"gold_output": "8\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 = float_of_int\nlet i2f = int_of_float\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule ToyList = 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 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = ToyList\n\nmodule ToyArray = 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  (* 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 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 *)\nend\n\nmodule A = ToyArray\n\nmodule ToyString = 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 = ToyString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule ToySortedSet = 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 = ToySortedSet\n\nmodule ToySortedMap  = 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 = ToySortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule ToyIntArithmetic = struct\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \nend\n\nmodule N = ToyIntArithmetic\n\n\nmodule ToyMatrix = struct\n\n  type 'a t = { w : int; h : int; e : 'a array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let from_columns w h e0 elems =\n    let matr = make w h e0 in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e0 mat =\n    let matr = make w2 h2 e0 in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\nend\n\nmodule M = ToyMatrix\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule ToyLinearAlgebra (Fop : FieldOps) = struct\n\n  type t = Fop.elt M.t\n\n  let zero w h = M.make w h Fop.zero\n\n  let prod (mat1 : t) (mat2 : t) =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero (mat : t) =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) (mat : t) =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 (mat : t) =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule ToyGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = ToyGraph\n\nmodule ToyGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = ToyGraphAlgorithms (\n  struct\n    type t = int\n    let compare = compare\n    let default = 0\n  end)\n\nlet _ =\n  let (x, n) = rdi2 () in\n  if n = 0 then (ignore @@ rds (); puti x)\n  else (\n    let ps = Ss.of_list @@ rdhi () in\n    let nps = L.range 0 `To 101 |> L.filter (fun z -> Ss.nmem z ps) in\n    let difs = nps |> L.map (fun z -> (abs (x - z), z)) in\n    let (_, p) = difs\n      |> L.sort (fun (a, _) (b, _) -> compare a b)\n      |> L.hd\n    in\n    puti p)\n;;\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 11529, "cpu_time_ms": 7, "memory_kb": 5564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s582149305", "group_id": "codeNet:p02641", "input_text": "let ($) f g = fun x -> g (f x)\nlet split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet (x, n) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun x n -> (x, n)\nlet p = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet () =\n  Printf.printf \"%d\\n\" @@ \n    if n = 0 then x\n    else Array.init 102 (fun i -> i - 1)\n      |> Array.to_list\n      |> List.filter (fun i -> not (List.mem i p))\n      (* |> (fun acc -> List.iter (Printf.printf \"%d \") acc; acc) *)\n      |> List.map (fun i -> (abs (i - x), i))\n      |> List.sort compare\n      |> (List.hd $ snd)", "language": "OCaml", "metadata": {"date": 1592183625, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/OCaml/s582149305.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s582149305", "user_id": "u811309788"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let ($) f g = fun x -> g (f x)\nlet split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet (x, n) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun x n -> (x, n)\nlet p = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet () =\n  Printf.printf \"%d\\n\" @@ \n    if n = 0 then x\n    else Array.init 102 (fun i -> i - 1)\n      |> Array.to_list\n      |> List.filter (fun i -> not (List.mem i p))\n      (* |> (fun acc -> List.iter (Printf.printf \"%d \") acc; acc) *)\n      |> List.map (fun i -> (abs (i - x), i))\n      |> List.sort compare\n      |> (List.hd $ snd)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 580, "cpu_time_ms": 3, "memory_kb": 3880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s437517448", "group_id": "codeNet:p02641", "input_text": "open Batteries\nlet x, n = Scanf.sscanf (read_line()) \"%d %d\" (fun  x n-> x ,n)\nlet p_ = read_line ()\nlet p = (if p_ = \"\" then [] else p_ |> String.split_on_char ' ' |> List.map int_of_string)\nlet rec loop i =\n  if List.mem (x - i) p then \n  if List.mem (x + i) p then (loop (i+1))\n  else (x + i)\n  else (x - i)\nlet _ = Printf.printf \"%d\\n\" @@ loop 0", "language": "OCaml", "metadata": {"date": 1592183478, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/OCaml/s437517448.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437517448", "user_id": "u511870776"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "open Batteries\nlet x, n = Scanf.sscanf (read_line()) \"%d %d\" (fun  x n-> x ,n)\nlet p_ = read_line ()\nlet p = (if p_ = \"\" then [] else p_ |> String.split_on_char ' ' |> List.map int_of_string)\nlet rec loop i =\n  if List.mem (x - i) p then \n  if List.mem (x + i) p then (loop (i+1))\n  else (x + i)\n  else (x - i)\nlet _ = Printf.printf \"%d\\n\" @@ loop 0", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 8, "memory_kb": 5432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s647620114", "group_id": "codeNet:p02645", "input_text": "let () =\n  Scanf.scanf \"%s\\n\" @@ fun s ->\n  Printf.printf \"%s\\n\" (String.sub s 0 3)", "language": "OCaml", "metadata": {"date": 1593798662, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02645.html", "problem_id": "p02645", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02645/input.txt", "sample_output_relpath": "derived/input_output/data/p02645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02645/OCaml/s647620114.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s647620114", "user_id": "u307426615"}, "prompt_components": {"gold_output": "tak\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%s\\n\" @@ fun s ->\n  Printf.printf \"%s\\n\" (String.sub s 0 3)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "sample_input": "takahashi\n"}, "reference_outputs": ["tak\n"], "source_document_id": "p02645", "source_text": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s040714323", "group_id": "codeNet:p02647", "input_text": "open Batteries\nlet n, k = Scanf.sscanf (read_line()) \"%d %d\" (fun n k -> n,k)\nlet a = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\n\n\nlet rec main_loop i dp =\n  if i >= n then print_string \"\\n\" else (\n    Printf.printf \"%d \" dp.(i); \n    main_loop (i+1) dp\n  )\n\nlet rec k_loop l a_ =\n  if l >= k then a_ else begin\n  let dp = Array.init n @@ fun _ -> 0 in\n  let rec do_lamp lamp =\n  for i = lamp - a_.(lamp) to lamp + a_.(lamp) do\n    if i < 0 || i >= 5 then () else (\n      dp.(i) <- dp.(i) + 1\n    )\n  done in\n\n  let rec loop i =\n  if i >= n then () else (\n    do_lamp i; loop (i+1)\n  )\n  in loop 0; k_loop (l+1) dp\n  end\n\nlet dp1 = k_loop 0 a\n\nlet _ = main_loop 0 dp1", "language": "OCaml", "metadata": {"date": 1592098284, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02647.html", "problem_id": "p02647", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02647/input.txt", "sample_output_relpath": "derived/input_output/data/p02647/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02647/OCaml/s040714323.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s040714323", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1 2 2 1 2\n", "input_to_evaluate": "open Batteries\nlet n, k = Scanf.sscanf (read_line()) \"%d %d\" (fun n k -> n,k)\nlet a = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\n\n\nlet rec main_loop i dp =\n  if i >= n then print_string \"\\n\" else (\n    Printf.printf \"%d \" dp.(i); \n    main_loop (i+1) dp\n  )\n\nlet rec k_loop l a_ =\n  if l >= k then a_ else begin\n  let dp = Array.init n @@ fun _ -> 0 in\n  let rec do_lamp lamp =\n  for i = lamp - a_.(lamp) to lamp + a_.(lamp) do\n    if i < 0 || i >= 5 then () else (\n      dp.(i) <- dp.(i) + 1\n    )\n  done in\n\n  let rec loop i =\n  if i >= n then () else (\n    do_lamp i; loop (i+1)\n  )\n  in loop 0; k_loop (l+1) dp\n  end\n\nlet dp1 = k_loop 0 a\n\nlet _ = main_loop 0 dp1", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "sample_input": "5 1\n1 0 0 1 0\n"}, "reference_outputs": ["1 2 2 1 2\n"], "source_document_id": "p02647", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 681, "cpu_time_ms": 2206, "memory_kb": 46092}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s344775651", "group_id": "codeNet:p02648", "input_text": "open Batteries\nlet n = read_int ()\nlet dp = Array.init n @@ fun _ -> [|0; 0|]\nlet rec vw_loop i =\n  if i >= n then () else (\n    Scanf.sscanf (read_line()) \"%d %d\" (fun v w -> \n      dp.(i) <- [|v; w|]\n    ); vw_loop (i+1)\n  )\nlet _ = vw_loop 0\nlet dp2 = Array.init (n+1) @@ fun _ -> []\nlet rec dp_loop i =\n  if i >= n then () else (\n    if i = 0 then (dp2.(i) <- dp.(i) :: dp2.(i); dp_loop (i+1)) else (\n      dp2.(i) <- dp.(i) :: dp2.(i / 2); dp_loop (i+1)\n    )\n  )\nlet _ = dp_loop 0\nlet q = read_int ()\n\n(* ここからナップザック *)\nlet nap items l =\n(* 価値；重さ*)\n  let n_ = Array.length items in\n  let nap_dp = Array.init (l+1) @@ fun _ -> 0 in\n  for i = 0 to (n_-1) do\n    let rec w_loop w =\n      if w < 0 then () else (\n        if w - items.(i).(1) >= 0 then (\n          nap_dp.(w) <- max (nap_dp.(w)) (nap_dp.(w - items.(i).(1)) + items.(i).(0));\n          w_loop (w-1)\n        ) else w_loop (w-1)\n      ) in w_loop l\n  done; nap_dp.(l)\n  \n\n(* nap [|[|3;2|];[|2;1|];[|6;3|];[|1;2|];[|3;1|];[|85;5|]|] 9;; *)\n\nlet rec q_loop i =\n  if i >= q then () else (\n    Scanf.sscanf (read_line()) \"%d %d\" (fun v l -> \n      Printf.printf \"%d\\n\" @@ nap (Array.of_list dp2.(v-1)) l\n    ); q_loop (i+1)\n  )\n\nlet _ = q_loop 0", "language": "OCaml", "metadata": {"date": 1592102623, "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/s344775651.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s344775651", "user_id": "u511870776"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "open Batteries\nlet n = read_int ()\nlet dp = Array.init n @@ fun _ -> [|0; 0|]\nlet rec vw_loop i =\n  if i >= n then () else (\n    Scanf.sscanf (read_line()) \"%d %d\" (fun v w -> \n      dp.(i) <- [|v; w|]\n    ); vw_loop (i+1)\n  )\nlet _ = vw_loop 0\nlet dp2 = Array.init (n+1) @@ fun _ -> []\nlet rec dp_loop i =\n  if i >= n then () else (\n    if i = 0 then (dp2.(i) <- dp.(i) :: dp2.(i); dp_loop (i+1)) else (\n      dp2.(i) <- dp.(i) :: dp2.(i / 2); dp_loop (i+1)\n    )\n  )\nlet _ = dp_loop 0\nlet q = read_int ()\n\n(* ここからナップザック *)\nlet nap items l =\n(* 価値；重さ*)\n  let n_ = Array.length items in\n  let nap_dp = Array.init (l+1) @@ fun _ -> 0 in\n  for i = 0 to (n_-1) do\n    let rec w_loop w =\n      if w < 0 then () else (\n        if w - items.(i).(1) >= 0 then (\n          nap_dp.(w) <- max (nap_dp.(w)) (nap_dp.(w - items.(i).(1)) + items.(i).(0));\n          w_loop (w-1)\n        ) else w_loop (w-1)\n      ) in w_loop l\n  done; nap_dp.(l)\n  \n\n(* nap [|[|3;2|];[|2;1|];[|6;3|];[|1;2|];[|3;1|];[|85;5|]|] 9;; *)\n\nlet rec q_loop i =\n  if i >= q then () else (\n    Scanf.sscanf (read_line()) \"%d %d\" (fun v l -> \n      Printf.printf \"%d\\n\" @@ nap (Array.of_list dp2.(v-1)) l\n    ); q_loop (i+1)\n  )\n\nlet _ = q_loop 0", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1235, "cpu_time_ms": 3310, "memory_kb": 64952}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s969811522", "group_id": "codeNet:p02657", "input_text": "open Scanf\nopen Printf\nopen Big_int\n\nlet multiplication lst =\n  let rec loop total l = match l with\n      [] -> total\n    | first :: rest -> if gt_big_int (mult_big_int (big_int_of_int first) (big_int_of_int total))\n                                     (big_int_of_int 1_000_000_000_000_000_000) then -1\n                       else loop (first * total) rest\n  in loop 1 lst\n\nlet n = sscanf (read_line ()) \"%d\" (fun n -> n)\nlet a_list = List.map (fun n -> int_of_string n) (String.split_on_char ' ' (read_line ()))\nlet () = printf \"%d\\n\" (multiplication a_list)", "language": "OCaml", "metadata": {"date": 1596631892, "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/s969811522.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s969811522", "user_id": "u272377260"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Scanf\nopen Printf\nopen Big_int\n\nlet multiplication lst =\n  let rec loop total l = match l with\n      [] -> total\n    | first :: rest -> if gt_big_int (mult_big_int (big_int_of_int first) (big_int_of_int total))\n                                     (big_int_of_int 1_000_000_000_000_000_000) then -1\n                       else loop (first * total) rest\n  in loop 1 lst\n\nlet n = sscanf (read_line ()) \"%d\" (fun n -> n)\nlet a_list = List.map (fun n -> int_of_string n) (String.split_on_char ' ' (read_line ()))\nlet () = printf \"%d\\n\" (multiplication a_list)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 560, "cpu_time_ms": 7, "memory_kb": 3732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s094209537", "group_id": "codeNet:p02657", "input_text": "let () =\n\tlet a, b = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n    Printf.printf \"%d\\n\" (a*b)", "language": "OCaml", "metadata": {"date": 1590973256, "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/s094209537.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s094209537", "user_id": "u307426615"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n\tlet a, b = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n    Printf.printf \"%d\\n\" (a*b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 2, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s381555368", "group_id": "codeNet:p02660", "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 ctos = String.of_char\nlet stocl = String.to_list\nlet cltos = String.of_list\n\nmodule MyString = struct\n  include String\n\n  let map_to_list f s = L.map f (stocl s)\n  let mapi_to_list 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 spoc = S.split_on_char\nlet spsp s = spoc ' ' s\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 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 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 n = rdi () in\n  let mx = 1000000 in\n  let primes_to_1000 = [\n  2;3;5;7;11;13;17;19;23;29;31;37;41;43;47;53;59;61;67;71;73;79;83;89;97;101;\n  103;107;109;113;127;131;137;139;149;151;157;163;167;173;179;181;191;193;197;\n  199;211;223;227;229;233;239;241;251;257;263;269;271;277;281;283;293;307;311;\n  313;317;331;337;347;349;353;359;367;373;379;383;389;397;401;409;419;421;431;\n  433;439;443;449;457;461;463;467;479;487;491;499;503;509;521;523;541;547;557;\n  563;569;571;577;587;593;599;601;607;613;617;619;631;641;643;647;653;659;661;\n  673;677;683;691;701;709;719;727;733;739;743;751;757;761;769;773;787;797;809;\n  811;821;823;827;829;839;853;857;859;863;877;881;883;887;907;911;919;929;937;\n  941;947;953;967;971;977;983;991;997] in\n\n  let rec indivisible k pl = match pl with \n    | [] -> true\n    | h::t -> if k > h && k mod h = 0 then false else indivisible k t\n  in\n\n  let primes = L.range 2 `To mx |> L.filter (fun x -> indivisible x primes_to_1000) in\n\n  let is_prime x = x >= 2 && indivisible x primes in\n\n  let exps_lt x =\n    let rec aux el x =\n      let y = x * (L.hd el) in\n      if y > mx * mx then L.rev el\n      else aux (y::el) x\n    in aux [x] x\n  in\n\n  let prime_exps = \n    primes |> L.flatmap (fun x -> exps_lt x) \n  in\n\n  let rec divp k c pl = match pl with\n    | [] -> (k, c)\n    | h::t -> if k = 1 then (k, c)\n      else if k mod h = 0 then divp (k / h) (c + 1) t\n      else divp k c t\n  in\n  let (rem, cnt) = divp n 0 prime_exps in\n\n  puti (if n = 1 then 0 else cnt +\n    (if rem > mx && is_prime rem then 1 else 0)) \n;;\n", "language": "OCaml", "metadata": {"date": 1590987590, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02660.html", "problem_id": "p02660", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02660/input.txt", "sample_output_relpath": "derived/input_output/data/p02660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02660/OCaml/s381555368.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381555368", "user_id": "u970139668"}, "prompt_components": {"gold_output": "3\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 ctos = String.of_char\nlet stocl = String.to_list\nlet cltos = String.of_list\n\nmodule MyString = struct\n  include String\n\n  let map_to_list f s = L.map f (stocl s)\n  let mapi_to_list 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 spoc = S.split_on_char\nlet spsp s = spoc ' ' s\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 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 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 n = rdi () in\n  let mx = 1000000 in\n  let primes_to_1000 = [\n  2;3;5;7;11;13;17;19;23;29;31;37;41;43;47;53;59;61;67;71;73;79;83;89;97;101;\n  103;107;109;113;127;131;137;139;149;151;157;163;167;173;179;181;191;193;197;\n  199;211;223;227;229;233;239;241;251;257;263;269;271;277;281;283;293;307;311;\n  313;317;331;337;347;349;353;359;367;373;379;383;389;397;401;409;419;421;431;\n  433;439;443;449;457;461;463;467;479;487;491;499;503;509;521;523;541;547;557;\n  563;569;571;577;587;593;599;601;607;613;617;619;631;641;643;647;653;659;661;\n  673;677;683;691;701;709;719;727;733;739;743;751;757;761;769;773;787;797;809;\n  811;821;823;827;829;839;853;857;859;863;877;881;883;887;907;911;919;929;937;\n  941;947;953;967;971;977;983;991;997] in\n\n  let rec indivisible k pl = match pl with \n    | [] -> true\n    | h::t -> if k > h && k mod h = 0 then false else indivisible k t\n  in\n\n  let primes = L.range 2 `To mx |> L.filter (fun x -> indivisible x primes_to_1000) in\n\n  let is_prime x = x >= 2 && indivisible x primes in\n\n  let exps_lt x =\n    let rec aux el x =\n      let y = x * (L.hd el) in\n      if y > mx * mx then L.rev el\n      else aux (y::el) x\n    in aux [x] x\n  in\n\n  let prime_exps = \n    primes |> L.flatmap (fun x -> exps_lt x) \n  in\n\n  let rec divp k c pl = match pl with\n    | [] -> (k, c)\n    | h::t -> if k = 1 then (k, c)\n      else if k mod h = 0 then divp (k / h) (c + 1) t\n      else divp k c t\n  in\n  let (rem, cnt) = divp n 0 prime_exps in\n\n  puti (if n = 1 then 0 else cnt +\n    (if rem > mx && is_prime rem then 1 else 0)) \n;;\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "sample_input": "24\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02660", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4442, "cpu_time_ms": 255, "memory_kb": 35424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s151313694", "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.map (fun c ->\n    match c with\n    | '?' -> 'D'\n    | x -> x\n  ) t in\n  puts result\n;;\n", "language": "OCaml", "metadata": {"date": 1590897238, "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/s151313694.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151313694", "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.map (fun c ->\n    match c with\n    | '?' -> 'D'\n    | x -> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2916, "cpu_time_ms": 10, "memory_kb": 6048}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943722595", "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 :: second :: rest ->\n    if first = '?' && second = 'D' then loop ('P' :: result) (second :: rest) else\n    if first = '?' then loop ('D' :: result) (second :: rest) else\n    loop (first :: result) (second :: 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": 1590887966, "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/s943722595.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s943722595", "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 :: second :: rest ->\n    if first = '?' && second = 'D' then loop ('P' :: result) (second :: rest) else\n    if first = '?' then loop ('D' :: result) (second :: rest) else\n    loop (first :: result) (second :: 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 705, "cpu_time_ms": 40, "memory_kb": 20624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943474955", "group_id": "codeNet:p02675", "input_text": "print_endline (\n  match read_int() mod 10 with\n    3 -> \"bon\"\n  | 0 | 1 | 6 | 8 -> \"pon\"\n  | _ -> \"hon\"\n)\n", "language": "OCaml", "metadata": {"date": 1597530840, "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/s943474955.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943474955", "user_id": "u752907799"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "print_endline (\n  match read_int() mod 10 with\n    3 -> \"bon\"\n  | 0 | 1 | 6 | 8 -> \"pon\"\n  | _ -> \"hon\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 8, "memory_kb": 3528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s621615184", "group_id": "codeNet:p02675", "input_text": "let pronounce n =\n  if n mod 10 = 3 then \"bon\"\n  else if n mod 10 = 0 || n mod 10 = 1 || n mod 10 = 6 || n mod 10 = 8 then \"pon\"\n  else \"hon\"\n\nlet () = Scanf.scanf \"%d\" (fun n -> Printf.printf \"%s\\n\" (pronounce n))", "language": "OCaml", "metadata": {"date": 1591496693, "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/s621615184.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621615184", "user_id": "u052332717"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "let pronounce n =\n  if n mod 10 = 3 then \"bon\"\n  else if n mod 10 = 0 || n mod 10 = 1 || n mod 10 = 6 || n mod 10 = 8 then \"pon\"\n  else \"hon\"\n\nlet () = Scanf.scanf \"%d\" (fun n -> Printf.printf \"%s\\n\" (pronounce 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s445862289", "group_id": "codeNet:p02675", "input_text": "open Batteries\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet n = List.nth (read_line() |> explode) 2\nlet _ = (if n = '2' || n = '4' || n = '5' || n = '7' || n = '9' then \"hon\" else if n = '3' then \"bon\" else \"pon\") |> print_endline", "language": "OCaml", "metadata": {"date": 1589763730, "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/s445862289.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s445862289", "user_id": "u511870776"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "open Batteries\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet n = List.nth (read_line() |> explode) 2\nlet _ = (if n = '2' || n = '4' || n = '5' || n = '7' || n = '9' then \"hon\" else if n = '3' then \"bon\" else \"pon\") |> print_endline", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 5256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s474996204", "group_id": "codeNet:p02676", "input_text": "let k = Scanf.sscanf (read_line ()) \"%d\" @@ fun k -> k\nlet s = read_line ()\n\nlet () =\n  if String.length s <= k then\n    print_endline s\n  else\n    print_endline @@ (String.sub s 0 k) ^ \"...\"", "language": "OCaml", "metadata": {"date": 1589763891, "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/s474996204.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474996204", "user_id": "u811309788"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "let k = Scanf.sscanf (read_line ()) \"%d\" @@ fun k -> k\nlet s = read_line ()\n\nlet () =\n  if String.length s <= k then\n    print_endline s\n  else\n    print_endline @@ (String.sub s 0 k) ^ \"...\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 191, "cpu_time_ms": 13, "memory_kb": 3740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s456938254", "group_id": "codeNet:p02676", "input_text": "Scanf.scanf \"%d %s\" (fun k s ->\n    let n = String.length s in\n    if n <= k then print_endline s\n        else Printf.printf \"%s...\\n\" (String.sub s 0 k)\n)", "language": "OCaml", "metadata": {"date": 1589763807, "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/s456938254.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s456938254", "user_id": "u342443598"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "Scanf.scanf \"%d %s\" (fun k s ->\n    let n = String.length s in\n    if n <= k then print_endline s\n        else Printf.printf \"%s...\\n\" (String.sub s 0 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 3744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s297303611", "group_id": "codeNet:p02677", "input_text": "open Printf\nopen Scanf\n\nlet solve a b h m =\n  let pi = 4.0 *. atan 1.0 in\n  let tm = pi *. m /. 30.0 in\n  let th = pi *. (h /. 6.0 +. m /. 360.0) in\n  sqrt @@ a *. a +. b *. b -. 2.0 *. a *. b *. cos (tm -. th)\n\nlet () =\n  scanf \"%f %f %f %f \" solve |> printf \"%.10f\\n\"\n", "language": "OCaml", "metadata": {"date": 1590002748, "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/s297303611.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s297303611", "user_id": "u388783188"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b h m =\n  let pi = 4.0 *. atan 1.0 in\n  let tm = pi *. m /. 30.0 in\n  let th = pi *. (h /. 6.0 +. m /. 360.0) in\n  sqrt @@ a *. a +. b *. b -. 2.0 *. a *. b *. cos (tm -. th)\n\nlet () =\n  scanf \"%f %f %f %f \" solve |> printf \"%.10f\\n\"\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 4476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s579182799", "group_id": "codeNet:p02678", "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 = float_of_int\nlet i2f = int_of_float\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule ToyList = 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 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = ToyList\n\nmodule ToyArray = 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  (* 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 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 *)\nend\n\nmodule A = ToyArray\n\nmodule ToyString = 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 = ToyString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule ToySortedSet = 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 = ToySortedSet\n\nmodule ToySortedMap  = 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 = ToySortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule ToyIntArithmetic = struct\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \nend\n\nmodule N = ToyIntArithmetic\n\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule ToyMatrix (Fop : FieldOps) = struct\n\n  \n  type t = { w : int; h : int; e : Fop.elt array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let zero w h = make w h Fop.zero\n\n  let from_columns w h elems =\n    let matr = zero w h in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e mat =\n    let matr = make w2 h2 e in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\n  let prod mat1 mat2 =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero mat =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) mat =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 mat =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule ToyGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = ToyGraph\n\nmodule ToyGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = ToyGraphAlgorithms(\nstruct\n  type t = int\n  let compare = compare\n  let default = 0\nend)\n\nlet _ =\n  let (n, m) = rdi2 () in\n  let es = rdv m rdi2 in\n  let graph = G.from_uedges n 0 es in\n  let (result, _) = graph |> Galg.bfs (fun (u, p) (v, _) g ->\n    (* printf \"u = %d; v = %d; p = %d\\n\" u v p; *)\n    g.vs.(v - 1) <- (v, u); g)\n      (Galg.Vset.singleton (1, 0)) (Ss.singleton 1) \n  in\n  puts \"Yes\";\n  A.tail result.vs 1 |> A.iter (fun (_, p) -> puti p)\n;;\n", "language": "OCaml", "metadata": {"date": 1592159102, "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/s579182799.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579182799", "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\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 = float_of_int\nlet i2f = int_of_float\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ i2s i\n\nlet rep lb bnd ub f = match bnd with\n  | `To -> for i = lb to ub do f i done\n  | `Til -> for i = lb to (ub - 1) do f i done\n\nlet rep2 lb1 bnd1 ub1 () lb2 bnd2 ub2 f = \n  match (bnd1, bnd2) with\n  | (`To, `To) -> for i = lb1 to ub1 do for j = lb2 to ub2 do f i j done done\n  | (`To, `Til) -> for i = lb1 to ub1 do for j = lb2 to (ub2 - 1) do f i j done done\n  | (`Til, `To) -> for i = lb1 to (ub1 - 1) do for j = lb2 to ub2 do f i j done done\n  | (`Til, `Til) -> for i = lb1 to (ub1 - 1) do for j = lb2 to (ub2 - 1) do f i j done done\n\nmodule ToyList = 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 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 = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = ToyList\n\nmodule ToyArray = 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  (* 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 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 *)\nend\n\nmodule A = ToyArray\n\nmodule ToyString = 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 = ToyString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule ToySortedSet = 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 = ToySortedSet\n\nmodule ToySortedMap  = 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 = ToySortedMap\n\n\nlet 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\nexception ArithmeticException of string\n\nmodule ToyIntArithmetic = struct\n\n  let rec to_bits_le n =\n    if n = 0 then []\n    else (n mod 2) :: to_bits_le (n lsr 1)\n\n  let rec gcd x y =\n    match x mod y with\n    | 0 -> y\n    | z -> gcd y z\n\n  let 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\n  let modinv x m =\n    let (g, y, z) = ext_euclid x m in\n    match g with\n    | 1 -> y mod m\n    | _ -> raise @@ ArithmeticException \"Not relatively prime\"\n      \nend\n\nmodule N = ToyIntArithmetic\n\n\nmodule type FieldOps = sig\n  type elt\n  val zero : elt\n  val one : elt\n  val neg : elt -> elt\n  val rcp : elt -> elt\n  val add : elt -> elt -> elt\n  val sub : elt -> elt -> elt\n  val mul : elt -> elt -> elt\n  val div : elt -> elt -> elt\nend\n\nmodule ToyMatrix (Fop : FieldOps) = struct\n\n  \n  type t = { w : int; h : int; e : Fop.elt array array }\n\n  let make w h e0 =\n    { w = w; h = h; e = A.make_matrix w h e0 }\n\n  let zero w h = make w h Fop.zero\n\n  let from_columns w h elems =\n    let matr = zero w h in\n    elems |> L.iteri (fun j col ->\n      col |> L.iteri (fun i x -> matr.e.(i).(j) <- x));\n    matr\n\n  let blit (mats, rs, cs, w, h) (matd, rd, cd) =\n    rep2 0 `Til w () 0 `Til h (fun i j ->\n        matd.e.(rd + i).(cd + j) <- mats.e.(rs + i).(cs + j))\n\n  let expand (w1, h1) (w2, h2) e mat =\n    let matr = make w2 h2 e in\n    blit (mat, 0, 0, w1, h1) (matr, 0, 0);\n    matr\n\n  let prod mat1 mat2 =\n    let matr = zero mat1.w mat2.h in\n    rep2 0 `Til mat1.w () 0 `Til mat2.h (fun i j ->\n        matr.e.(i).(j) <-\n          mat1.e.(i) |> A.foldli (fun\n            acc k x -> Fop.add acc (Fop.mul x mat2.e.(k).(i)))\n            Fop.zero);\n    matr\n\n  exception NotZero of int\n  let is_zero mat =\n    try (\n      rep 0 `Til mat.w (fun i ->\n        if mat.e.(i) |> A.for_all (fun x -> x <> Fop.zero)\n          then raise (NotZero 1)\n      );\n      true\n    ) with _ -> false\n\n  let col_addmul c1 (c2, a) mat =\n    rep 0 `Til mat.h (fun i ->\n      mat.e.(i).(c1) <- Fop.add mat.e.(i).(c1) (Fop.mul a mat.e.(i).(c2)))\n\n  let col_inner_prod c1 c2 mat =\n    let sum = ref Fop.zero in\n    rep 0 `Til mat.h (fun i ->\n      sum := Fop.add !sum @@ Fop.mul mat.e.(i).(c1) mat.e.(i).(c2));\n    !sum\n\n  (* let orth_extend k0 k1 mat = *)\n  (*   let matx = extend (k0, h) ((k0 + k1), h) 0 mat in *)\n  (*   rep k0 `Til (k0 + k1) (fun t -> *)\n  (*     rep 0 `Til t (fun s ->  *)\n  (*       let ip = col_inner_prod s t h matx in *)\n  (*       col_addmul t (s, ip) h matx)); *)\n  (*   submat (k0, 0) (k0 + k1 - 1, h - 1) matx *)\n\nend\n\nmodule type OrderedData = sig\n  type t\n  val compare : t -> t -> int\n  val default : t\nend\n\nmodule ToyGraph = struct\n\n  type 'a v_t = int * 'a\n  type 'a t = { vs : 'a v_t array; nb : int Ss.t array }\n\n  let empty nv vd =\n    let vs0 = Array.make nv (0, vd) in\n    for i = 0 to (nv - 1) do vs0.(i) <- (i, vd) done;\n    {\n      vs = vs0;\n      nb = A.make nv Ss.empty\n    }\n\n  let add_edge (e : int * int) vd g =\n    let (v1, v2) = e in\n    g.vs.(v1 - 1) <- (v1, vd);\n    g.vs.(v2 - 1) <- (v2, vd);\n    g.nb.(v1 - 1) <- g.nb.(v1 - 1) |> Ss.add v2;\n    g\n\n  let add_uedge e vd g =\n    add_edge e vd (add_edge (swap e) vd g)\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e vd g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e vd g) (empty nv vd)\n\n\nend\n\nmodule G = ToyGraph\n\nmodule ToyGraphAlgorithms (Vdt : OrderedData) = struct\n  \n  type t = Vdt.t G.t\n\n  module V = struct\n    type t = int * Vdt.t\n    let compare (vi1, vd1) (vi2, vd2) =\n      let c1 = Vdt.compare vd1 vd2 in\n      if c1 = 0 then compare vi1 vi2\n      else c1\n\n    let default i = (i, Vdt.default)\n    let index (v : t) = fst v\n  end\n\n  module Vset = Ss.Make(V)\n\n  let print_vertices label vs =\n    printf \"%s: \" label;\n    vs |> Vset.iter (fun (vi, _) -> printf \"%d \" vi);\n    puts \"\"\n\n  let nbiter (upd : V.t -> V.t -> t -> t * bool)\n    (ui : int) (fr : Vset.t) (cls : int Ss.t) (g : t) =\n    let nb = g.nb.(ui - 1) in\n    let result = nb |> Ss.foldl (fun (ga, nxfr, nxcls) vi ->\n    (* puts \"nxcls: \"; *)\n      (* Ss.iter (fun x -> printf \"%d \" x) nxcls; puts \"\"; *)\n      if ui = vi || Ss.mem vi nxcls then\n        (ga, nxfr, nxcls)\n      else\n        let ue = g.vs.(ui - 1) and ve = g.vs.(vi - 1) in\n        let (gu, close) = upd ue ve ga in\n        (gu,\n          nxfr |> Vset.add ve,\n          if close then nxcls |> Ss.add vi else nxcls)\n    ) (g, fr, cls)\n    in (* puts \"\";  *)result\n\n  let traverse (upd : V.t -> V.t -> t -> t * bool) \n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (ve, fr') = Vset.pop_min fr in\n      let (vi, _) = ve in\n      let (gu, nxfr, nxcls) = nbiter upd vi fr' cls g' in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let frontier (upd : V.t -> V.t -> t -> t * bool)\n    (fr0 : Vset.t) (cls0 : int Ss.t) (g : t) =\n\n    let rec progress fr cls g' =\n      let (gu, nxfr, nxcls) =\n        fr |> Vset.foldl (fun (ga, nxfra, nxclsa) ve ->\n          let (vi, _) = ve in\n          nbiter upd vi nxfra nxclsa ga\n        ) (g', Vset.empty, cls)\n      in\n      if Vset.is_empty nxfr then (gu, nxcls)\n      else progress nxfr nxcls gu\n    in\n    progress fr0 cls0 g\n\n  let bfs (upd : V.t -> V.t -> t -> t) =\n    frontier (fun fr cls g' -> (upd fr cls g', true))\n  \nend\n\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\nmodule Galg = ToyGraphAlgorithms(\nstruct\n  type t = int\n  let compare = compare\n  let default = 0\nend)\n\nlet _ =\n  let (n, m) = rdi2 () in\n  let es = rdv m rdi2 in\n  let graph = G.from_uedges n 0 es in\n  let (result, _) = graph |> Galg.bfs (fun (u, p) (v, _) g ->\n    (* printf \"u = %d; v = %d; p = %d\\n\" u v p; *)\n    g.vs.(v - 1) <- (v, u); g)\n      (Galg.Vset.singleton (1, 0)) (Ss.singleton 1) \n  in\n  puts \"Yes\";\n  A.tail result.vs 1 |> A.iter (fun (_, 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 11405, "cpu_time_ms": 972, "memory_kb": 64508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s238394250", "group_id": "codeNet:p02678", "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\nlet (n, m) = scan \"%d %d\" Tuple2.make\nlet ls = scan_lines m \"%d %d\" Tuple2.make\n\nlet () =\n  let mat = Array.make (succ n) [] in\n  ListL.iter ls ~f:(fun (a,b) ->\n      mat.(a) <- b::mat.(a);\n      mat.(b) <- a::mat.(b));\n  let q = Queue.create () in\n  Queue.add (1,1) q;\n  let parents = Array.make (succ n) 0 in\n  let rec wfs q =\n    if Queue.is_empty q then ()\n    else\n      let (p, n) = Queue.pop q in\n      if parents.(n) <> 0 then wfs q\n      else\n        (parents.(n) <- p;\n         ListL.iter mat.(n) ~f:(fun m ->\n             Queue.add (n, m) q);\n         wfs q)\n  in\n  wfs q;\n  if Array.exists ((=) 0)@@ Array.sub parents 2 (Array.length parents - 2)  then\n    Printf.printf \"No\\n\"\n  else\n    (Printf.printf \"Yes\\n\";\n     ListL.iter (2++n) ~f:(fun i ->\n         Printf.printf \"%d\\n\" parents.(i)))\n", "language": "OCaml", "metadata": {"date": 1591916383, "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/s238394250.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s238394250", "user_id": "u802614675"}, "prompt_components": {"gold_output": "Yes\n1\n2\n2\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\nlet (n, m) = scan \"%d %d\" Tuple2.make\nlet ls = scan_lines m \"%d %d\" Tuple2.make\n\nlet () =\n  let mat = Array.make (succ n) [] in\n  ListL.iter ls ~f:(fun (a,b) ->\n      mat.(a) <- b::mat.(a);\n      mat.(b) <- a::mat.(b));\n  let q = Queue.create () in\n  Queue.add (1,1) q;\n  let parents = Array.make (succ n) 0 in\n  let rec wfs q =\n    if Queue.is_empty q then ()\n    else\n      let (p, n) = Queue.pop q in\n      if parents.(n) <> 0 then wfs q\n      else\n        (parents.(n) <- p;\n         ListL.iter mat.(n) ~f:(fun m ->\n             Queue.add (n, m) q);\n         wfs q)\n  in\n  wfs q;\n  if Array.exists ((=) 0)@@ Array.sub parents 2 (Array.length parents - 2)  then\n    Printf.printf \"No\\n\"\n  else\n    (Printf.printf \"Yes\\n\";\n     ListL.iter (2++n) ~f:(fun i ->\n         Printf.printf \"%d\\n\" parents.(i)))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 357, "memory_kb": 51612}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s956415576", "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 Int = struct\n  type t = int\n  let zero = 0\n  let inf = max_int\n  let ( + ) = ( + )\n  let compare = compare\nend\n\nmodule G = WeightedDirectedGraph.ByMap.Make (Int) (Int)\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 (fun u -> { G.fold = fun f ->\n    List.fold_right (fun v -> f (v, 1, u + 1)) es.(u) }) 0 in\n  if\n    List.exists (fun v -> try ignore (d v); false with Not_found -> true) @@\n    List.init n Fun.id\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": 1589859894, "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/s956415576.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s956415576", "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 Int = struct\n  type t = int\n  let zero = 0\n  let inf = max_int\n  let ( + ) = ( + )\n  let compare = compare\nend\n\nmodule G = WeightedDirectedGraph.ByMap.Make (Int) (Int)\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 (fun u -> { G.fold = fun f ->\n    List.fold_right (fun v -> f (v, 1, u + 1)) es.(u) }) 0 in\n  if\n    List.exists (fun v -> try ignore (d v); false with Not_found -> true) @@\n    List.init n Fun.id\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 13257, "cpu_time_ms": 682, "memory_kb": 44148}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s834311462", "group_id": "codeNet:p02678", "input_text": "module DirectedGraph\n: sig\n  (* 配列を用いたBFSの実装 *)\n  module ByArray : sig\n    module Make :\n      functor\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          (* BFSにより，重みのないグラフの最短経路を求める *)\n          val bfs :\n            (* 頂点数n *)\n            int ->\n            (* 辺の名前が付いた隣接リスト *)\n            (int -> (int * Path.edge) church_list) ->\n            (* 始点 *)\n            int ->\n            (* 始点からの最短経路を返す関数\n               この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n            (int -> Path.t option)\n        end\n  end\n\n  (* ハッシュテーブルを用いたBFSの実装 *)\n  module ByHashtbl : sig\n    module Make :\n      functor\n        (* 頂点をキーとしたハッシュテーブルの実装 *)\n        (VHash : Hashtbl.S)\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          (* BFSにより，重みのないグラフの最短経路を求める *)\n          val bfs :\n            (* 頂点数（ハッシュテーブルを用いるので目安程度） *)\n            int ->\n            (* 辺の名前が付いた隣接リスト *)\n            (VHash.key -> (VHash.key * Path.edge) church_list) ->\n            (* 始点 *)\n            VHash.key ->\n            (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n            (VHash.key -> Path.t option)\n        end\n  end\n\n  (* Mapを用いたBFSの実装 *)\n  module ByMap : sig\n    module Make :\n      functor\n        (* 頂点をキーとしたMapの実装 *)\n        (VMap : Map.S)\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          (* BFSにより，重みのないグラフの最短経路を求める *)\n          val bfs :\n            (* 辺の名前が付いた隣接リスト *)\n            (VMap.key -> (VMap.key * Path.edge) church_list) ->\n            (* 始点 *)\n            VMap.key ->\n            (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n            (VMap.key -> Path.t option)\n        end\n  end\nend\n= struct\n  module type 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\n  (* 最短経路を格納するデータ構造を抽象化したBFSの実装 *)\n  module Core\n    (P : Path)\n    (* グラフの頂点を添字としたハッシュ *)\n    (VHash : sig\n      type t\n      type vertex (* グラフの頂点 *)\n      val find_opt : t -> vertex -> P.t option\n      val update : t -> vertex -> (P.t option -> P.t option) -> unit\n    end)\n  = struct\n    type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n    let bfs d es s =\n      let q = ref [(s, P.nil)] in\n      let rec bfs_aux t =\n        match VHash.find_opt d t, !q with\n        (* もう既に全ての頂点までの経路が分かっている *)\n        | None, [] -> None\n        (* 既に終点までの経路が分かっているので返す *)\n        | Some _ as ans, _ -> ans\n        (* 終点までの経路が分かっていないので，BFSを続行 *)\n        | None, ((_ :: _) as ups) ->\n            q := [];\n            List.iter (fun (u, p) ->\n              VHash.update d u @@ function\n                | (Some _) as op -> op\n                | None ->\n                    (es u).fold (fun (v, e) () -> q := (v, P.snoc p e) :: !q) ();\n                    Some p) ups;\n            bfs_aux t in\n      bfs_aux\n  end\n\n  module ByArray = struct\n    module Make (P : Path) = struct\n      module C = Core (P) (struct\n        type t = P.t option array\n        type vertex = int\n        let find_opt = Array.get\n        let update d v f = d.(v) <- f d.(v)\n      end)\n      include C\n\n      let bfs n e s = C.bfs (Array.make n None) e s\n    end\n  end\n\n  module ByHashtbl = struct\n    module Make (VHash : Hashtbl.S) (P : Path) = struct\n      module C = Core (P) (struct\n        type t = P.t VHash.t\n        type vertex = VHash.key\n        let find_opt = VHash.find_opt\n        let update d v f =\n          let opt = VHash.find_opt d v in\n          match opt, f opt with\n          | None, None -> ()\n          | None, Some p -> VHash.add d v p\n          | Some _, None -> VHash.remove d v\n          | Some p, Some p' -> if p != p' then VHash.replace d v p'\n      end)\n      include C\n\n      let bfs n e s = C.bfs (VHash.create n) e s\n    end\n  end\n\n  module ByMap = struct\n    module Make (VMap : Map.S) (P : Path) = struct\n      module C = Core (P) (struct\n        type t = P.t VMap.t ref\n        type vertex = VMap.key\n        let find_opt d v = VMap.find_opt v !d\n        let update d v f = d := VMap.update v f !d\n      end)\n      include C\n\n      let bfs e s = C.bfs (ref VMap.empty) e s\n    end\n  end\nend\n\nmodule G = DirectedGraph.ByArray.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, a) :: es.(a - 1);\n      es.(b - 1) <- (a - 1, b) :: es.(b - 1);\n  done;\n  let d = G.bfs n (fun v -> { G.fold = fun f -> List.fold_right f es.(v) }) 0 in\n  if List.exists Option.is_none @@ 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\" @@ Option.get @@ d i\n    done\n  end\n", "language": "OCaml", "metadata": {"date": 1589832279, "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/s834311462.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834311462", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n1\n2\n2\n", "input_to_evaluate": "module DirectedGraph\n: sig\n  (* 配列を用いたBFSの実装 *)\n  module ByArray : sig\n    module Make :\n      functor\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          (* BFSにより，重みのないグラフの最短経路を求める *)\n          val bfs :\n            (* 頂点数n *)\n            int ->\n            (* 辺の名前が付いた隣接リスト *)\n            (int -> (int * Path.edge) church_list) ->\n            (* 始点 *)\n            int ->\n            (* 始点からの最短経路を返す関数\n               この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n            (int -> Path.t option)\n        end\n  end\n\n  (* ハッシュテーブルを用いたBFSの実装 *)\n  module ByHashtbl : sig\n    module Make :\n      functor\n        (* 頂点をキーとしたハッシュテーブルの実装 *)\n        (VHash : Hashtbl.S)\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          (* BFSにより，重みのないグラフの最短経路を求める *)\n          val bfs :\n            (* 頂点数（ハッシュテーブルを用いるので目安程度） *)\n            int ->\n            (* 辺の名前が付いた隣接リスト *)\n            (VHash.key -> (VHash.key * Path.edge) church_list) ->\n            (* 始点 *)\n            VHash.key ->\n            (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n            (VHash.key -> Path.t option)\n        end\n  end\n\n  (* Mapを用いたBFSの実装 *)\n  module ByMap : sig\n    module Make :\n      functor\n        (* 頂点をキーとしたMapの実装 *)\n        (VMap : Map.S)\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          (* BFSにより，重みのないグラフの最短経路を求める *)\n          val bfs :\n            (* 辺の名前が付いた隣接リスト *)\n            (VMap.key -> (VMap.key * Path.edge) church_list) ->\n            (* 始点 *)\n            VMap.key ->\n            (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n            (VMap.key -> Path.t option)\n        end\n  end\nend\n= struct\n  module type 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\n  (* 最短経路を格納するデータ構造を抽象化したBFSの実装 *)\n  module Core\n    (P : Path)\n    (* グラフの頂点を添字としたハッシュ *)\n    (VHash : sig\n      type t\n      type vertex (* グラフの頂点 *)\n      val find_opt : t -> vertex -> P.t option\n      val update : t -> vertex -> (P.t option -> P.t option) -> unit\n    end)\n  = struct\n    type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n    let bfs d es s =\n      let q = ref [(s, P.nil)] in\n      let rec bfs_aux t =\n        match VHash.find_opt d t, !q with\n        (* もう既に全ての頂点までの経路が分かっている *)\n        | None, [] -> None\n        (* 既に終点までの経路が分かっているので返す *)\n        | Some _ as ans, _ -> ans\n        (* 終点までの経路が分かっていないので，BFSを続行 *)\n        | None, ((_ :: _) as ups) ->\n            q := [];\n            List.iter (fun (u, p) ->\n              VHash.update d u @@ function\n                | (Some _) as op -> op\n                | None ->\n                    (es u).fold (fun (v, e) () -> q := (v, P.snoc p e) :: !q) ();\n                    Some p) ups;\n            bfs_aux t in\n      bfs_aux\n  end\n\n  module ByArray = struct\n    module Make (P : Path) = struct\n      module C = Core (P) (struct\n        type t = P.t option array\n        type vertex = int\n        let find_opt = Array.get\n        let update d v f = d.(v) <- f d.(v)\n      end)\n      include C\n\n      let bfs n e s = C.bfs (Array.make n None) e s\n    end\n  end\n\n  module ByHashtbl = struct\n    module Make (VHash : Hashtbl.S) (P : Path) = struct\n      module C = Core (P) (struct\n        type t = P.t VHash.t\n        type vertex = VHash.key\n        let find_opt = VHash.find_opt\n        let update d v f =\n          let opt = VHash.find_opt d v in\n          match opt, f opt with\n          | None, None -> ()\n          | None, Some p -> VHash.add d v p\n          | Some _, None -> VHash.remove d v\n          | Some p, Some p' -> if p != p' then VHash.replace d v p'\n      end)\n      include C\n\n      let bfs n e s = C.bfs (VHash.create n) e s\n    end\n  end\n\n  module ByMap = struct\n    module Make (VMap : Map.S) (P : Path) = struct\n      module C = Core (P) (struct\n        type t = P.t VMap.t ref\n        type vertex = VMap.key\n        let find_opt d v = VMap.find_opt v !d\n        let update d v f = d := VMap.update v f !d\n      end)\n      include C\n\n      let bfs e s = C.bfs (ref VMap.empty) e s\n    end\n  end\nend\n\nmodule G = DirectedGraph.ByArray.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, a) :: es.(a - 1);\n      es.(b - 1) <- (a - 1, b) :: es.(b - 1);\n  done;\n  let d = G.bfs n (fun v -> { G.fold = fun f -> List.fold_right f es.(v) }) 0 in\n  if List.exists Option.is_none @@ 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\" @@ Option.get @@ 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6460, "cpu_time_ms": 391, "memory_kb": 53980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s932238628", "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 + 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 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.modify_def 0 (b,-a) id h0));\n  Hashtbl.map (fun v n ->\n      let x = Hashtbl.find_default h1 v 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": 1592076359, "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/s932238628.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s932238628", "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 + 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 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.modify_def 0 (b,-a) id h0));\n  Hashtbl.map (fun v n ->\n      let x = Hashtbl.find_default h1 v 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3018, "cpu_time_ms": 607, "memory_kb": 74292}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s618263494", "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 prime = 1_000_000_007\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\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 (+) a b = (a + b) mod prime\nlet (-) a b = (a + prime - b) mod prime\nlet ( * ) a b = (a * b) mod prime\n\nlet rec pow x n =\n  if n = 0 then 1\n  else\n  if n mod 2 = 0 then  pow (x*x) (n/2)\n  else x * pow (x*x) (n/2)\n\nlet () =\n  let h = Hashtbl.create n 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      let m = gcd (abs a) (abs b) in (a/m, b/m)) in\n  ListL.iter ms ~f:(fun v -> Hashtbl.modify_def 0 v succ h);\n  Hashtbl.map (fun (a,b) n ->\n      let x = Hashtbl.find_default h (-b,a) 0 in\n      let y = Hashtbl.find_default h (b,-a) 0 in\n      Hashtbl.remove h (-b,a); Hashtbl.remove h (b,-a);\n      pow 2 n - 1 + pow 2 (x+y) - 1 + 1) h\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": 1591935116, "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/s618263494.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s618263494", "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 prime = 1_000_000_007\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\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 (+) a b = (a + b) mod prime\nlet (-) a b = (a + prime - b) mod prime\nlet ( * ) a b = (a * b) mod prime\n\nlet rec pow x n =\n  if n = 0 then 1\n  else\n  if n mod 2 = 0 then  pow (x*x) (n/2)\n  else x * pow (x*x) (n/2)\n\nlet () =\n  let h = Hashtbl.create n 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      let m = gcd (abs a) (abs b) in (a/m, b/m)) in\n  ListL.iter ms ~f:(fun v -> Hashtbl.modify_def 0 v succ h);\n  Hashtbl.map (fun (a,b) n ->\n      let x = Hashtbl.find_default h (-b,a) 0 in\n      let y = Hashtbl.find_default h (b,-a) 0 in\n      Hashtbl.remove h (-b,a); Hashtbl.remove h (b,-a);\n      pow 2 n - 1 + pow 2 (x+y) - 1 + 1) h\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2809, "cpu_time_ms": 608, "memory_kb": 61524}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s586698064", "group_id": "codeNet:p02679", "input_text": "module QuotientMap = Map.Make (struct\n  type t = int * int\n  let compare (a, b) (c, d) =\n    compare (a * d) (b * c) * compare (b * d) 0\nend)\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\nlet rec gcd n m =\n  if m = 0 then n else gcd m (n mod m)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs_ = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> (a * compare b 0 / gcd (abs a) (abs b), abs b / gcd (abs a) (abs b)) in\n  let m =\n    Array.fold_left (fun acc (a, b) ->\n      QuotientMap.update (a, b) (fun o -> Some (1 + Option.value ~default:0 o)) @@\n      QuotientMap.update (b * compare 0 a, abs a) (fun o -> Some (Option.value ~default:0 o)) acc) QuotientMap.empty abs_ in\n  Printf.printf \"%d\\n\" @@\n  Fun.flip ( -^ ) 1 @@\n  QuotientMap.fold (fun (a, b) n -> ( *^ ) @@\n    if a * compare b 0 < 0\n    then 1\n    else let n' = QuotientMap.find (b * compare 0 a, abs a) m in (power ( *^ ) 1 2 n +^ power ( *^ ) 1 2 n' -^ 1)) m 1\n", "language": "OCaml", "metadata": {"date": 1589768978, "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/s586698064.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s586698064", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "module QuotientMap = Map.Make (struct\n  type t = int * int\n  let compare (a, b) (c, d) =\n    compare (a * d) (b * c) * compare (b * d) 0\nend)\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\nlet rec gcd n m =\n  if m = 0 then n else gcd m (n mod m)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs_ = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> (a * compare b 0 / gcd (abs a) (abs b), abs b / gcd (abs a) (abs b)) in\n  let m =\n    Array.fold_left (fun acc (a, b) ->\n      QuotientMap.update (a, b) (fun o -> Some (1 + Option.value ~default:0 o)) @@\n      QuotientMap.update (b * compare 0 a, abs a) (fun o -> Some (Option.value ~default:0 o)) acc) QuotientMap.empty abs_ in\n  Printf.printf \"%d\\n\" @@\n  Fun.flip ( -^ ) 1 @@\n  QuotientMap.fold (fun (a, b) n -> ( *^ ) @@\n    if a * compare b 0 < 0\n    then 1\n    else let n' = QuotientMap.find (b * compare 0 a, abs a) m in (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1129, "cpu_time_ms": 1151, "memory_kb": 62188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s268041953", "group_id": "codeNet:p02681", "input_text": "let id x = x\nlet s = Scanf.scanf \"%s\\n\" @@ fun s -> s\nlet t = Scanf.scanf \"%s\" @@ fun t -> t\n\nlet t = String.sub t 0 (String.length t - 1)\n\nlet () = print_endline @@ if s = t then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1589159041, "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/s268041953.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s268041953", "user_id": "u811309788"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let id x = x\nlet s = Scanf.scanf \"%s\\n\" @@ fun s -> s\nlet t = Scanf.scanf \"%s\" @@ fun t -> t\n\nlet t = String.sub t 0 (String.length t - 1)\n\nlet () = print_endline @@ if s = t then \"Yes\" else \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 195, "cpu_time_ms": 6, "memory_kb": 3740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s430412989", "group_id": "codeNet:p02681", "input_text": "open Batteries\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet s = read_line() |> explode\nlet t = read_line() |> explode\nlet t2 = List.init (List.length s) @@ fun a -> List.nth s a\nlet _ = (if s = t2 then \"Yes\" else \"No\") |> print_endline", "language": "OCaml", "metadata": {"date": 1589158913, "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/s430412989.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s430412989", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet s = read_line() |> explode\nlet t = read_line() |> explode\nlet t2 = List.init (List.length s) @@ fun a -> List.nth s a\nlet _ = (if s = t2 then \"Yes\" else \"No\") |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 8, "memory_kb": 5236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s113744255", "group_id": "codeNet:p02685", "input_text": "let binom_memo ( *^ ) ( /^ ) n =\n  let i = ref 0 in\n  let a = Array.make (n / 2 + 1) 1 in\n  let rec binom_memo_aux k =\n    if k <= !i\n    then a.(k)\n    else begin\n      incr i;\n      a.(!i) <- a.(!i - 1) *^ (n - !i + 1) /^ !i;\n      binom_memo_aux k\n    end in\n  fun k -> binom_memo_aux (min k (n - k))\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 m = 998244353\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet ( /^ ) x y = power ( *^ ) x y (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n m k ->\n  let binom = binom_memo ( *^ ) ( /^ ) (n - 1) in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( +^ ) 0 @@\n  List.init (k + 1) @@ fun k ->\n    power ( *^ ) (m *^ binom k) (m - 1) (n - 1 - k)\n\n", "language": "OCaml", "metadata": {"date": 1589231036, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02685.html", "problem_id": "p02685", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02685/input.txt", "sample_output_relpath": "derived/input_output/data/p02685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02685/OCaml/s113744255.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s113744255", "user_id": "u504158101"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let binom_memo ( *^ ) ( /^ ) n =\n  let i = ref 0 in\n  let a = Array.make (n / 2 + 1) 1 in\n  let rec binom_memo_aux k =\n    if k <= !i\n    then a.(k)\n    else begin\n      incr i;\n      a.(!i) <- a.(!i - 1) *^ (n - !i + 1) /^ !i;\n      binom_memo_aux k\n    end in\n  fun k -> binom_memo_aux (min k (n - k))\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 m = 998244353\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet ( /^ ) x y = power ( *^ ) x y (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n m k ->\n  let binom = binom_memo ( *^ ) ( /^ ) (n - 1) in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( +^ ) 0 @@\n  List.init (k + 1) @@ fun k ->\n    power ( *^ ) (m *^ binom k) (m - 1) (n - 1 - k)\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "sample_input": "3 2 1\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02685", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 787, "cpu_time_ms": 76, "memory_kb": 15356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s320640738", "group_id": "codeNet:p02685", "input_text": "let binom_memo ( * ) ( / ) n =\n  let i = ref 0 in\n  let a = Array.make (n + 1) 1 in\n  let rec binom_memo_aux k =\n    if k <= !i\n    then a.(k)\n    else begin\n      incr i;\n      a.(!i) <- a.(!i - 1) * (n - !i + 1) / !i;\n      binom_memo_aux k\n    end in\n  binom_memo_aux\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 m = 998244353\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet ( /^ ) x y = power ( *^ ) x y (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n m k ->\n  let binom = binom_memo ( *^ ) ( /^ ) (n - 1) in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( +^ ) 0 @@\n  List.init (k + 1) @@ fun k ->\n    power ( *^ ) (m *^ binom k) (m - 1) (n - 1 - k)\n\n\n\n", "language": "OCaml", "metadata": {"date": 1589230474, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02685.html", "problem_id": "p02685", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02685/input.txt", "sample_output_relpath": "derived/input_output/data/p02685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02685/OCaml/s320640738.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320640738", "user_id": "u504158101"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let binom_memo ( * ) ( / ) n =\n  let i = ref 0 in\n  let a = Array.make (n + 1) 1 in\n  let rec binom_memo_aux k =\n    if k <= !i\n    then a.(k)\n    else begin\n      incr i;\n      a.(!i) <- a.(!i - 1) * (n - !i + 1) / !i;\n      binom_memo_aux k\n    end in\n  binom_memo_aux\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 m = 998244353\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet ( /^ ) x y = power ( *^ ) x y (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n m k ->\n  let binom = binom_memo ( *^ ) ( /^ ) (n - 1) in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( +^ ) 0 @@\n  List.init (k + 1) @@ fun k ->\n    power ( *^ ) (m *^ binom k) (m - 1) (n - 1 - k)\n\n\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "sample_input": "3 2 1\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02685", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 756, "cpu_time_ms": 97, "memory_kb": 16136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s579238641", "group_id": "codeNet:p02685", "input_text": "Scanf.scanf \"%d %d %d\" (fun n m k ->\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 mm = 998244353 in\n    let ( +@) a b = (a + b) mod mm in\n    let ( *@) a b = (a * b) mod mm in\n    let ( /@) a b = a *@ inv b mm in\n\n    let modpow a b =\n        let rec loop r bit acc =\n            if bit = 0 then acc else\n                loop (r *@ r) (bit lsr 1) (if bit land 1 = 0 then acc else acc *@ r)\n        in\n        loop a b 1\n    in\n\n    let rec loop cur over single acc =\n        let acc = acc +@ cur in\n        if single > k then acc else\n            let cur = cur *@ over /@ (single *@ (m - 1)) in\n            loop cur (over - 1) (single + 1) acc\n    in\n    (if m = 1 && k = n - 1 then 1 else\n        loop (m *@ modpow (m - 1) (n - 1)) (n - 1) 1 0) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1589164528, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02685.html", "problem_id": "p02685", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02685/input.txt", "sample_output_relpath": "derived/input_output/data/p02685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02685/OCaml/s579238641.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579238641", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n m k ->\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 mm = 998244353 in\n    let ( +@) a b = (a + b) mod mm in\n    let ( *@) a b = (a * b) mod mm in\n    let ( /@) a b = a *@ inv b mm in\n\n    let modpow a b =\n        let rec loop r bit acc =\n            if bit = 0 then acc else\n                loop (r *@ r) (bit lsr 1) (if bit land 1 = 0 then acc else acc *@ r)\n        in\n        loop a b 1\n    in\n\n    let rec loop cur over single acc =\n        let acc = acc +@ cur in\n        if single > k then acc else\n            let cur = cur *@ over /@ (single *@ (m - 1)) in\n            loop cur (over - 1) (single + 1) acc\n    in\n    (if m = 1 && k = n - 1 then 1 else\n        loop (m *@ modpow (m - 1) (n - 1)) (n - 1) 1 0) |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "sample_input": "3 2 1\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02685", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1085, "cpu_time_ms": 82, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s627465512", "group_id": "codeNet:p02685", "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 = 998244353\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet inv = Fun.flip (power ( *^ ) 1) (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n m k ->\n  let comb = Array.make n 1 in\n  for i = 0 to n - 2 do\n    comb.(i + 1) <- comb.(i) *^ (n - 1 - i) *^ inv (i + 1)\n  done;\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( +^ ) 0 @@\n  List.init (k + 1) @@ fun k ->\n    power ( *^ ) (m *^ comb.(k)) (m - 1) (n - 1 - k)\n\n\n\n", "language": "OCaml", "metadata": {"date": 1589162180, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02685.html", "problem_id": "p02685", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02685/input.txt", "sample_output_relpath": "derived/input_output/data/p02685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02685/OCaml/s627465512.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s627465512", "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 m = 998244353\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet inv = Fun.flip (power ( *^ ) 1) (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n m k ->\n  let comb = Array.make n 1 in\n  for i = 0 to n - 2 do\n    comb.(i + 1) <- comb.(i) *^ (n - 1 - i) *^ inv (i + 1)\n  done;\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( +^ ) 0 @@\n  List.init (k + 1) @@ fun k ->\n    power ( *^ ) (m *^ comb.(k)) (m - 1) (n - 1 - k)\n\n\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "sample_input": "3 2 1\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02685", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 559, "cpu_time_ms": 95, "memory_kb": 16196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s241308539", "group_id": "codeNet:p02686", "input_text": "\nlet parse s =\n  Array.init (String.length s) (fun i -> s.[i])\n  |> Array.fold_left (fun (p, b) c ->\n      if c = '(' then (p+1, b) else (p-1, min b (p-1))) (0, 0)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let s = Array.init n (fun _ -> Scanf.scanf \" %s\" parse) in\n  Array.sort (fun (a, b) (c, d) -> d - b) s;\n  let tp, tb =\n    Array.fold_left (fun (tp, tb) (p, b) ->\n      (tp + p, min tb (tp + b))) (0, 0) s in\n\n  let ans = if tp = 0 && tb >= 0 then \"Yes\" else \"No\" in\n  print_endline ans\n", "language": "OCaml", "metadata": {"date": 1589170568, "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/s241308539.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s241308539", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nlet parse s =\n  Array.init (String.length s) (fun i -> s.[i])\n  |> Array.fold_left (fun (p, b) c ->\n      if c = '(' then (p+1, b) else (p-1, min b (p-1))) (0, 0)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let s = Array.init n (fun _ -> Scanf.scanf \" %s\" parse) in\n  Array.sort (fun (a, b) (c, d) -> d - b) s;\n  let tp, tb =\n    Array.fold_left (fun (tp, tb) (p, b) ->\n      (tp + p, min tb (tp + b))) (0, 0) s in\n\n  let ans = if tp = 0 && tb >= 0 then \"Yes\" else \"No\" in\n  print_endline ans\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "sample_input": "2\n)\n(()\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02686", "source_text": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 493, "cpu_time_ms": 545, "memory_kb": 38484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s430275928", "group_id": "codeNet:p02689", "input_text": "open Array\nlet () =\n  let rec make_list n = if n = 0 then [0] else n :: make_list (n-1) in\n  let n,m = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let h = init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let arr = make n 0 in\n  for i = 1 to m do\n    Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n    let a = x-1 in let b = y-1 in \n    arr.(a) <- (max h.(b) arr.(a)); arr.(b) <- (max h.(a) arr.(b))\n  done;\n  print_int\n    (List.fold_left (fun i v -> if h.(v) > arr.(v) then i+1 else i) 0 (make_list (n-1)))", "language": "OCaml", "metadata": {"date": 1588707705, "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/s430275928.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s430275928", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Array\nlet () =\n  let rec make_list n = if n = 0 then [0] else n :: make_list (n-1) in\n  let n,m = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let h = init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let arr = make n 0 in\n  for i = 1 to m do\n    Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n    let a = x-1 in let b = y-1 in \n    arr.(a) <- (max h.(b) arr.(a)); arr.(b) <- (max h.(a) arr.(b))\n  done;\n  print_int\n    (List.fold_left (fun i v -> if h.(v) > arr.(v) then i+1 else i) 0 (make_list (n-1)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 505, "cpu_time_ms": 64, "memory_kb": 11252}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s170602253", "group_id": "codeNet:p02690", "input_text": "let x = Scanf.sscanf (read_line ()) \"%d\" @@ fun x -> x\n\nlet pow n a = Array.fold_left ( * ) 1 @@ Array.make a n\n\nlet () =\n  for a = -200 to 200 do\n    for b = -200 to 200 do\n      if pow a 5 - pow b 5 = x then begin\n        Printf.printf \"%d %d\\n\" a b;\n        exit 0\n      end\n    done\n  done\n\n", "language": "OCaml", "metadata": {"date": 1590020591, "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/s170602253.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s170602253", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "let x = Scanf.sscanf (read_line ()) \"%d\" @@ fun x -> x\n\nlet pow n a = Array.fold_left ( * ) 1 @@ Array.make a n\n\nlet () =\n  for a = -200 to 200 do\n    for b = -200 to 200 do\n      if pow a 5 - pow b 5 = x then begin\n        Printf.printf \"%d %d\\n\" a b;\n        exit 0\n      end\n    done\n  done\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 21, "memory_kb": 5824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s777655398", "group_id": "codeNet:p02690", "input_text": "open Batteries\nlet x = read_int ()\n\nlet rec loop a =\n  let rec loop2 b =\n    if b >= 1000 then (0, 0) else\n    if ((a * a * a * a * a) - (b*b*b*b*b)) = x then (a, b) else loop2 (b+1)\n  in if a >= 1000 then (0, 0) else (\n  let a_, b_ = loop2 (-1000) in\n  if a_ = 0 && b_ = 0 then loop (a+1) else (a_, b_)\n)\nlet a, b = loop (-1000)\nlet _ = Printf.printf \"%d %d\\n\" a b\n\n", "language": "OCaml", "metadata": {"date": 1588558113, "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/s777655398.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777655398", "user_id": "u511870776"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "open Batteries\nlet x = read_int ()\n\nlet rec loop a =\n  let rec loop2 b =\n    if b >= 1000 then (0, 0) else\n    if ((a * a * a * a * a) - (b*b*b*b*b)) = x then (a, b) else loop2 (b+1)\n  in if a >= 1000 then (0, 0) else (\n  let a_, b_ = loop2 (-1000) in\n  if a_ = 0 && b_ = 0 then loop (a+1) else (a_, b_)\n)\nlet a, b = loop (-1000)\nlet _ = Printf.printf \"%d %d\\n\" a b\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 19, "memory_kb": 5388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s689282615", "group_id": "codeNet:p02692", "input_text": "open Batteries\nopen Tuple\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,a,b,c) = scan \"%d %d %d %d\" Tuple4.make\nlet coms = scan_lines n \"%s\" id\n\nopen Option.Infix\nopen Option.Monad\n\nlet rec solve1 a b c= function\n  | [] -> Some []\n  | com::rest ->\n    match com with\n    | \"AB\" ->\n      if a = 0 && b = 0 then None\n      else if a = 1 then\n        solve1 (pred a) (succ b) c rest >>= fun ret ->\n        return (\"B\" :: ret)\n      else\n        solve1 (succ a) (pred b) c rest >>= fun ret ->\n        return (\"A\" :: ret)\n    | \"BC\" ->\n      if b = 0 && c = 0 then None\n      else if b = 1 then\n        solve1 a (pred b) (succ c) rest >>= fun ret ->\n        return (\"C\" :: ret)\n      else\n        solve1 a (succ b) (pred c) rest >>= fun ret ->\n        return (\"B\" :: ret)\n    | \"AC\" ->\n      if a = 0 && c = 0 then None\n      else if c = 1 then\n        solve1 (succ a) b (pred c) rest >>= fun ret ->\n        return (\"A\" :: ret)\n      else solve1 (pred a) b (succ c) rest >>= fun ret ->\n        return (\"C\" :: ret)\n    | _ ->  None\n\nlet rec solven a b c = function\n  | [] -> Some []\n  | com :: rest ->\n    begin\n      match com with\n      | \"AB\" ->\n        if a > b then\n          solven (pred a) (succ b) c rest >>= fun ret ->\n          return (\"B\"::ret)\n        else\n          solven (succ a) (pred b) c rest >>= fun ret ->\n          return (\"A\"::ret)\n      | \"BC\" ->\n        if b > c then\n          solven a (pred b) (succ c) rest >>= fun ret ->\n          return (\"C\"::ret)\n        else\n          solven a (succ b) (pred c) rest >>= fun ret ->\n          return (\"B\"::ret)\n      | \"AC\" ->\n        if a > c then\n          solven (pred a) b (succ c) rest >>= fun ret ->\n          return (\"C\"::ret)\n        else\n          solven (succ a) b (pred c) rest >>= fun ret ->\n          return (\"A\"::ret)\n      | _ -> None\n    end\n\nlet rec solve2 a b c = function\n  | [] -> Some []\n  | com :: rest ->\n    begin\n      match com with\n      | \"AB\" ->\n        if a = 1 && b = 1 && List.at_opt rest 0 |> Option.is_some then\n          let next = List.at rest 0 in\n          match next with\n          | \"AB\" -> solve2 (pred a) (succ b) c rest >>= fun ret ->\n            return (\"B\"::ret)\n          | \"AC\" -> solve2 (succ a) (pred b) c rest >>= fun ret ->\n            return (\"A\"::ret)\n          | \"BC\" -> solve2 (pred a) (succ b) c rest >>= fun ret ->\n            return (\"B\"::ret)\n          | _ -> None\n        else if a = 0 then\n          solve2 (succ a) (pred b) c rest >>= fun ret ->\n          return (\"A\" :: ret)\n        else\n          solve2 (pred a) (succ b) c rest >>= fun ret ->\n          return (\"B\" :: ret)\n      | \"BC\" ->\n        if b = 1 && c= 1 && List.at_opt rest 0 |> Option.is_some then\n          let next = List.at rest 0 in\n          match next with\n          | \"AB\" -> solve2 a (succ b) (pred c) rest >>= fun ret ->\n            return (\"B\" :: ret)\n          | \"BC\" -> solve2 a (pred b) (succ c) rest >>= fun ret ->\n            return (\"C\"::ret)\n          | \"AC\" -> solve2 a (pred b) (succ c) rest >>= fun ret ->\n            return (\"C\"::ret)\n          | _ -> None\n        else if b = 0 then\n          solve2 a (succ b) (pred c) rest >>= fun ret ->\n          return (\"B\" :: ret)\n        else\n          solve2 a (pred b) (succ c) rest >>= fun ret ->\n          return (\"C\" :: ret)\n      | \"AC\" ->\n        if c = 1 && a = 1 && List.at_opt rest 0 |> Option.is_some then\n          let next = List.at rest 0 in\n          match next with\n          | \"AB\" -> solve2 (succ a) b (pred c) rest >>= fun ret ->\n            return (\"A\" :: ret)\n          | \"BC\" -> solve2 (pred a) b (succ c) rest >>= fun ret ->\n            return (\"C\"::ret)\n          | \"AC\" -> solve2 (succ a) b (pred c) rest >>= fun ret ->\n            return (\"A\"::ret)\n          | _ -> None\n        else if c = 0 then\n          solve2 (pred a) b (succ c) rest >>= fun ret ->\n          return (\"C\" :: ret)\n        else\n          solve2 (succ a) b (pred c) rest >>= fun ret ->\n          return (\"A\" :: ret)\n      | _ -> None\n    end\n\nlet () =\n  (match List.first coms with\n   | \"AB\" when a = 0 && b = 0 -> None\n   | \"BC\" when b = 0 && c = 0 -> None\n   | \"AC\" when a = 0 && c = 0 -> None\n   | _ ->\n     if a + b + c = 1 then\n       solve1 a b c coms\n     else if a + b + c = 2 then\n       solve2 a b c coms\n     else\n       solven a b c coms)\n  |> Option.map_default (fun ans -> \"Yes\\n\" ^ String.join \"\\n\" ans) \"No\"\n  |> Printf.printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1588778802, "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/s689282615.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s689282615", "user_id": "u802614675"}, "prompt_components": {"gold_output": "Yes\nA\nC\n", "input_to_evaluate": "open Batteries\nopen Tuple\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,a,b,c) = scan \"%d %d %d %d\" Tuple4.make\nlet coms = scan_lines n \"%s\" id\n\nopen Option.Infix\nopen Option.Monad\n\nlet rec solve1 a b c= function\n  | [] -> Some []\n  | com::rest ->\n    match com with\n    | \"AB\" ->\n      if a = 0 && b = 0 then None\n      else if a = 1 then\n        solve1 (pred a) (succ b) c rest >>= fun ret ->\n        return (\"B\" :: ret)\n      else\n        solve1 (succ a) (pred b) c rest >>= fun ret ->\n        return (\"A\" :: ret)\n    | \"BC\" ->\n      if b = 0 && c = 0 then None\n      else if b = 1 then\n        solve1 a (pred b) (succ c) rest >>= fun ret ->\n        return (\"C\" :: ret)\n      else\n        solve1 a (succ b) (pred c) rest >>= fun ret ->\n        return (\"B\" :: ret)\n    | \"AC\" ->\n      if a = 0 && c = 0 then None\n      else if c = 1 then\n        solve1 (succ a) b (pred c) rest >>= fun ret ->\n        return (\"A\" :: ret)\n      else solve1 (pred a) b (succ c) rest >>= fun ret ->\n        return (\"C\" :: ret)\n    | _ ->  None\n\nlet rec solven a b c = function\n  | [] -> Some []\n  | com :: rest ->\n    begin\n      match com with\n      | \"AB\" ->\n        if a > b then\n          solven (pred a) (succ b) c rest >>= fun ret ->\n          return (\"B\"::ret)\n        else\n          solven (succ a) (pred b) c rest >>= fun ret ->\n          return (\"A\"::ret)\n      | \"BC\" ->\n        if b > c then\n          solven a (pred b) (succ c) rest >>= fun ret ->\n          return (\"C\"::ret)\n        else\n          solven a (succ b) (pred c) rest >>= fun ret ->\n          return (\"B\"::ret)\n      | \"AC\" ->\n        if a > c then\n          solven (pred a) b (succ c) rest >>= fun ret ->\n          return (\"C\"::ret)\n        else\n          solven (succ a) b (pred c) rest >>= fun ret ->\n          return (\"A\"::ret)\n      | _ -> None\n    end\n\nlet rec solve2 a b c = function\n  | [] -> Some []\n  | com :: rest ->\n    begin\n      match com with\n      | \"AB\" ->\n        if a = 1 && b = 1 && List.at_opt rest 0 |> Option.is_some then\n          let next = List.at rest 0 in\n          match next with\n          | \"AB\" -> solve2 (pred a) (succ b) c rest >>= fun ret ->\n            return (\"B\"::ret)\n          | \"AC\" -> solve2 (succ a) (pred b) c rest >>= fun ret ->\n            return (\"A\"::ret)\n          | \"BC\" -> solve2 (pred a) (succ b) c rest >>= fun ret ->\n            return (\"B\"::ret)\n          | _ -> None\n        else if a = 0 then\n          solve2 (succ a) (pred b) c rest >>= fun ret ->\n          return (\"A\" :: ret)\n        else\n          solve2 (pred a) (succ b) c rest >>= fun ret ->\n          return (\"B\" :: ret)\n      | \"BC\" ->\n        if b = 1 && c= 1 && List.at_opt rest 0 |> Option.is_some then\n          let next = List.at rest 0 in\n          match next with\n          | \"AB\" -> solve2 a (succ b) (pred c) rest >>= fun ret ->\n            return (\"B\" :: ret)\n          | \"BC\" -> solve2 a (pred b) (succ c) rest >>= fun ret ->\n            return (\"C\"::ret)\n          | \"AC\" -> solve2 a (pred b) (succ c) rest >>= fun ret ->\n            return (\"C\"::ret)\n          | _ -> None\n        else if b = 0 then\n          solve2 a (succ b) (pred c) rest >>= fun ret ->\n          return (\"B\" :: ret)\n        else\n          solve2 a (pred b) (succ c) rest >>= fun ret ->\n          return (\"C\" :: ret)\n      | \"AC\" ->\n        if c = 1 && a = 1 && List.at_opt rest 0 |> Option.is_some then\n          let next = List.at rest 0 in\n          match next with\n          | \"AB\" -> solve2 (succ a) b (pred c) rest >>= fun ret ->\n            return (\"A\" :: ret)\n          | \"BC\" -> solve2 (pred a) b (succ c) rest >>= fun ret ->\n            return (\"C\"::ret)\n          | \"AC\" -> solve2 (succ a) b (pred c) rest >>= fun ret ->\n            return (\"A\"::ret)\n          | _ -> None\n        else if c = 0 then\n          solve2 (pred a) b (succ c) rest >>= fun ret ->\n          return (\"C\" :: ret)\n        else\n          solve2 (succ a) b (pred c) rest >>= fun ret ->\n          return (\"A\" :: ret)\n      | _ -> None\n    end\n\nlet () =\n  (match List.first coms with\n   | \"AB\" when a = 0 && b = 0 -> None\n   | \"BC\" when b = 0 && c = 0 -> None\n   | \"AC\" when a = 0 && c = 0 -> None\n   | _ ->\n     if a + b + c = 1 then\n       solve1 a b c coms\n     else if a + b + c = 2 then\n       solve2 a b c coms\n     else\n       solven a b c coms)\n  |> Option.map_default (fun ans -> \"Yes\\n\" ^ String.join \"\\n\" ans) \"No\"\n  |> Printf.printf \"%s\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6165, "cpu_time_ms": 70, "memory_kb": 19976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s669406671", "group_id": "codeNet:p02693", "input_text": "let () = Scanf.scanf \"%d\\n %d %d\" @@ fun k a b ->\n  print_endline @@\n  try \n    for i = a to b do\n      if i mod k = 0 then raise Not_found else ()\n    done;\n    \"NG\"\n  with Not_found -> \"OK\"", "language": "OCaml", "metadata": {"date": 1591656636, "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/s669406671.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s669406671", "user_id": "u052332717"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n %d %d\" @@ fun k a b ->\n  print_endline @@\n  try \n    for i = a to b do\n      if i mod k = 0 then raise Not_found else ()\n    done;\n    \"NG\"\n  with Not_found -> \"OK\"", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 191, "cpu_time_ms": 4, "memory_kb": 3744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s447739686", "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*k+k <= b || b mod k = 0 then \"OK\" else \"NG\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588468868, "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/s447739686.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s447739686", "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*k+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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s998699638", "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 k = 1 then \"OK\" else if b/k - a/k > 0 then \"OK\" else \"NG\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588468424, "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/s998699638.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998699638", "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 k = 1 then \"OK\" else if b/k - a/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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 3720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s948678807", "group_id": "codeNet:p02695", "input_text": "let n, m, q = Scanf.scanf \"%d %d %d\\n\" (fun n m q -> n, m, q)\n\nlet a = Array.make q 0\nlet b = Array.make q 0\nlet c = Array.make q 0\nlet d = Array.make q 0\n\nlet rec f i =\n  if i < q then (\n      Scanf.scanf \"%d %d %d %d\\n\" (fun w x y z ->\n      a.(i) <- w - 1;\n      b.(i) <- x - 1;\n      c.(i) <- y;\n      d.(i) <- z\n    );\n    f (i + 1)\n  )\n\nlet rec g i j e ans =\n  if j = n then (\n      let rec h i ans =\n        if i = q then ans\n        else h (i + 1) (ans + if e.(b.(i)) - e.(a.(i)) = c.(i) then d.(i) else 0)\n      in h 0 0\n  ) else (\n      let rec h i ans =\n        if i = m + 1 then ans\n        else (\n            e.(j) <- i;\n            h (i + 1) (max ans (g i (j + 1) e ans))\n        )\n      in h i 0\n  )\n\nlet () =\n  f 0;\n  let ans = g 1 0 (Array.make n 0) 0 in\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1597951470, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02695.html", "problem_id": "p02695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02695/input.txt", "sample_output_relpath": "derived/input_output/data/p02695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02695/OCaml/s948678807.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s948678807", "user_id": "u752907799"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "let n, m, q = Scanf.scanf \"%d %d %d\\n\" (fun n m q -> n, m, q)\n\nlet a = Array.make q 0\nlet b = Array.make q 0\nlet c = Array.make q 0\nlet d = Array.make q 0\n\nlet rec f i =\n  if i < q then (\n      Scanf.scanf \"%d %d %d %d\\n\" (fun w x y z ->\n      a.(i) <- w - 1;\n      b.(i) <- x - 1;\n      c.(i) <- y;\n      d.(i) <- z\n    );\n    f (i + 1)\n  )\n\nlet rec g i j e ans =\n  if j = n then (\n      let rec h i ans =\n        if i = q then ans\n        else h (i + 1) (ans + if e.(b.(i)) - e.(a.(i)) = c.(i) then d.(i) else 0)\n      in h 0 0\n  ) else (\n      let rec h i ans =\n        if i = m + 1 then ans\n        else (\n            e.(j) <- i;\n            h (i + 1) (max ans (g i (j + 1) e ans))\n        )\n      in h i 0\n  )\n\nlet () =\n  f 0;\n  let ans = g 1 0 (Array.make n 0) 0 in\n  Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "sample_input": "3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02695", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 799, "cpu_time_ms": 45, "memory_kb": 5852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s379874789", "group_id": "codeNet:p02695", "input_text": "let tuple3 a b c = (a, b, c)\n;;\n\nlet tuple4 a b c d = (a, b, c, d)\n;;\n\nlet rec f n m list a_list min =\n  if Array.length a_list == n\n  then\n    list\n    |> List.filter_map\n      (fun (a, b, c, d) -> if a_list.(b-1) - a_list.(a-1) == c then Option.some d else Option.none) \n    |> List.fold_left (+) 0\n  else\n    List.init (m - min + 1) ((+) min)\n    |> List.map (fun min -> f n m list (Array.append a_list [|min|]) min)\n    |> List.fold_left max 0\n;;\n\nlet () =\n  let n, m, q = Scanf.scanf \"%d %d %d\\n\" tuple3 in\n  let list = List.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" tuple4) in\n  let res = f n m list [||] 1 in\n  Printf.printf \"%d\\n\" res\n;;", "language": "OCaml", "metadata": {"date": 1588485386, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02695.html", "problem_id": "p02695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02695/input.txt", "sample_output_relpath": "derived/input_output/data/p02695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02695/OCaml/s379874789.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379874789", "user_id": "u084305300"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "let tuple3 a b c = (a, b, c)\n;;\n\nlet tuple4 a b c d = (a, b, c, d)\n;;\n\nlet rec f n m list a_list min =\n  if Array.length a_list == n\n  then\n    list\n    |> List.filter_map\n      (fun (a, b, c, d) -> if a_list.(b-1) - a_list.(a-1) == c then Option.some d else Option.none) \n    |> List.fold_left (+) 0\n  else\n    List.init (m - min + 1) ((+) min)\n    |> List.map (fun min -> f n m list (Array.append a_list [|min|]) min)\n    |> List.fold_left max 0\n;;\n\nlet () =\n  let n, m, q = Scanf.scanf \"%d %d %d\\n\" tuple3 in\n  let list = List.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" tuple4) in\n  let res = f n m list [||] 1 in\n  Printf.printf \"%d\\n\" res\n;;", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "sample_input": "3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02695", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 648, "cpu_time_ms": 54, "memory_kb": 5848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s091806873", "group_id": "codeNet:p02695", "input_text": "let tuple3 a b c = (a, b, c)\n;;\n\nlet tuple4 a b c d = (a, b, c, d)\n;;\n\nlet rec f n m list a_list min =\n  if Array.length a_list == n\n  then\n    list\n    |> List.filter_map\n      (fun (a, b, c, d) -> if a_list.(b-1) - a_list.(a-1) == c then Option.some d else Option.none) \n    |> List.fold_left (+) 0\n  else\n    List.init (m - min + 1) ((+) min)\n    |> List.map (fun min -> f n m list (Array.append a_list [|min|]) min)\n    |> List.fold_left max 0\n;;\n\nlet () =\n  let n, m, q = Scanf.scanf \"%d %d %d\" tuple3 in\n  let list = List.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" tuple4) in\n  let res = f n m list [||] 1 in\n  Printf.printf \"%d\\n\" res\n;;", "language": "OCaml", "metadata": {"date": 1588485361, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02695.html", "problem_id": "p02695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02695/input.txt", "sample_output_relpath": "derived/input_output/data/p02695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02695/OCaml/s091806873.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s091806873", "user_id": "u084305300"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "let tuple3 a b c = (a, b, c)\n;;\n\nlet tuple4 a b c d = (a, b, c, d)\n;;\n\nlet rec f n m list a_list min =\n  if Array.length a_list == n\n  then\n    list\n    |> List.filter_map\n      (fun (a, b, c, d) -> if a_list.(b-1) - a_list.(a-1) == c then Option.some d else Option.none) \n    |> List.fold_left (+) 0\n  else\n    List.init (m - min + 1) ((+) min)\n    |> List.map (fun min -> f n m list (Array.append a_list [|min|]) min)\n    |> List.fold_left max 0\n;;\n\nlet () =\n  let n, m, q = Scanf.scanf \"%d %d %d\" tuple3 in\n  let list = List.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" tuple4) in\n  let res = f n m list [||] 1 in\n  Printf.printf \"%d\\n\" res\n;;", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "sample_input": "3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02695", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 646, "cpu_time_ms": 3, "memory_kb": 3832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s202549295", "group_id": "codeNet:p02695", "input_text": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m q ->\n  let abcds = Array.init q @@ fun _ ->\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d -> a, b, c, d in\n  let ass =\n    List.init n (Fun.const ())\n    |> Fun.flip List.fold_left [(m, [])] (fun nass () ->\n        List.concat @@\n        Fun.flip List.map nass @@ fun (n, as_) ->\n          List.init n @@ fun a -> (a + 1, a + 1 :: as_))\n    |> List.map snd\n    |> List.map Array.of_list in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun m as_ ->\n    max m @@\n    Array.fold_right (fun (a, b, c, d) -> ( + ) @@\n      if as_.(b - 1) - as_.(a - 1) = c then d else 0) abcds 0) min_int ass\n  \n\n", "language": "OCaml", "metadata": {"date": 1588470545, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02695.html", "problem_id": "p02695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02695/input.txt", "sample_output_relpath": "derived/input_output/data/p02695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02695/OCaml/s202549295.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202549295", "user_id": "u504158101"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m q ->\n  let abcds = Array.init q @@ fun _ ->\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d -> a, b, c, d in\n  let ass =\n    List.init n (Fun.const ())\n    |> Fun.flip List.fold_left [(m, [])] (fun nass () ->\n        List.concat @@\n        Fun.flip List.map nass @@ fun (n, as_) ->\n          List.init n @@ fun a -> (a + 1, a + 1 :: as_))\n    |> List.map snd\n    |> List.map Array.of_list in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun m as_ ->\n    max m @@\n    Array.fold_right (fun (a, b, c, d) -> ( + ) @@\n      if as_.(b - 1) - as_.(a - 1) = c then d else 0) abcds 0) min_int ass\n  \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "sample_input": "3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02695", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 133, "memory_kb": 25348}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s101265314", "group_id": "codeNet:p02696", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b n ->\n  let x = min (b - 1) n in\n  let ans = a * x / b - x / b * a in\n  Printf.printf \"%d\\n\" ans\n)\n", "language": "OCaml", "metadata": {"date": 1597952702, "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/s101265314.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s101265314", "user_id": "u752907799"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b n ->\n  let x = min (b - 1) n in\n  let ans = a * x / b - x / b * a in\n  Printf.printf \"%d\\n\" ans\n)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 130, "cpu_time_ms": 7, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s026933599", "group_id": "codeNet:p02696", "input_text": "let tuple3 a b c = (a, b, c)\n;;\n\nlet tuple4 a b c d = (a, b, c, d)\n;;\n\nlet rec f a_list min n m list =\n  if Array.length a_list == n\n  then\n    list\n    |> List.filter_map\n      (fun (a, b, c, d) -> if a_list.(b-1) - a_list.(a-1) == c then Option.some d else Option.none) \n    |> List.fold_left (+) 0\n  else\n    List.init (m - min + 1) ((+) min)\n    |> List.map (fun min -> f (Array.append a_list [|min|]) min n m list)\n    |> List.fold_left max 0\n;;\n\nlet () =\n  let n, m, q = Scanf.scanf \"%d %d %d\\n\" tuple3 in\n  let list = List.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" tuple4) in\n  let res = f [||] 1 n m list in\n  Printf.printf \"%d\\n\" res\n;;", "language": "OCaml", "metadata": {"date": 1588484178, "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/s026933599.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s026933599", "user_id": "u084305300"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let tuple3 a b c = (a, b, c)\n;;\n\nlet tuple4 a b c d = (a, b, c, d)\n;;\n\nlet rec f a_list min n m list =\n  if Array.length a_list == n\n  then\n    list\n    |> List.filter_map\n      (fun (a, b, c, d) -> if a_list.(b-1) - a_list.(a-1) == c then Option.some d else Option.none) \n    |> List.fold_left (+) 0\n  else\n    List.init (m - min + 1) ((+) min)\n    |> List.map (fun min -> f (Array.append a_list [|min|]) min n m list)\n    |> List.fold_left max 0\n;;\n\nlet () =\n  let n, m, q = Scanf.scanf \"%d %d %d\\n\" tuple3 in\n  let list = List.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" tuple4) in\n  let res = f [||] 1 n m list in\n  Printf.printf \"%d\\n\" res\n;;", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 648, "cpu_time_ms": 4, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s772108916", "group_id": "codeNet:p02696", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b n ->\n  Printf.printf \"%d\\n\" @@\n  if b - 1 <= n\n  then a * (b - 1) / b\n  else a * n / b\n", "language": "OCaml", "metadata": {"date": 1588470793, "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/s772108916.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772108916", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b n ->\n  Printf.printf \"%d\\n\" @@\n  if b - 1 <= n\n  then a * (b - 1) / b\n  else a * n / b\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 130, "cpu_time_ms": 2, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s837100094", "group_id": "codeNet:p02701", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let s = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n    Array.sort compare s;\n    let rec loop i prev acc =\n        if i = n then acc else\n            if s.(i) = prev then loop (i + 1) prev acc\n                            else loop (i + 1) s.(i) (acc + 1)\n    in\n    loop 1 s.(0) 1 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1587949566, "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/s837100094.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s837100094", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let s = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n    Array.sort compare s;\n    let rec loop i prev acc =\n        if i = n then acc else\n            if s.(i) = prev then loop (i + 1) prev acc\n                            else loop (i + 1) s.(i) (acc + 1)\n    in\n    loop 1 s.(0) 1 |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 176, "memory_kb": 12688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s761047186", "group_id": "codeNet:p02706", "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) = scan \"%d %d\" Tuple2.make\nlet arr = scan_array ~sep:' ' Int.of_string\n\nlet () =\n  if n < Array.sum arr then Printf.printf \"-1\\n\"\n  else Printf.printf \"%d\\n\" @@ n - Array.sum arr\n", "language": "OCaml", "metadata": {"date": 1592544649, "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/s761047186.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s761047186", "user_id": "u802614675"}, "prompt_components": {"gold_output": "30\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) = scan \"%d %d\" Tuple2.make\nlet arr = scan_array ~sep:' ' Int.of_string\n\nlet () =\n  if n < Array.sum arr then Printf.printf \"-1\\n\"\n  else Printf.printf \"%d\\n\" @@ n - Array.sum arr\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2275, "cpu_time_ms": 9, "memory_kb": 6132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s910092782", "group_id": "codeNet:p02707", "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 = scan \"%d\" id\nlet a = scan_array ~sep:' ' Int.of_string\n\nlet () =\n  let h = Hashtbl.create n in\n  ArrayL.iter a ~f:(fun i ->\n      Hashtbl.modify_def 0 (pred i) succ h);\n  ListL.iter (0++^n) ~f:(fun i ->\n      Printf.printf \"%d\" @@ Hashtbl.find_default h i 0\n    )\n", "language": "OCaml", "metadata": {"date": 1592545456, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02707/input.txt", "sample_output_relpath": "derived/input_output/data/p02707/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02707/OCaml/s910092782.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s910092782", "user_id": "u802614675"}, "prompt_components": {"gold_output": "2\n2\n0\n0\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 = 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 = scan \"%d\" id\nlet a = scan_array ~sep:' ' Int.of_string\n\nlet () =\n  let h = Hashtbl.create n in\n  ArrayL.iter a ~f:(fun i ->\n      Hashtbl.modify_def 0 (pred i) succ h);\n  ListL.iter (0++^n) ~f:(fun i ->\n      Printf.printf \"%d\" @@ Hashtbl.find_default h i 0\n    )\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "sample_input": "5\n1 1 2 2\n"}, "reference_outputs": ["2\n2\n0\n0\n0\n"], "source_document_id": "p02707", "source_text": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2358, "cpu_time_ms": 168, "memory_kb": 29548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s666815789", "group_id": "codeNet:p02707", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) 0 in\n    for i = 2 to n do\n        Scanf.scanf \" %d\" (fun j -> a.(j) <- a.(j) + 1)\n    done;\n    for i = 1 to n do\n        Printf.printf \"%d\\n\" a.(i)\n    done\n)", "language": "OCaml", "metadata": {"date": 1587345009, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02707/input.txt", "sample_output_relpath": "derived/input_output/data/p02707/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02707/OCaml/s666815789.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666815789", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) 0 in\n    for i = 2 to n do\n        Scanf.scanf \" %d\" (fun j -> a.(j) <- a.(j) + 1)\n    done;\n    for i = 1 to n do\n        Printf.printf \"%d\\n\" a.(i)\n    done\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "sample_input": "5\n1 1 2 2\n"}, "reference_outputs": ["2\n2\n0\n0\n0\n"], "source_document_id": "p02707", "source_text": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 76, "memory_kb": 7572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s565470580", "group_id": "codeNet:p02708", "input_text": "Scanf.scanf \"%d %d\" (fun n k ->\n    let m = 1_000_000_000 + 7 in\n    let (+@) a b = (a + b) mod m in\n    let rec loop i acc =\n        if i > n + 1 then acc else\n            let mi = i * (i - 1) / 2 in\n            let ma = n * i - mi in\n            loop (i + 1) (acc +@ (ma - mi + 1))\n    in\n    loop k 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1587345921, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/OCaml/s565470580.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565470580", "user_id": "u342443598"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n k ->\n    let m = 1_000_000_000 + 7 in\n    let (+@) a b = (a + b) mod m in\n    let rec loop i acc =\n        if i > n + 1 then acc else\n            let mi = i * (i - 1) / 2 in\n            let ma = n * i - mi in\n            loop (i + 1) (acc +@ (ma - mi + 1))\n    in\n    loop k 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 7, "memory_kb": 3828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s967419364", "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)) 0 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": 1596008328, "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/s967419364.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s967419364", "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)) 0 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 217, "memory_kb": 53344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s522474195", "group_id": "codeNet:p02712", "input_text": "(* unihernandez22\n * https://atcoder.jp/contests/abc162/tasks/abc162_b\n * implementation\n * *)\n\nPrintf.printf \"%d\\n\" @@\nScanf.scanf \"%d\\n\" @@ fun n ->\n    let ans = ref 0 in\n    for i = 1 to n do\n        if (i mod 3 != 0) && (i mod 5 != 0) then\n            ans := !ans + i;\n    done;\n    !ans\n", "language": "OCaml", "metadata": {"date": 1593673842, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02712/input.txt", "sample_output_relpath": "derived/input_output/data/p02712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02712/OCaml/s522474195.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522474195", "user_id": "u878654696"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "(* unihernandez22\n * https://atcoder.jp/contests/abc162/tasks/abc162_b\n * implementation\n * *)\n\nPrintf.printf \"%d\\n\" @@\nScanf.scanf \"%d\\n\" @@ fun n ->\n    let ans = ref 0 in\n    for i = 1 to n do\n        if (i mod 3 != 0) && (i mod 5 != 0) then\n            ans := !ans + i;\n    done;\n    !ans\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "sample_input": "15\n"}, "reference_outputs": ["60\n"], "source_document_id": "p02712", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 10, "memory_kb": 3736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s117681235", "group_id": "codeNet:p02712", "input_text": "open Batteries\nlet n = read_int()\nlet rec loop i sum = \n  if i > n then sum else\n  if i mod 5 = 0 || i mod 3 = 0 then loop (i+1) sum else\n  loop (i+1) (sum+i)\n\nlet _ = Printf.printf \"%d\\n\" @@ loop 1 0\n", "language": "OCaml", "metadata": {"date": 1586739983, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02712/input.txt", "sample_output_relpath": "derived/input_output/data/p02712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02712/OCaml/s117681235.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117681235", "user_id": "u511870776"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "open Batteries\nlet n = read_int()\nlet rec loop i sum = \n  if i > n then sum else\n  if i mod 5 = 0 || i mod 3 = 0 then loop (i+1) sum else\n  loop (i+1) (sum+i)\n\nlet _ = Printf.printf \"%d\\n\" @@ loop 1 0\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "sample_input": "15\n"}, "reference_outputs": ["60\n"], "source_document_id": "p02712", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 10, "memory_kb": 5244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s029631895", "group_id": "codeNet:p02719", "input_text": "let rec check n k =\n  if n <= k && n <= abs (n - k) then n\n  else if n <= k && n > abs (n - k) then abs (n - k)\n  else\n    let md = n mod k in\n    check md k\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b)) in\n  print_int @@ check n k", "language": "OCaml", "metadata": {"date": 1586050609, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02719/input.txt", "sample_output_relpath": "derived/input_output/data/p02719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02719/OCaml/s029631895.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029631895", "user_id": "u575440531"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let rec check n k =\n  if n <= k && n <= abs (n - k) then n\n  else if n <= k && n > abs (n - k) then abs (n - k)\n  else\n    let md = n mod k in\n    check md k\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b)) in\n  print_int @@ check n k", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751736828", "group_id": "codeNet:p02720", "input_text": "let rec solve n k candidates =\n  if k < n\n  then List.nth candidates k\n  else\n    let n', candidates' =\n      List.fold_left (fun (n', candidates') x ->\n        match x mod 10 with\n        | 0 -> (n' + 2, 10 * x + 1 :: 10 * x :: candidates')\n        | 9 -> (n' + 2, 10 * x + 9 :: 10 * x + 8 :: candidates')\n        | _ -> (n' + 3, 10 * x + x mod 10 + 1 :: 10 * x + x mod 10 :: 10 * x + x mod 10 - 1 :: candidates')) (0, []) candidates in\n    solve n' (k - n) @@ List.rev candidates'\nlet solve k = solve 9 k [1; 2; 3; 4; 5; 6; 7; 8; 9]\n\nlet () = Scanf.scanf \"%d\" @@ fun k ->\n  Printf.printf \"%d\\n\" @@ solve @@ k - 1", "language": "OCaml", "metadata": {"date": 1586049861, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02720.html", "problem_id": "p02720", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02720/input.txt", "sample_output_relpath": "derived/input_output/data/p02720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02720/OCaml/s751736828.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751736828", "user_id": "u504158101"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "let rec solve n k candidates =\n  if k < n\n  then List.nth candidates k\n  else\n    let n', candidates' =\n      List.fold_left (fun (n', candidates') x ->\n        match x mod 10 with\n        | 0 -> (n' + 2, 10 * x + 1 :: 10 * x :: candidates')\n        | 9 -> (n' + 2, 10 * x + 9 :: 10 * x + 8 :: candidates')\n        | _ -> (n' + 3, 10 * x + x mod 10 + 1 :: 10 * x + x mod 10 :: 10 * x + x mod 10 - 1 :: candidates')) (0, []) candidates in\n    solve n' (k - n) @@ List.rev candidates'\nlet solve k = solve 9 k [1; 2; 3; 4; 5; 6; 7; 8; 9]\n\nlet () = Scanf.scanf \"%d\" @@ fun k ->\n  Printf.printf \"%d\\n\" @@ solve @@ k - 1", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA positive integer X is said to be a lunlun number if and only if the following condition is satisfied:\n\nIn the base ten representation of X (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most 1.\n\nFor example, 1234, 1, and 334 are lunlun numbers, while none of 31415, 119, or 13579 is.\n\nYou are given a positive integer K. Find the K-th smallest lunlun number.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n23\n\nWe will list the 15 smallest lunlun numbers in ascending order:\n\n1,\n2,\n3,\n4,\n5,\n6,\n7,\n8,\n9,\n10,\n11,\n12,\n21,\n22,\n23.\n\nThus, the answer is 23.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n13\n\nSample Output 3\n\n21\n\nSample Input 4\n\n100000\n\nSample Output 4\n\n3234566667\n\nNote that the answer may not fit into the 32-bit signed integer type.", "sample_input": "15\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02720", "source_text": "Score : 400 points\n\nProblem Statement\n\nA positive integer X is said to be a lunlun number if and only if the following condition is satisfied:\n\nIn the base ten representation of X (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most 1.\n\nFor example, 1234, 1, and 334 are lunlun numbers, while none of 31415, 119, or 13579 is.\n\nYou are given a positive integer K. Find the K-th smallest lunlun number.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n23\n\nWe will list the 15 smallest lunlun numbers in ascending order:\n\n1,\n2,\n3,\n4,\n5,\n6,\n7,\n8,\n9,\n10,\n11,\n12,\n21,\n22,\n23.\n\nThus, the answer is 23.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n13\n\nSample Output 3\n\n21\n\nSample Input 4\n\n100000\n\nSample Output 4\n\n3234566667\n\nNote that the answer may not fit into the 32-bit signed integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 614, "cpu_time_ms": 17, "memory_kb": 8576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s578265918", "group_id": "codeNet:p02723", "input_text": "open Printf\nopen Scanf\n\nlet solve s =\n  if s.[2] = s.[3] && s.[4] = s.[5] then \"Yes\" else \"No\"\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1585679860, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02723.html", "problem_id": "p02723", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02723/input.txt", "sample_output_relpath": "derived/input_output/data/p02723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02723/OCaml/s578265918.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578265918", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s =\n  if s.[2] = s.[3] && s.[4] = s.[5] then \"Yes\" else \"No\"\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "sample_input": "sippuu\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02723", "source_text": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s115764061", "group_id": "codeNet:p02724", "input_text": "let hisHappiness money = \n\tlet hapiness500 = money / 500 * 1000 in\n\tlet hapiness5 = (money mod 1000) / 5 * 5 in\n\thapiness500 + hapiness5 ;;\nlet () = read_line() |> int_of_string |> hisHappiness |> string_of_int |> print_string", "language": "OCaml", "metadata": {"date": 1588185882, "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/s115764061.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s115764061", "user_id": "u728239524"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "let hisHappiness money = \n\tlet hapiness500 = money / 500 * 1000 in\n\tlet hapiness5 = (money mod 1000) / 5 * 5 in\n\thapiness500 + hapiness5 ;;\nlet () = read_line() |> int_of_string |> hisHappiness |> string_of_int |> print_string", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s135321210", "group_id": "codeNet:p02724", "input_text": "open Printf\nopen Scanf\n\nlet solve x =\n  let fhy = x / 500 in\n  let fy = (x - fhy * 500) / 5 in\n  fhy * 1000 + fy * 5\n\nlet () =\n  scanf \"%d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1585765065, "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/s135321210.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135321210", "user_id": "u388783188"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve x =\n  let fhy = x / 500 in\n  let fy = (x - fhy * 500) / 5 in\n  fhy * 1000 + fy * 5\n\nlet () =\n  scanf \"%d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s838057360", "group_id": "codeNet:p02726", "input_text": "open Batteries\nlet add ary value =\n  Array.append ary [|value|]\n\nlet get_graph n =\n  Array.init n (fun a -> [])\n\n(* 頂点数と辺数 *)\nlet n, x, y = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun n x y ->\n    n, x, y\n  )\nlet graph = get_graph n\n\nlet _ =\n  let rec loop i =\n    if i < n then\n      (if i = 0 then\n        (graph.(i) <- graph.(i) @ [(i+1)])\n        else if i = n-1 then (graph.(i) <- graph.(i) @ [(i-1)]) else graph.(i) <- graph.(i) @ [(i+1); (i-1)]; \n      loop (i+1))\n    else ()\n  in loop 0;\n  graph.(x-1) <- graph.(x-1) @ [y-1];\n  graph.(y-1) <- graph.(y-1) @ [x-1]\n\n\nlet get_nagasa x = \n(* 初期条件 (頂点 x を初期ノードとする) *)\n(* BFS のためのデータ構造 *)\n  let dist = Array.init n (fun a -> -1) in\n  let que = Queue.create () in\n  let _ =\n    dist.(x) <- 0;\n    Queue.push x que in\n  let rec loop () =\n    (* BFS 開始 (キューが空になるまで探索を行う) *)\n    if Queue.is_empty que = false then\n    (* キューから先頭頂点を取り出す *)\n    let v = Queue.take que in\n    (* v から辿れる頂点をすべて調べる *)\n    let rec search lst =\n      match lst with\n      | [] -> ()\n      | first :: rest ->\n        (* すでに発見済みの頂点は探索しない *)\n        if dist.(first) = -1 then \n          (* 新たな白色頂点 first について距離情報を更新してキューに追加する *)\n          (dist.(first) <- (dist.(v) + 1);\n          Queue.push first que;\n          search rest)\n        else search rest\n    in search graph.(v);\n    loop () else () \n  in let rec get k =\n    if k = n then [] else dist.(k) :: get (k+1)\n  in loop (); get 0\n\nlet all = \n  let rec loop i =\n    if i = n then [] else (get_nagasa i) @ (loop (i+1))\n  in loop 0\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\nlet _ =\n  for i = 1 to n-1 do\n    Printf.printf \"%d\\n\" @@ (count_list all i / 2)\n  done\n", "language": "OCaml", "metadata": {"date": 1585690384, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s838057360.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s838057360", "user_id": "u511870776"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "open Batteries\nlet add ary value =\n  Array.append ary [|value|]\n\nlet get_graph n =\n  Array.init n (fun a -> [])\n\n(* 頂点数と辺数 *)\nlet n, x, y = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun n x y ->\n    n, x, y\n  )\nlet graph = get_graph n\n\nlet _ =\n  let rec loop i =\n    if i < n then\n      (if i = 0 then\n        (graph.(i) <- graph.(i) @ [(i+1)])\n        else if i = n-1 then (graph.(i) <- graph.(i) @ [(i-1)]) else graph.(i) <- graph.(i) @ [(i+1); (i-1)]; \n      loop (i+1))\n    else ()\n  in loop 0;\n  graph.(x-1) <- graph.(x-1) @ [y-1];\n  graph.(y-1) <- graph.(y-1) @ [x-1]\n\n\nlet get_nagasa x = \n(* 初期条件 (頂点 x を初期ノードとする) *)\n(* BFS のためのデータ構造 *)\n  let dist = Array.init n (fun a -> -1) in\n  let que = Queue.create () in\n  let _ =\n    dist.(x) <- 0;\n    Queue.push x que in\n  let rec loop () =\n    (* BFS 開始 (キューが空になるまで探索を行う) *)\n    if Queue.is_empty que = false then\n    (* キューから先頭頂点を取り出す *)\n    let v = Queue.take que in\n    (* v から辿れる頂点をすべて調べる *)\n    let rec search lst =\n      match lst with\n      | [] -> ()\n      | first :: rest ->\n        (* すでに発見済みの頂点は探索しない *)\n        if dist.(first) = -1 then \n          (* 新たな白色頂点 first について距離情報を更新してキューに追加する *)\n          (dist.(first) <- (dist.(v) + 1);\n          Queue.push first que;\n          search rest)\n        else search rest\n    in search graph.(v);\n    loop () else () \n  in let rec get k =\n    if k = n then [] else dist.(k) :: get (k+1)\n  in loop (); get 0\n\nlet all = \n  let rec loop i =\n    if i = n then [] else (get_nagasa i) @ (loop (i+1))\n  in loop 0\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\nlet _ =\n  for i = 1 to n-1 do\n    Printf.printf \"%d\\n\" @@ (count_list all i / 2)\n  done\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2003, "cpu_time_ms": 2106, "memory_kb": 113212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s055239019", "group_id": "codeNet:p02729", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n m -> Printf.printf \"%d\\n\" @@ n * (n-1) / 2 + m * (m-1) / 2", "language": "OCaml", "metadata": {"date": 1592027938, "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/s055239019.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055239019", "user_id": "u052332717"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n m -> Printf.printf \"%d\\n\" @@ n * (n-1) / 2 + m * (m-1) / 2", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s106231198", "group_id": "codeNet:p02729", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n m ->\n  Printf.printf \"%d\\n\" @@ n * (n - 1) / 2 + m * (m - 1) / 2", "language": "OCaml", "metadata": {"date": 1584926954, "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/s106231198.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s106231198", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n m ->\n  Printf.printf \"%d\\n\" @@ n * (n - 1) / 2 + m * (m - 1) / 2", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s737514623", "group_id": "codeNet:p02730", "input_text": "open Batteries\nlet cut st str = String.init (String.length str - st) (fun a -> String.get str (a+st))\nlet get num str = String.init num (fun a -> String.get str a)\nlet s = read_line ()\nlet n = String.length s\nlet n_1 = get ((n-1)/2) s\nlet n_2 = cut ((n+3)/2-1) s\nlet half_n1 = get ((String.length n_1)/2) n_1\nlet end_n1 = cut ((String.length n_1)/2+1) n_1\nlet half_n2 = get ((String.length n_2)/2) n_2\nlet end_n2 = cut ((String.length n_2)/2+1) n_2\n\nlet _ = (if half_n1 = end_n1 && half_n2 = end_n2 && n_1 = n_2 then \"Yes\" else \"No\") |> print_endline", "language": "OCaml", "metadata": {"date": 1584926022, "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/s737514623.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s737514623", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nlet cut st str = String.init (String.length str - st) (fun a -> String.get str (a+st))\nlet get num str = String.init num (fun a -> String.get str a)\nlet s = read_line ()\nlet n = String.length s\nlet n_1 = get ((n-1)/2) s\nlet n_2 = cut ((n+3)/2-1) s\nlet half_n1 = get ((String.length n_1)/2) n_1\nlet end_n1 = cut ((String.length n_1)/2+1) n_1\nlet half_n2 = get ((String.length n_2)/2) n_2\nlet end_n2 = cut ((String.length n_2)/2+1) n_2\n\nlet _ = (if half_n1 = end_n1 && half_n2 = end_n2 && n_1 = n_2 then \"Yes\" else \"No\") |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 550, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s667663571", "group_id": "codeNet:p02731", "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 l = scan \"%f\" id\nlet () =\n  let i = l/.3.0 in\n  Printf.printf \"%f\\n\" @@ Float.pow i 3.0\n", "language": "OCaml", "metadata": {"date": 1592777299, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s667663571.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s667663571", "user_id": "u802614675"}, "prompt_components": {"gold_output": "1.000000000000\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 l = scan \"%f\" id\nlet () =\n  let i = l/.3.0 in\n  Printf.printf \"%f\\n\" @@ Float.pow i 3.0\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "sample_input": "3\n"}, "reference_outputs": ["1.000000000000\n"], "source_document_id": "p02731", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2244, "cpu_time_ms": 10, "memory_kb": 5776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s291534709", "group_id": "codeNet:p02731", "input_text": "let _ = Printf.printf \"%f\\n\" ((read_float () /. 3.) ** 3.)", "language": "OCaml", "metadata": {"date": 1584932058, "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/s291534709.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291534709", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "let _ = Printf.printf \"%f\\n\" ((read_float () /. 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s872514652", "group_id": "codeNet:p02731", "input_text": "let l = read_int ()\nlet s = float_of_int (l/3)\nlet _ = (if l mod 3 = 0 then s ** 3. else\n        if l mod 3 = 1 then s *. (s +. 0.5) *. (s +. 0.5) else\n        (s +. 1.) *. (s +. 0.5) *. (s +. 0.5)) |> Printf.printf \"%f\\n\"", "language": "OCaml", "metadata": {"date": 1584927478, "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/s872514652.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s872514652", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "let l = read_int ()\nlet s = float_of_int (l/3)\nlet _ = (if l mod 3 = 0 then s ** 3. else\n        if l mod 3 = 1 then s *. (s +. 0.5) *. (s +. 0.5) else\n        (s +. 1.) *. (s +. 0.5) *. (s +. 0.5)) |> Printf.printf \"%f\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "sample_input": "3\n"}, "reference_outputs": ["1.000000000000\n"], "source_document_id": "p02731", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s628627113", "group_id": "codeNet:p02732", "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 cnt = a \n  |> List.sort compare\n  |> List.fold_left (fun acc n ->\n    match acc with\n      | [] -> [(n, 1)]\n      | (v, cnt) as t :: xs -> if v = n then (v, cnt + 1) :: xs else (n, 1) :: t :: xs\n  ) []\n\nmodule IntMap = Map.Make(struct\n  type t = int\n  let compare = compare\nend)\n\nlet map = List.fold_left (fun map (k, v) -> IntMap.add k v map) IntMap.empty cnt\n\nlet sum = List.fold_left (fun sum (_, cnt) -> sum + cnt * (cnt - 1) / 2) 0 cnt\n\nlet () = List.iter(fun i ->\n  Printf.printf \"%d\\n\" @@ sum - IntMap.find i map + 1\n) a", "language": "OCaml", "metadata": {"date": 1590111951, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02732.html", "problem_id": "p02732", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02732/input.txt", "sample_output_relpath": "derived/input_output/data/p02732/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02732/OCaml/s628627113.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s628627113", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\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 cnt = a \n  |> List.sort compare\n  |> List.fold_left (fun acc n ->\n    match acc with\n      | [] -> [(n, 1)]\n      | (v, cnt) as t :: xs -> if v = n then (v, cnt + 1) :: xs else (n, 1) :: t :: xs\n  ) []\n\nmodule IntMap = Map.Make(struct\n  type t = int\n  let compare = compare\nend)\n\nlet map = List.fold_left (fun map (k, v) -> IntMap.add k v map) IntMap.empty cnt\n\nlet sum = List.fold_left (fun sum (_, cnt) -> sum + cnt * (cnt - 1) / 2) 0 cnt\n\nlet () = List.iter(fun i ->\n  Printf.printf \"%d\\n\" @@ sum - IntMap.find i map + 1\n) a", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "sample_input": "5\n1 1 2 1 2\n"}, "reference_outputs": ["2\n2\n3\n2\n3\n"], "source_document_id": "p02732", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 417, "memory_kb": 31032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s138254696", "group_id": "codeNet:p02745", "input_text": "\nlet calc a b c =\n  let concat s ls t lt =\n    let rec f i =\n      let rec g j =\n        if i+j >= ls || j >= lt then true\n        else (s (i+j) = '?' || t j = '?' || s (i+j) = t j) && g (j+1)\n      in\n      if g 0 then i else f (i+1)\n    in f 0\n  in\n  let la, lb, lc = String.(length a, length b, length c) in\n  let abi = concat (fun i -> a.[i]) la (fun i -> b.[i]) lb in\n  let lab = max la (abi + lb) in\n  let abci = concat (fun i -> if i < abi then a.[i] else b.[i-abi]) lab (fun i -> c.[i]) lc in\n  max lab (abci + lc)\n\nlet () =\n  Scanf.scanf \"%s %s %s\" @@ fun a b c ->\n    [calc a b c; calc a c b; calc b a c; calc b c a; calc c a b; calc c b a]\n    |> List.fold_left min 10000 |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1584245988, "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/s138254696.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s138254696", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "\nlet calc a b c =\n  let concat s ls t lt =\n    let rec f i =\n      let rec g j =\n        if i+j >= ls || j >= lt then true\n        else (s (i+j) = '?' || t j = '?' || s (i+j) = t j) && g (j+1)\n      in\n      if g 0 then i else f (i+1)\n    in f 0\n  in\n  let la, lb, lc = String.(length a, length b, length c) in\n  let abi = concat (fun i -> a.[i]) la (fun i -> b.[i]) lb in\n  let lab = max la (abi + lb) in\n  let abci = concat (fun i -> if i < abi then a.[i] else b.[i-abi]) lab (fun i -> c.[i]) lc in\n  max lab (abci + lc)\n\nlet () =\n  Scanf.scanf \"%s %s %s\" @@ fun a b c ->\n    [calc a b c; calc a c b; calc b a c; calc b c a; calc c a b; calc c b a]\n    |> List.fold_left min 10000 |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 707, "cpu_time_ms": 23, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s354389839", "group_id": "codeNet:p02748", "input_text": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun a b m ->\n  let as_ = Array.init a @@ fun _ -> Scanf.scanf \"%d%c\" @@ fun a _ -> a in\n  let bs = Array.init b @@ fun _ -> Scanf.scanf \"%d%c\" @@ fun b _ -> b in\n  let xycs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun x y c -> x, y, c in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_right (fun (x, y, c) -> min @@ as_.(x - 1) + bs.(y - 1) - c) xycs @@\n  Array.fold_left min max_int as_ + Array.fold_left min max_int bs", "language": "OCaml", "metadata": {"date": 1584229915, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/OCaml/s354389839.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s354389839", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun a b m ->\n  let as_ = Array.init a @@ fun _ -> Scanf.scanf \"%d%c\" @@ fun a _ -> a in\n  let bs = Array.init b @@ fun _ -> Scanf.scanf \"%d%c\" @@ fun b _ -> b in\n  let xycs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun x y c -> x, y, c in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_right (fun (x, y, c) -> min @@ as_.(x - 1) + bs.(y - 1) - c) xycs @@\n  Array.fold_left min max_int as_ + Array.fold_left min max_int bs", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 463, "cpu_time_ms": 126, "memory_kb": 8704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s470768224", "group_id": "codeNet:p02753", "input_text": "let s = read_line () in\nprint_endline (if s = \"AAA\" || s = \"BBB\" then \"No\" else \"Yes\")", "language": "OCaml", "metadata": {"date": 1583632929, "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/s470768224.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s470768224", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line () in\nprint_endline (if s = \"AAA\" || s = \"BBB\" then \"No\" else \"Yes\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "sample_input": "ABA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02753", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s031755940", "group_id": "codeNet:p02754", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d\\n\" @@ (n/(a+b)*a) + min (n mod (a+b)) a ", "language": "OCaml", "metadata": {"date": 1592705730, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s031755940.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s031755940", "user_id": "u052332717"}, "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/(a+b)*a) + min (n mod (a+b)) a ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 8, "memory_kb": 3836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s251096874", "group_id": "codeNet:p02755", "input_text": "let () =\n  let ans = ref 0 in\n  Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n  for y = 1 to 1010 do\n    if y * 8 / 100 = a && y / 10 = b then ans := y\n  done;\n  print_int (if !ans = 0 then -1 else !ans)", "language": "OCaml", "metadata": {"date": 1591456755, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02755.html", "problem_id": "p02755", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02755/input.txt", "sample_output_relpath": "derived/input_output/data/p02755/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02755/OCaml/s251096874.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s251096874", "user_id": "u307426615"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "let () =\n  let ans = ref 0 in\n  Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n  for y = 1 to 1010 do\n    if y * 8 / 100 = a && y / 10 = b then ans := y\n  done;\n  print_int (if !ans = 0 then -1 else !ans)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)\n\nHere, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.\n\nIf multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n25\n\nIf the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 25 \\times 0.08 \\rfloor = \\lfloor 2 \\rfloor = 2 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 25 \\times 0.1 \\rfloor = \\lfloor 2.5 \\rfloor = 2 yen.\n\nThus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.\n\nSample Input 2\n\n8 10\n\nSample Output 2\n\n100\n\nIf the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 100 \\times 0.08 \\rfloor = 8 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 100 \\times 0.1 \\rfloor = 10 yen.\n\nSample Input 3\n\n19 99\n\nSample Output 3\n\n-1\n\nThere is no price before tax satisfying this condition, so print -1.", "sample_input": "2 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02755", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)\n\nHere, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.\n\nIf multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n25\n\nIf the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 25 \\times 0.08 \\rfloor = \\lfloor 2 \\rfloor = 2 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 25 \\times 0.1 \\rfloor = \\lfloor 2.5 \\rfloor = 2 yen.\n\nThus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.\n\nSample Input 2\n\n8 10\n\nSample Output 2\n\n100\n\nIf the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 100 \\times 0.08 \\rfloor = 8 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 100 \\times 0.1 \\rfloor = 10 yen.\n\nSample Input 3\n\n19 99\n\nSample Output 3\n\n-1\n\nThere is no price before tax satisfying this condition, so print -1.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s624014628", "group_id": "codeNet:p02756", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet s = read_line () |> split_string\nlet q = Scanf.sscanf (read_line ()) \"%d\" @@ fun q -> q\nlet qq = Array.init q @@ fun _ -> read_line () |> split_string ~pattern:\" \"\n\nlet (s, t) = Array.fold_left (fun (s, t) -> function\n  | \"1\" :: [] -> (t, s)\n  | \"2\" :: f :: c :: [] -> if f = \"1\" then (c :: s, t) else (s, c :: t)\n  | _ -> failwith \"\"\n) (s, []) qq\n\nlet () =\n  List.iter print_string s; \n  List.iter print_string (List.rev t); \n  print_newline ()", "language": "OCaml", "metadata": {"date": 1590109476, "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/s624014628.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624014628", "user_id": "u811309788"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet s = read_line () |> split_string\nlet q = Scanf.sscanf (read_line ()) \"%d\" @@ fun q -> q\nlet qq = Array.init q @@ fun _ -> read_line () |> split_string ~pattern:\" \"\n\nlet (s, t) = Array.fold_left (fun (s, t) -> function\n  | \"1\" :: [] -> (t, s)\n  | \"2\" :: f :: c :: [] -> if f = \"1\" then (c :: s, t) else (s, c :: t)\n  | _ -> failwith \"\"\n) (s, []) qq\n\nlet () =\n  List.iter print_string s; \n  List.iter print_string (List.rev t); \n  print_newline ()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "sample_input": "a\n4\n2 1 p\n1\n2 2 c\n1\n"}, "reference_outputs": ["cpa\n"], "source_document_id": "p02756", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 514, "cpu_time_ms": 322, "memory_kb": 41980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s623369298", "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 < 0 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 (n - 1) 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)\n", "language": "OCaml", "metadata": {"date": 1583645573, "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/s623369298.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s623369298", "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 < 0 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 (n - 1) 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)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 886, "cpu_time_ms": 7, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s889835387", "group_id": "codeNet:p02760", "input_text": "let () =\n  let num_card =\n    Array.init 3 @@ fun _ ->\n      Array.init 3 @@ fun _ ->\n        Scanf.scanf \" %d\" @@ Fun.id in\n  let mark = Array.make_matrix 3 3 false in\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n    for i = 0 to n - 1 do\n      Scanf.scanf \"%d\\n\" @@ fun b ->\n        for i = 0 to 2 do\n          for j = 0 to 2 do\n            if num_card.(i).(j) = b then mark.(i).(j) <- true\n          done\n        done\n    done;\n    print_endline @@\n    if\n      mark.(0) = [| true; true; true |] ||\n      mark.(1) = [| true; true; true |] ||\n      mark.(2) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(0)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(1)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(2)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(i)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(2-i).(i)) = [| true; true; true |]\n    then \"Yes\"\n    else \"No\"", "language": "OCaml", "metadata": {"date": 1592789335, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s889835387.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s889835387", "user_id": "u052332717"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let num_card =\n    Array.init 3 @@ fun _ ->\n      Array.init 3 @@ fun _ ->\n        Scanf.scanf \" %d\" @@ Fun.id in\n  let mark = Array.make_matrix 3 3 false in\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n    for i = 0 to n - 1 do\n      Scanf.scanf \"%d\\n\" @@ fun b ->\n        for i = 0 to 2 do\n          for j = 0 to 2 do\n            if num_card.(i).(j) = b then mark.(i).(j) <- true\n          done\n        done\n    done;\n    print_endline @@\n    if\n      mark.(0) = [| true; true; true |] ||\n      mark.(1) = [| true; true; true |] ||\n      mark.(2) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(0)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(1)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(2)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(i).(i)) = [| true; true; true |] ||\n      Array.init 3 (fun i -> mark.(2-i).(i)) = [| true; true; true |]\n    then \"Yes\"\n    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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 958, "cpu_time_ms": 10, "memory_kb": 3856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s989061395", "group_id": "codeNet:p02760", "input_text": "let inp_matrix : 'a array -> int -> int -> unit = fun a m n ->\n  a.(0).(0) <- Scanf.scanf \"%d\" (fun x -> x);\n  for i = 0 to m - 1 do\n    for j = 0 to n - 1 do\n      if (i <> 0 || j <> 0) then\n        a.(i).(j) <- Scanf.scanf \" %d\" (fun x -> x)\n    done\n  done;\n  let _ = Scanf.scanf \"%c\" (fun x -> x) in\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\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": 1583598379, "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/s989061395.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s989061395", "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  a.(0).(0) <- Scanf.scanf \"%d\" (fun x -> x);\n  for i = 0 to m - 1 do\n    for j = 0 to n - 1 do\n      if (i <> 0 || j <> 0) then\n        a.(i).(j) <- Scanf.scanf \" %d\" (fun x -> x)\n    done\n  done;\n  let _ = Scanf.scanf \"%c\" (fun x -> x) in\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\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1302, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s734984180", "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": 1583597675, "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/s734984180.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s734984180", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1169, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s507004205", "group_id": "codeNet:p02760", "input_text": "let check_bingo board hits =\n  (* ビンゴ対象となる配列のインデックス *)\n  let check_list = [[0;1;2]; [3;4;5]; [6;7;8]; [0;3;6]; [1;4;7]; [2;5;8]; [0;4;8]; [2;4;6]] in\n  (* インデックスを値に変換 *)\n  let rec get_cell board l cell_values =\n    match l with\n    | [] -> cell_values\n    | x::xs ->\n       get_cell board xs ((Array.get board x)::cell_values)\n  in\n  (* ある列/行/斜めがビンゴかチェック *)\n  let is_bingo l hits = List.for_all (fun x -> (List.mem x hits)) l in\n  let rec check_bingo_sub board l =\n    match l with\n    | [] -> \"No\"\n    | x::xs ->\n       let check_cell_list = get_cell board x [] in\n       let result = is_bingo check_cell_list hits in\n       if result then \"Yes\" else check_bingo_sub board xs\n  in\n  check_bingo_sub board check_list\n\n(* 盤面入力 *)\nlet rec input_boards n board =\n  match n with\n  | 0 -> Array.of_list (List.rev board)\n  | m ->\n     let new_board = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> c :: b :: a :: board) in\n     input_boards (m-1) new_board\n\n(* 当たりの入力 *)\nlet rec input_hits n hits =\n  match n with\n  | 0 -> hits\n  | m ->\n     let input = read_int () in\n     input_hits (m-1) (input::hits)\n\nlet _ =\n  let board = input_boards 3 [] in\n  let n_hit = read_int () in\n  let hits  = input_hits n_hit [] in\n  let ans = check_bingo board hits in\n  print_endline ans\n", "language": "OCaml", "metadata": {"date": 1583209770, "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/s507004205.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s507004205", "user_id": "u697502900"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let check_bingo board hits =\n  (* ビンゴ対象となる配列のインデックス *)\n  let check_list = [[0;1;2]; [3;4;5]; [6;7;8]; [0;3;6]; [1;4;7]; [2;5;8]; [0;4;8]; [2;4;6]] in\n  (* インデックスを値に変換 *)\n  let rec get_cell board l cell_values =\n    match l with\n    | [] -> cell_values\n    | x::xs ->\n       get_cell board xs ((Array.get board x)::cell_values)\n  in\n  (* ある列/行/斜めがビンゴかチェック *)\n  let is_bingo l hits = List.for_all (fun x -> (List.mem x hits)) l in\n  let rec check_bingo_sub board l =\n    match l with\n    | [] -> \"No\"\n    | x::xs ->\n       let check_cell_list = get_cell board x [] in\n       let result = is_bingo check_cell_list hits in\n       if result then \"Yes\" else check_bingo_sub board xs\n  in\n  check_bingo_sub board check_list\n\n(* 盤面入力 *)\nlet rec input_boards n board =\n  match n with\n  | 0 -> Array.of_list (List.rev board)\n  | m ->\n     let new_board = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> c :: b :: a :: board) in\n     input_boards (m-1) new_board\n\n(* 当たりの入力 *)\nlet rec input_hits n hits =\n  match n with\n  | 0 -> hits\n  | m ->\n     let input = read_int () in\n     input_hits (m-1) (input::hits)\n\nlet _ =\n  let board = input_boards 3 [] in\n  let n_hit = read_int () in\n  let hits  = input_hits n_hit [] in\n  let ans = check_bingo board hits 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1365, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s387422125", "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) <- 1 lsl i)\n        done;\n        let n = Scanf.scanf \" %d\" (fun n -> n) in\n        let rec loop i map =\n            if i = 0 then map else\n                let b = Scanf.scanf \" %d\" (fun b -> b) 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": 1583115341, "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/s387422125.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s387422125", "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) <- 1 lsl i)\n        done;\n        let n = Scanf.scanf \" %d\" (fun n -> n) in\n        let rec loop i map =\n            if i = 0 then map else\n                let b = Scanf.scanf \" %d\" (fun b -> b) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 981, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s684259686", "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 = Scanf.scanf \" %d\" (fun n -> n) in\n        let rec loop i map =\n            if i = 0 then map else\n                let b = Scanf.scanf \" %d\" (fun b -> b) 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": 1583115142, "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/s684259686.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s684259686", "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 = Scanf.scanf \" %d\" (fun n -> n) in\n        let rec loop i map =\n            if i = 0 then map else\n                let b = Scanf.scanf \" %d\" (fun b -> b) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 975, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s219562490", "group_id": "codeNet:p02762", "input_text": "module S = Set.Make (struct type t = int let compare = compare end) ;;\n\nScanf.scanf \"%d %d %d\" (fun n m k ->\n    let friend = Array.make n [] in\n    let block = Array.make n S.empty 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            friend.(a) <- b :: friend.(a);\n            friend.(b) <- a :: friend.(b);\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            block.(c) <- S.add d block.(c);\n            block.(d) <- S.add c block.(d);\n        )\n    done;\n    let clust = Array.make n (-1) in\n    let cm    = Array.make n [||] in\n    let rec loop i cl =\n        if i < n then (\n            let cl = if clust.(i) <> -1 then cl else (\n                let rec collect acc next = function\n                    | [] -> if next = [] then acc else (collect acc [] next)\n                    | hd :: tl ->\n                            let acc = hd :: acc in\n                            let next = List.fold_left (fun next v -> if clust.(v) <> -1 then next else (clust.(v) <- cl; v :: next)) next friend.(hd) in\n                            collect acc next tl\n                in\n                clust.(i) <- cl;\n                let acc = collect [] [i] [] in\n                cm.(cl) <- Array.of_list acc;\n                cl + 1\n            )\n            in\n            let b = Array.fold_left (fun acc v -> if S.mem v block.(i) then acc + 1 else acc) 0 cm.(clust.(i)) in\n\n            (* let c = S.cardinal (S.diff (S.diff cm.(clust.(i)) block.(i)) friend.(i)) in *)\n            let c = Array.length cm.(clust.(i)) - List.length (friend.(i)) - b in\n\n            let () = Printf.printf \"%d \" (c - 1) in\n            loop (i + 1) cl\n        )\n    in\n    loop 0 0\n)", "language": "OCaml", "metadata": {"date": 1583120230, "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/s219562490.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s219562490", "user_id": "u342443598"}, "prompt_components": {"gold_output": "0 1 0 1\n", "input_to_evaluate": "module S = Set.Make (struct type t = int let compare = compare end) ;;\n\nScanf.scanf \"%d %d %d\" (fun n m k ->\n    let friend = Array.make n [] in\n    let block = Array.make n S.empty 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            friend.(a) <- b :: friend.(a);\n            friend.(b) <- a :: friend.(b);\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            block.(c) <- S.add d block.(c);\n            block.(d) <- S.add c block.(d);\n        )\n    done;\n    let clust = Array.make n (-1) in\n    let cm    = Array.make n [||] in\n    let rec loop i cl =\n        if i < n then (\n            let cl = if clust.(i) <> -1 then cl else (\n                let rec collect acc next = function\n                    | [] -> if next = [] then acc else (collect acc [] next)\n                    | hd :: tl ->\n                            let acc = hd :: acc in\n                            let next = List.fold_left (fun next v -> if clust.(v) <> -1 then next else (clust.(v) <- cl; v :: next)) next friend.(hd) in\n                            collect acc next tl\n                in\n                clust.(i) <- cl;\n                let acc = collect [] [i] [] in\n                cm.(cl) <- Array.of_list acc;\n                cl + 1\n            )\n            in\n            let b = Array.fold_left (fun acc v -> if S.mem v block.(i) then acc + 1 else acc) 0 cm.(clust.(i)) in\n\n            (* let c = S.cardinal (S.diff (S.diff cm.(clust.(i)) block.(i)) friend.(i)) in *)\n            let c = Array.length cm.(clust.(i)) - List.length (friend.(i)) - b in\n\n            let () = Printf.printf \"%d \" (c - 1) in\n            loop (i + 1) cl\n        )\n    in\n    loop 0 0\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1809, "cpu_time_ms": 2105, "memory_kb": 30464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s833434947", "group_id": "codeNet:p02763", "input_text": "module S = Set.Make (struct type t = int let compare = compare end);;\nlet () =\n    let main () =\n        let n = read_line () |> int_of_string in\n        let s = read_line () in\n        let letter = Array.make 26 S.empty in\n        let ss = Array.init n (fun i ->\n            let code = int_of_char s.[i] - 97 in\n            letter.(code) <- S.add (i + 1) letter.(code);\n            code\n        )\n        in\n        let q = read_line () |> int_of_string in\n        for i = 1 to q do\n            Scanf.sscanf (read_line ()) \"%d %d %s\" (fun command a b ->\n                if command = 1 then (\n                    let c = ss.(a - 1) in\n                    letter.(c) <- S.remove a letter.(c);\n                    let c = int_of_char b.[0] - 97 in\n                    letter.(c) <- S.add a letter.(c);\n                    ss.(a - 1) <- c;\n                ) else (\n                    let r = int_of_string b in\n                    let rec loop i acc =\n                        if i = 26 then acc else\n                            let _,_,s = S.split (a - 1) letter.(i) in\n                            let s,_,_ = S.split (r + 1) s in\n                            let acc = if S.is_empty s then acc else acc + 1 in\n                            loop (i + 1) acc\n                    in\n                    loop 0 0 |> Printf.printf \"%d\\n\"\n                )\n            )\n        done\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1583129468, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/OCaml/s833434947.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s833434947", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "module S = Set.Make (struct type t = int let compare = compare end);;\nlet () =\n    let main () =\n        let n = read_line () |> int_of_string in\n        let s = read_line () in\n        let letter = Array.make 26 S.empty in\n        let ss = Array.init n (fun i ->\n            let code = int_of_char s.[i] - 97 in\n            letter.(code) <- S.add (i + 1) letter.(code);\n            code\n        )\n        in\n        let q = read_line () |> int_of_string in\n        for i = 1 to q do\n            Scanf.sscanf (read_line ()) \"%d %d %s\" (fun command a b ->\n                if command = 1 then (\n                    let c = ss.(a - 1) in\n                    letter.(c) <- S.remove a letter.(c);\n                    let c = int_of_char b.[0] - 97 in\n                    letter.(c) <- S.add a letter.(c);\n                    ss.(a - 1) <- c;\n                ) else (\n                    let r = int_of_string b in\n                    let rec loop i acc =\n                        if i = 26 then acc else\n                            let _,_,s = S.split (a - 1) letter.(i) in\n                            let s,_,_ = S.split (r + 1) s in\n                            let acc = if S.is_empty s then acc else acc + 1 in\n                            loop (i + 1) acc\n                    in\n                    loop 0 0 |> Printf.printf \"%d\\n\"\n                )\n            )\n        done\n    in\n    main ()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1392, "cpu_time_ms": 872, "memory_kb": 40320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s275031308", "group_id": "codeNet:p02763", "input_text": "module S = Set.Make (struct type t = int let compare = compare end);;\nlet () =\n    let main () =\n        let n = read_line () |> int_of_string in\n        let s = read_line () in\n        let letter = Array.make 26 S.empty in\n        for i = 0 to n - 1 do\n            let code = int_of_char s.[i] - 97 in\n            letter.(code) <- S.add (i + 1) letter.(code)\n        done;\n        let q = read_int () in\n        for i = 1 to q do\n            Scanf.sscanf (read_line ()) \"%d %d %s\" (fun command a b ->\n                if command = 1 then (\n                    let c = int_of_char s.[a - 1] - 97 in\n                    letter.(c) <- S.remove a letter.(c);\n                    let c = int_of_char b.[0] - 97 in\n                    letter.(c) <- S.add a letter.(c)\n                ) else (\n                    let r = int_of_string b in\n                    let rec loop i acc =\n                        if i = 26 then acc else\n                            let _,_,s = S.split (a - 1) letter.(i) in\n                            let s,_,_ = S.split (r + 1) s in\n                            let acc = if S.is_empty s then acc else acc + 1 in\n                            loop (i + 1) acc\n                    in\n                    loop 0 0 |> Printf.printf \"%d\\n\"\n                )\n            )\n        done\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1583126096, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/OCaml/s275031308.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s275031308", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "module S = Set.Make (struct type t = int let compare = compare end);;\nlet () =\n    let main () =\n        let n = read_line () |> int_of_string in\n        let s = read_line () in\n        let letter = Array.make 26 S.empty in\n        for i = 0 to n - 1 do\n            let code = int_of_char s.[i] - 97 in\n            letter.(code) <- S.add (i + 1) letter.(code)\n        done;\n        let q = read_int () in\n        for i = 1 to q do\n            Scanf.sscanf (read_line ()) \"%d %d %s\" (fun command a b ->\n                if command = 1 then (\n                    let c = int_of_char s.[a - 1] - 97 in\n                    letter.(c) <- S.remove a letter.(c);\n                    let c = int_of_char b.[0] - 97 in\n                    letter.(c) <- S.add a letter.(c)\n                ) else (\n                    let r = int_of_string b in\n                    let rec loop i acc =\n                        if i = 26 then acc else\n                            let _,_,s = S.split (a - 1) letter.(i) in\n                            let s,_,_ = S.split (r + 1) s in\n                            let acc = if S.is_empty s then acc else acc + 1 in\n                            loop (i + 1) acc\n                    in\n                    loop 0 0 |> Printf.printf \"%d\\n\"\n                )\n            )\n        done\n    in\n    main ()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1317, "cpu_time_ms": 910, "memory_kb": 37500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s379935913", "group_id": "codeNet:p02765", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n r ->\n  Printf.printf \"%d\\n\" @@\n  if 10 <= n\n  then r\n  else r + 100 * (10 - n)", "language": "OCaml", "metadata": {"date": 1582424489, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02765.html", "problem_id": "p02765", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02765/input.txt", "sample_output_relpath": "derived/input_output/data/p02765/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02765/OCaml/s379935913.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379935913", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3719\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n r ->\n  Printf.printf \"%d\\n\" @@\n  if 10 <= n\n  then r\n  else r + 100 * (10 - n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "sample_input": "2 2919\n"}, "reference_outputs": ["3719\n"], "source_document_id": "p02765", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s998773593", "group_id": "codeNet:p02766", "input_text": "Scanf.scanf \"%d %d\" (fun n k ->\n    let rec loop i acc =\n        if i = 0 then acc else loop (i / k) (acc + 1)\n    in\n    loop n 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1582423503, "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/s998773593.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s998773593", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n k ->\n    let rec loop i acc =\n        if i = 0 then acc else loop (i / k) (acc + 1)\n    in\n    loop n 0 |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s122071989", "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) / 2 in\n  let half2 = (1+List.sum xs) /2 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": 1583647444, "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/s122071989.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s122071989", "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) / 2 in\n  let half2 = (1+List.sum xs) /2 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 877, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s412779386", "group_id": "codeNet:p02768", "input_text": "let m = 1000000007\nlet ( * ) a b = a * b mod m\nlet (-) a b = a - b + if a < b then m else 0\nlet p n r = Array.(init r ((-) n) |> fold_left ( * ) 1)\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 c n r = p n r * f (p r r) (m - 2)\nlet _ = Scanf.scanf \"%d %d %d\" @@ fun n a b -> f 2 n - 1 - c n a - c n b |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1582564960, "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/s412779386.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412779386", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let m = 1000000007\nlet ( * ) a b = a * b mod m\nlet (-) a b = a - b + if a < b then m else 0\nlet p n r = Array.(init r ((-) n) |> fold_left ( * ) 1)\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 c n r = p n r * f (p r r) (m - 2)\nlet _ = Scanf.scanf \"%d %d %d\" @@ fun n a b -> f 2 n - 1 - c n a - c n 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 17, "memory_kb": 7424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s750605926", "group_id": "codeNet:p02771", "input_text": "let poor a b c =\n  if a = b && a = c then \"No\"\n  else if a = b && a <> c then \"Yes\"\n  else if a = c && a <> b then \"Yes\"\n  else if b = c && b <> a then \"Yes\"\n  else \"No\"\n\nlet a, b, c = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> (a, b, c))\nlet () = Printf.printf \"%s\\n\" (poor a b c)", "language": "OCaml", "metadata": {"date": 1595685853, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/OCaml/s750605926.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s750605926", "user_id": "u272377260"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let poor a b c =\n  if a = b && a = c then \"No\"\n  else if a = b && a <> c then \"Yes\"\n  else if a = c && a <> b then \"Yes\"\n  else if b = c && b <> a then \"Yes\"\n  else \"No\"\n\nlet a, b, c = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> (a, b, c))\nlet () = Printf.printf \"%s\\n\" (poor a b c)", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 9, "memory_kb": 3744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s931130021", "group_id": "codeNet:p02771", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b c -> Printf.printf \"%s\\n\" @@\n  if a = b && a <> c\n  then \"Yes\"\n  else if a = c && a <> b\n  then \"Yes\"\n  else if b = c && a <> b\n  then \"Yes\"\n  else \"No\"", "language": "OCaml", "metadata": {"date": 1592155348, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/OCaml/s931130021.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931130021", "user_id": "u052332717"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b c -> Printf.printf \"%s\\n\" @@\n  if a = b && a <> c\n  then \"Yes\"\n  else if a = c && a <> b\n  then \"Yes\"\n  else if b = c && a <> b\n  then \"Yes\"\n  else \"No\"", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 195, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s323729583", "group_id": "codeNet:p02771", "input_text": "open Printf\nopen Scanf\n\nlet solve a b c =\n  let n = List.length @@ List.filter (fun x -> x = 0) [a-b; b-c; c-a] in\n  if n = 1 then \"Yes\" else \"No\"\n            \nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1581941543, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/OCaml/s323729583.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323729583", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b c =\n  let n = List.length @@ List.filter (fun x -> x = 0) [a-b; b-c; c-a] in\n  if n = 1 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\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s195581447", "group_id": "codeNet:p02771", "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 \n    \t(if a = b && a <> c then \"Yes\"\n         else if a = c && a <> b then \"Yes\"\n         else if b = c && a <> b then \"Yes\"\n         else \"No\")", "language": "OCaml", "metadata": {"date": 1581883606, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/OCaml/s195581447.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s195581447", "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 \n    \t(if a = b && a <> c then \"Yes\"\n         else if a = c && a <> b then \"Yes\"\n         else if b = c && a <> b then \"Yes\"\n         else \"No\")", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s092039769", "group_id": "codeNet:p02778", "input_text": "let _ = print_endline (String.make (String.length @@ read_line ()) 'x')\n", "language": "OCaml", "metadata": {"date": 1584367996, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02778.html", "problem_id": "p02778", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02778/input.txt", "sample_output_relpath": "derived/input_output/data/p02778/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02778/OCaml/s092039769.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092039769", "user_id": "u511870776"}, "prompt_components": {"gold_output": "xxxxxxx\n", "input_to_evaluate": "let _ = print_endline (String.make (String.length @@ read_line ()) 'x')\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "sample_input": "sardine\n"}, "reference_outputs": ["xxxxxxx\n"], "source_document_id": "p02778", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s020677604", "group_id": "codeNet:p02778", "input_text": "open Printf\nopen Scanf\n\nlet solve s = String.map (fun _ -> 'x') s\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582205480, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02778.html", "problem_id": "p02778", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02778/input.txt", "sample_output_relpath": "derived/input_output/data/p02778/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02778/OCaml/s020677604.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s020677604", "user_id": "u388783188"}, "prompt_components": {"gold_output": "xxxxxxx\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s = String.map (fun _ -> 'x') s\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "sample_input": "sardine\n"}, "reference_outputs": ["xxxxxxx\n"], "source_document_id": "p02778", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s255059527", "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 :: rest -> if first = List.hd rest then \"NO\" else loop rest\n  in loop a |> print_endline", "language": "OCaml", "metadata": {"date": 1586677369, "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/s255059527.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s255059527", "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 :: rest -> if first = List.hd rest then \"NO\" else 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 272, "cpu_time_ms": 257, "memory_kb": 26112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s689216620", "group_id": "codeNet:p02780", "input_text": "open Batteries\nlet n, k = Scanf.sscanf (read_line()) \"%d %d\" (fun n k ->n,k)\nlet dp = Array.init n @@ fun a -> 0.\nlet ex i = (1. +. (float_of_int i)) /. 2.\n\nlet a = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> ex a\n\nlet rec loop i =\n  if i >= n then () else\n  (dp.(i) <- dp.(i-1) +. a.(i); loop (i+1))\n\nlet _ = dp.(0) <- a.(0); loop 1\n\n\nlet rec loop1 j =\n  if j + k >= n then min_float else\n  max (dp.(j+k) -. dp.(j)) (loop1 @@ j+1)\n\nlet _ = Printf.printf \"%.12f\\n\" @@ loop1 0\n\n", "language": "OCaml", "metadata": {"date": 1587651477, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02780.html", "problem_id": "p02780", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02780/input.txt", "sample_output_relpath": "derived/input_output/data/p02780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02780/OCaml/s689216620.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s689216620", "user_id": "u511870776"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "open Batteries\nlet n, k = Scanf.sscanf (read_line()) \"%d %d\" (fun n k ->n,k)\nlet dp = Array.init n @@ fun a -> 0.\nlet ex i = (1. +. (float_of_int i)) /. 2.\n\nlet a = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> ex a\n\nlet rec loop i =\n  if i >= n then () else\n  (dp.(i) <- dp.(i-1) +. a.(i); loop (i+1))\n\nlet _ = dp.(0) <- a.(0); loop 1\n\n\nlet rec loop1 j =\n  if j + k >= n then min_float else\n  max (dp.(j+k) -. dp.(j)) (loop1 @@ j+1)\n\nlet _ = Printf.printf \"%.12f\\n\" @@ loop1 0\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "sample_input": "5 3\n1 2 2 4 5\n"}, "reference_outputs": ["7.000000000000\n"], "source_document_id": "p02780", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 488, "cpu_time_ms": 52, "memory_kb": 9472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s998189269", "group_id": "codeNet:p02780", "input_text": "open Batteries\nopen Printf\n\nlet scan fmt f =\n  Scanf.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, k) = scan \"%d %d\" BatTuple.Tuple2.make\nlet ps = scan_list float_of_string\n\nlet exp n = n *. (n +. 1.0) /. 2.0 /. n\n\nlet hold_max (m, p) (x, y) =\n  let n = p -. x +. y in\n  (BatFloat.max m n, n)\n\nlet () =\n  let sums = List.map exp ps in\n  let init = BatList.fsum @@ BatList.take k sums in\n  BatList.fold_left hold_max (init, init) (zip sums @@ BatList.drop k sums)\n  |> BatTuple.Tuple2.first\n  |> printf \"%f\\n\"\n", "language": "OCaml", "metadata": {"date": 1581829543, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02780.html", "problem_id": "p02780", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02780/input.txt", "sample_output_relpath": "derived/input_output/data/p02780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02780/OCaml/s998189269.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s998189269", "user_id": "u802614675"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet scan fmt f =\n  Scanf.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, k) = scan \"%d %d\" BatTuple.Tuple2.make\nlet ps = scan_list float_of_string\n\nlet exp n = n *. (n +. 1.0) /. 2.0 /. n\n\nlet hold_max (m, p) (x, y) =\n  let n = p -. x +. y in\n  (BatFloat.max m n, n)\n\nlet () =\n  let sums = List.map exp ps in\n  let init = BatList.fsum @@ BatList.take k sums in\n  BatList.fold_left hold_max (init, init) (zip sums @@ BatList.drop k sums)\n  |> BatTuple.Tuple2.first\n  |> printf \"%f\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "sample_input": "5 3\n1 2 2 4 5\n"}, "reference_outputs": ["7.000000000000\n"], "source_document_id": "p02780", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 704, "cpu_time_ms": 134, "memory_kb": 37760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s640377344", "group_id": "codeNet:p02781", "input_text": "open Batteries\nopen BatPrintf\nopen BatBigarray\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 \"%s\" identity\nlet k = scan \"%d\" identity\n\nlet () =\n  let len = String.length n in\n  let dp = Array3.create Int C_layout 2 (len+1) len in\n  Array3.set dp 0 0 0 1;\n  let open BatEnum in\n  iter (fun i ->\n      let d = int_of_string @@ String.of_char @@ String.get n (i-1) in\n      iter (fun j ->\n          Array3.set dp 1 i j @@ (Array3.get dp 1 (i - 1) j) * 9 +\n                                 (if j > 0 then\n                                    Array3.get dp 1 (i - 1) (j - 1)\n                                  else 0) +\n                                 if d > 0 then\n                                   (d - 1) * (Array3.get dp 0 (i - 1) j) + (if j > 0 then Array3.get dp 0 (i - 1) (j - 1) else 0)\n                                 else\n                                   0;\n          Array3.set dp 0 i j @@\n          if d > 0 then\n            Array3.get dp 0 (i-1) j\n          else if j > 0 then\n            Array3.get dp 0 (i-1) (j-1)\n          else\n            0\n        ) (0 --^ len);\n    ) (1 -- len);\n  printf \"%d\\n\" @@ Array3.get dp 1 len (len - k) + Array3.get dp 0 len (len - k)\n", "language": "OCaml", "metadata": {"date": 1581887048, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02781.html", "problem_id": "p02781", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02781/input.txt", "sample_output_relpath": "derived/input_output/data/p02781/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02781/OCaml/s640377344.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s640377344", "user_id": "u802614675"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "open Batteries\nopen BatPrintf\nopen BatBigarray\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 \"%s\" identity\nlet k = scan \"%d\" identity\n\nlet () =\n  let len = String.length n in\n  let dp = Array3.create Int C_layout 2 (len+1) len in\n  Array3.set dp 0 0 0 1;\n  let open BatEnum in\n  iter (fun i ->\n      let d = int_of_string @@ String.of_char @@ String.get n (i-1) in\n      iter (fun j ->\n          Array3.set dp 1 i j @@ (Array3.get dp 1 (i - 1) j) * 9 +\n                                 (if j > 0 then\n                                    Array3.get dp 1 (i - 1) (j - 1)\n                                  else 0) +\n                                 if d > 0 then\n                                   (d - 1) * (Array3.get dp 0 (i - 1) j) + (if j > 0 then Array3.get dp 0 (i - 1) (j - 1) else 0)\n                                 else\n                                   0;\n          Array3.set dp 0 i j @@\n          if d > 0 then\n            Array3.get dp 0 (i-1) j\n          else if j > 0 then\n            Array3.get dp 0 (i-1) (j-1)\n          else\n            0\n        ) (0 --^ len);\n    ) (1 -- len);\n  printf \"%d\\n\" @@ Array3.get dp 1 len (len - k) + Array3.get dp 0 len (len - k)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "sample_input": "100\n1\n"}, "reference_outputs": ["19\n"], "source_document_id": "p02781", "source_text": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1408, "cpu_time_ms": 7, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s777036711", "group_id": "codeNet:p02784", "input_text": "Scanf.scanf \"%d %d\" @@ fun h n -> print_endline @@ if Array.(init n (fun _ -> Scanf.scanf \" %d\" (+) 0) |> fold_left (+) 0 >= h) then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1582396363, "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/s777036711.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777036711", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun h n -> print_endline @@ if Array.(init n (fun _ -> Scanf.scanf \" %d\" (+) 0) |> fold_left (+) 0 >= h) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s394513154", "group_id": "codeNet:p02785", "input_text": "open Printf\nopen Scanf\n\nmodule L =\n  struct\n    include List\n  \n    let rec drop n = function\n        [] -> []\n      | h :: t when n > 0 -> drop (n - 1) t\n      | l -> l\n\n    let init n f =\n      let rec loop x =\n        if x = n then []\n        else let y = f x in y :: loop (x + 1)\n      in loop 0\n  end\n\nlet id x = x\n\nlet flip f x y = f y x\n\nlet solve n k =\n  L.fold_left (+) 0 @@ L.drop k @@ L.fast_sort (flip compare) @@ L.init n (fun _ -> scanf \"%d \" id)\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582887535, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s394513154.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394513154", "user_id": "u388783188"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nmodule L =\n  struct\n    include List\n  \n    let rec drop n = function\n        [] -> []\n      | h :: t when n > 0 -> drop (n - 1) t\n      | l -> l\n\n    let init n f =\n      let rec loop x =\n        if x = n then []\n        else let y = f x in y :: loop (x + 1)\n      in loop 0\n  end\n\nlet id x = x\n\nlet flip f x y = f y x\n\nlet solve n k =\n  L.fold_left (+) 0 @@ L.drop k @@ L.fast_sort (flip compare) @@ L.init n (fun _ -> scanf \"%d \" id)\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 201, "memory_kb": 20896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s872378961", "group_id": "codeNet:p02790", "input_text": "let () = Scanf.scanf \"%c %c\" @@ fun a b -> Printf.printf \"%s\\n\" @@\n  if a <= b\n  then String.make (int_of_char b - 48) a\n  else String.make (int_of_char a - 48) b", "language": "OCaml", "metadata": {"date": 1593025234, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s872378961.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s872378961", "user_id": "u052332717"}, "prompt_components": {"gold_output": "3333\n", "input_to_evaluate": "let () = Scanf.scanf \"%c %c\" @@ fun a b -> Printf.printf \"%s\\n\" @@\n  if a <= b\n  then String.make (int_of_char b - 48) a\n  else String.make (int_of_char a - 48) b", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s529353271", "group_id": "codeNet:p02790", "input_text": "open Printf\nopen Scanf\n\nlet solve a b = String.make (max a b) @@ Char.chr @@ 48 + (min a b)\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582032567, "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/s529353271.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s529353271", "user_id": "u388783188"}, "prompt_components": {"gold_output": "3333\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b = String.make (max a b) @@ Char.chr @@ 48 + (min a b)\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%s\\n\"\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s163620923", "group_id": "codeNet:p02791", "input_text": "let n = read_int ()\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.fold_left (fun (m, c) p -> if p <= m then p, c + 1 else m, c) (ps.(0), 0) ps |> snd |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1579474861, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02791.html", "problem_id": "p02791", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02791/input.txt", "sample_output_relpath": "derived/input_output/data/p02791/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02791/OCaml/s163620923.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s163620923", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n = read_int ()\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.fold_left (fun (m, c) p -> if p <= m then p, c + 1 else m, c) (ps.(0), 0) ps |> snd |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "sample_input": "5\n4 2 5 1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02791", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 57, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s297691935", "group_id": "codeNet:p02795", "input_text": "let () =\n  Scanf.scanf \"%d\\n%d\\n%d\\n\" @@ fun h w n ->\n  let m = max h w in\n  Printf.printf \"%d\\n\" (if n mod m = 0 then n / m else n / m + 1)", "language": "OCaml", "metadata": {"date": 1599327170, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02795.html", "problem_id": "p02795", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02795/input.txt", "sample_output_relpath": "derived/input_output/data/p02795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02795/OCaml/s297691935.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s297691935", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n%d\\n%d\\n\" @@ fun h w n ->\n  let m = max h w in\n  Printf.printf \"%d\\n\" (if n mod m = 0 then n / m else n / m + 1)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns, where all the squares are initially white.\n\nYou will perform some number of painting operations on the grid.\nIn one operation, you can do one of the following two actions:\n\nChoose one row, then paint all the squares in that row black.\n\nChoose one column, then paint all the squares in that column black.\n\nAt least how many operations do you need in order to have N or more black squares in the grid?\nIt is guaranteed that, under the conditions in Constraints, having N or more black squares is always possible by performing some number of operations.\n\nConstraints\n\n1 \\leq H \\leq 100\n\n1 \\leq W \\leq 100\n\n1 \\leq N \\leq H \\times W\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\nW\nN\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3\n7\n10\n\nSample Output 1\n\n2\n\nYou can have 14 black squares in the grid by performing the \"row\" operation twice, on different rows.\n\nSample Input 2\n\n14\n12\n112\n\nSample Output 2\n\n8\n\nSample Input 3\n\n2\n100\n200\n\nSample Output 3\n\n2", "sample_input": "3\n7\n10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02795", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns, where all the squares are initially white.\n\nYou will perform some number of painting operations on the grid.\nIn one operation, you can do one of the following two actions:\n\nChoose one row, then paint all the squares in that row black.\n\nChoose one column, then paint all the squares in that column black.\n\nAt least how many operations do you need in order to have N or more black squares in the grid?\nIt is guaranteed that, under the conditions in Constraints, having N or more black squares is always possible by performing some number of operations.\n\nConstraints\n\n1 \\leq H \\leq 100\n\n1 \\leq W \\leq 100\n\n1 \\leq N \\leq H \\times W\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\nW\nN\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3\n7\n10\n\nSample Output 1\n\n2\n\nYou can have 14 black squares in the grid by performing the \"row\" operation twice, on different rows.\n\nSample Input 2\n\n14\n12\n112\n\nSample Output 2\n\n8\n\nSample Input 3\n\n2\n100\n200\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 140, "cpu_time_ms": 7, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s971430926", "group_id": "codeNet:p02796", "input_text": "let 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 xls = Array.init (n + 1) @@ function\n    | 0 -> (-100000000, 0)\n    | _ -> Scanf.scanf \"%d %d\\n\" @@ fun x l -> x, l in\n  Array.sort (fun (x, l) (x', l') -> compare (x + l) (x' + l')) xls;\n  let dp = Array.make (n + 1) 0 in\n  for i = 1 to n do\n    dp.(i) <- max (dp.(i - 1)) @@\n      1 + dp.(upper_bound 0 i (fun j ->\n        fst (xls.(j)) + snd (xls.(j)) <= fst (xls.(i)) - snd (xls.(i))))\n  done;\n  Printf.printf \"%d\\n\" dp.(n)", "language": "OCaml", "metadata": {"date": 1579379343, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02796.html", "problem_id": "p02796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02796/input.txt", "sample_output_relpath": "derived/input_output/data/p02796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02796/OCaml/s971430926.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s971430926", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let 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 xls = Array.init (n + 1) @@ function\n    | 0 -> (-100000000, 0)\n    | _ -> Scanf.scanf \"%d %d\\n\" @@ fun x l -> x, l in\n  Array.sort (fun (x, l) (x', l') -> compare (x + l) (x' + l')) xls;\n  let dp = Array.make (n + 1) 0 in\n  for i = 1 to n do\n    dp.(i) <- max (dp.(i - 1)) @@\n      1 + dp.(upper_bound 0 i (fun j ->\n        fst (xls.(j)) + snd (xls.(j)) <= fst (xls.(i)) - snd (xls.(i))))\n  done;\n  Printf.printf \"%d\\n\" dp.(n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "sample_input": "4\n2 4\n4 3\n9 3\n100 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02796", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 139, "memory_kb": 7552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s747815826", "group_id": "codeNet:p02796", "input_text": "let 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 xls = Array.init (n + 1) @@ function\n    | 0 -> (-100000000, 0)\n    | _ -> Scanf.scanf \"%d %d\\n\" @@ fun x l -> x, l in\n  Array.sort (fun (x, l) (x', l') -> compare (x + l) (x' + l')) xls;\n  let dp = Array.make (n + 1) 0 in\n  for i = 1 to n do\n    dp.(i) <-\n      1 + dp.(upper_bound 0 i (fun j ->\n        fst (xls.(j)) + snd (xls.(j)) <= fst (xls.(i)) - snd (xls.(i))))\n  done;\n  Printf.printf \"%d\\n\" @@ Array.fold_left max 0 dp", "language": "OCaml", "metadata": {"date": 1579379239, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02796.html", "problem_id": "p02796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02796/input.txt", "sample_output_relpath": "derived/input_output/data/p02796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02796/OCaml/s747815826.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s747815826", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let 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 xls = Array.init (n + 1) @@ function\n    | 0 -> (-100000000, 0)\n    | _ -> Scanf.scanf \"%d %d\\n\" @@ fun x l -> x, l in\n  Array.sort (fun (x, l) (x', l') -> compare (x + l) (x' + l')) xls;\n  let dp = Array.make (n + 1) 0 in\n  for i = 1 to n do\n    dp.(i) <-\n      1 + dp.(upper_bound 0 i (fun j ->\n        fst (xls.(j)) + snd (xls.(j)) <= fst (xls.(i)) - snd (xls.(i))))\n  done;\n  Printf.printf \"%d\\n\" @@ Array.fold_left max 0 dp", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "sample_input": "4\n2 4\n4 3\n9 3\n100 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02796", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 632, "cpu_time_ms": 139, "memory_kb": 7296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s043817373", "group_id": "codeNet:p02798", "input_text": "let rec popcnt acc = function\n  | 0 -> acc\n  | n -> popcnt (acc + (acc land 1)) (n lsr 1)\nlet popcnt = popcnt 0\n\nlet rec drop n = function\n  | [] -> []\n  | (_ :: t) as l ->\n      if n = 0\n      then l\n      else drop (n - 1) t\n\nlet sort_count ( <= ) xs =\n  let rec merge_count acc xs ys n cnt =\n    match xs, ys with\n    | _, [] -> cnt, List.rev_append acc xs\n    | [], _ -> cnt, List.rev_append acc ys\n    | x :: xs', y :: ys' ->\n        if x <= y\n        then merge_count (x :: acc) xs' ys (n - 1) cnt\n        else merge_count (y :: acc) xs ys' n (n + cnt) in\n  let rec sort_count xs = function\n    | 0 -> 0, []\n    | 1 -> 0, [List.hd xs]\n    | n ->\n        let c, ys = sort_count xs (n / 2) in\n        let d, zs = sort_count (drop (n / 2) xs) ((n + 1) / 2) in\n        merge_count [] ys zs (n / 2) (c + d) in\n  sort_count xs (List.length xs)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let bs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun b -> b in\n  let ans =\n    Array.fold_left min max_int @@\n    Array.init (1 lsl n) @@ fun s ->\n      if popcnt s mod 2 = 1 then max_int else\n      let f i = if s land (1 lsl i) = 0 then as_.(i) else bs.(i) in\n      let (inv, xs) =\n        sort_count (fun i j -> f i <= f j) @@\n        Array.to_list @@\n        Array.init n @@ fun i -> i in\n      let ((x, b) :: bs) = List.mapi (fun i j -> (f j, (i mod 2 = j mod 2) = (s land (1 lsl j) = 0))) xs in\n      match\n        List.fold_left (fun (x, b, inv) (x', b') ->\n          if b\n          then (x', b', inv)\n          else if x = x'\n          then (x', not b', inv + 1)\n          else raise Not_found) (x, b, inv) bs\n      with\n      | exception Not_found -> max_int\n      | (_, true, inv) -> inv\n      | (_, false, _) -> max_int in\n  Printf.printf \"%d\\n\" @@ if ans = max_int then -1 else ans", "language": "OCaml", "metadata": {"date": 1579388429, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02798.html", "problem_id": "p02798", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02798/input.txt", "sample_output_relpath": "derived/input_output/data/p02798/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02798/OCaml/s043817373.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s043817373", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let rec popcnt acc = function\n  | 0 -> acc\n  | n -> popcnt (acc + (acc land 1)) (n lsr 1)\nlet popcnt = popcnt 0\n\nlet rec drop n = function\n  | [] -> []\n  | (_ :: t) as l ->\n      if n = 0\n      then l\n      else drop (n - 1) t\n\nlet sort_count ( <= ) xs =\n  let rec merge_count acc xs ys n cnt =\n    match xs, ys with\n    | _, [] -> cnt, List.rev_append acc xs\n    | [], _ -> cnt, List.rev_append acc ys\n    | x :: xs', y :: ys' ->\n        if x <= y\n        then merge_count (x :: acc) xs' ys (n - 1) cnt\n        else merge_count (y :: acc) xs ys' n (n + cnt) in\n  let rec sort_count xs = function\n    | 0 -> 0, []\n    | 1 -> 0, [List.hd xs]\n    | n ->\n        let c, ys = sort_count xs (n / 2) in\n        let d, zs = sort_count (drop (n / 2) xs) ((n + 1) / 2) in\n        merge_count [] ys zs (n / 2) (c + d) in\n  sort_count xs (List.length xs)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let bs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun b -> b in\n  let ans =\n    Array.fold_left min max_int @@\n    Array.init (1 lsl n) @@ fun s ->\n      if popcnt s mod 2 = 1 then max_int else\n      let f i = if s land (1 lsl i) = 0 then as_.(i) else bs.(i) in\n      let (inv, xs) =\n        sort_count (fun i j -> f i <= f j) @@\n        Array.to_list @@\n        Array.init n @@ fun i -> i in\n      let ((x, b) :: bs) = List.mapi (fun i j -> (f j, (i mod 2 = j mod 2) = (s land (1 lsl j) = 0))) xs in\n      match\n        List.fold_left (fun (x, b, inv) (x', b') ->\n          if b\n          then (x', b', inv)\n          else if x = x'\n          then (x', not b', inv + 1)\n          else raise Not_found) (x, b, inv) bs\n      with\n      | exception Not_found -> max_int\n      | (_, true, inv) -> inv\n      | (_, false, _) -> max_int in\n  Printf.printf \"%d\\n\" @@ if ans = max_int then -1 else ans", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have N cards numbered 1, 2, ..., N.\nCard i (1 \\leq i \\leq N) has an integer A_i written in red ink on one side and an integer B_i written in blue ink on the other side.\nInitially, these cards are arranged from left to right in the order from Card 1 to Card N, with the red numbers facing up.\n\nDetermine whether it is possible to have a non-decreasing sequence facing up from left to right (that is, for each i (1 \\leq i \\leq N - 1), the integer facing up on the (i+1)-th card from the left is not less than the integer facing up on the i-th card from the left) by repeating the operation below. If the answer is yes, find the minimum number of operations required to achieve it.\n\nChoose an integer i (1 \\leq i \\leq N - 1).\nSwap the i-th and (i+1)-th cards from the left, then flip these two cards.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i, B_i \\leq 50 (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 A_2 ... A_N\nB_1 B_2 ... B_N\n\nOutput\n\nIf it is impossible to have a non-decreasing sequence, print -1.\nIf it is possible, print the minimum number of operations required to achieve it.\n\nSample Input 1\n\n3\n3 4 3\n3 2 3\n\nSample Output 1\n\n1\n\nBy doing the operation once with i = 1, we have a sequence [2, 3, 3] facing up, which is non-decreasing.\n\nSample Input 2\n\n2\n2 1\n1 2\n\nSample Output 2\n\n-1\n\nAfter any number of operations, we have the sequence [2, 1] facing up, which is not non-decreasing.\n\nSample Input 3\n\n4\n1 2 3 4\n5 6 7 8\n\nSample Output 3\n\n0\n\nNo operation may be required.\n\nSample Input 4\n\n5\n28 15 22 43 31\n20 22 43 33 32\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n5\n4 46 6 38 43\n33 15 18 27 37\n\nSample Output 5\n\n3", "sample_input": "3\n3 4 3\n3 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02798", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have N cards numbered 1, 2, ..., N.\nCard i (1 \\leq i \\leq N) has an integer A_i written in red ink on one side and an integer B_i written in blue ink on the other side.\nInitially, these cards are arranged from left to right in the order from Card 1 to Card N, with the red numbers facing up.\n\nDetermine whether it is possible to have a non-decreasing sequence facing up from left to right (that is, for each i (1 \\leq i \\leq N - 1), the integer facing up on the (i+1)-th card from the left is not less than the integer facing up on the i-th card from the left) by repeating the operation below. If the answer is yes, find the minimum number of operations required to achieve it.\n\nChoose an integer i (1 \\leq i \\leq N - 1).\nSwap the i-th and (i+1)-th cards from the left, then flip these two cards.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i, B_i \\leq 50 (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 A_2 ... A_N\nB_1 B_2 ... B_N\n\nOutput\n\nIf it is impossible to have a non-decreasing sequence, print -1.\nIf it is possible, print the minimum number of operations required to achieve it.\n\nSample Input 1\n\n3\n3 4 3\n3 2 3\n\nSample Output 1\n\n1\n\nBy doing the operation once with i = 1, we have a sequence [2, 3, 3] facing up, which is non-decreasing.\n\nSample Input 2\n\n2\n2 1\n1 2\n\nSample Output 2\n\n-1\n\nAfter any number of operations, we have the sequence [2, 1] facing up, which is not non-decreasing.\n\nSample Input 3\n\n4\n1 2 3 4\n5 6 7 8\n\nSample Output 3\n\n0\n\nNo operation may be required.\n\nSample Input 4\n\n5\n28 15 22 43 31\n20 22 43 33 32\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n5\n4 46 6 38 43\n33 15 18 27 37\n\nSample Output 5\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1857, "cpu_time_ms": 496, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s563505578", "group_id": "codeNet:p02798", "input_text": "let rec popcnt acc = function\n  | 0 -> acc\n  | n -> popcnt (acc + (acc land 1)) (n lsr 1)\nlet popcnt = popcnt 0\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 SumSegTree = SegTree.Make (struct\n  type t = int\n  let op = ( + )\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 bs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun b -> b in\n  let ans =\n    Array.fold_left min max_int @@\n    Array.init (1 lsl n) @@ fun s ->\n      if popcnt s mod 2 = 1 then max_int else\n      let (inv, diff, _) =\n        Array.fold_left (fun (inv, diff, same) (x, b) ->\n          let d = SumSegTree.query (x + 1) 52 diff + SumSegTree.query (x + 1) 52 same in\n          if (d mod 2 = 0) = b\n          then (inv + d, diff, SumSegTree.update x succ same)\n          else (inv + d, SumSegTree.update x succ diff, same))\n        (0, SumSegTree.init 53 (fun _ -> 0), SumSegTree.init 53 (fun _ -> 0)) @@\n        Array.init n @@ fun i -> if (s land (1 lsl i)) = 0 then (as_.(i), true) else (bs.(i), false) in\n      try\n        Array.fold_left ( + ) inv @@\n        Array.init 51 @@ fun i ->\n          let x = SumSegTree.query i (i + 1) diff in\n          if x mod 2 = 1\n          then raise Not_found\n          else x / 2\n      with Not_found -> max_int in\n  Printf.printf \"%d\\n\" @@ if ans = max_int then -1 else ans", "language": "OCaml", "metadata": {"date": 1579382952, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02798.html", "problem_id": "p02798", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02798/input.txt", "sample_output_relpath": "derived/input_output/data/p02798/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02798/OCaml/s563505578.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s563505578", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let rec popcnt acc = function\n  | 0 -> acc\n  | n -> popcnt (acc + (acc land 1)) (n lsr 1)\nlet popcnt = popcnt 0\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 SumSegTree = SegTree.Make (struct\n  type t = int\n  let op = ( + )\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 bs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun b -> b in\n  let ans =\n    Array.fold_left min max_int @@\n    Array.init (1 lsl n) @@ fun s ->\n      if popcnt s mod 2 = 1 then max_int else\n      let (inv, diff, _) =\n        Array.fold_left (fun (inv, diff, same) (x, b) ->\n          let d = SumSegTree.query (x + 1) 52 diff + SumSegTree.query (x + 1) 52 same in\n          if (d mod 2 = 0) = b\n          then (inv + d, diff, SumSegTree.update x succ same)\n          else (inv + d, SumSegTree.update x succ diff, same))\n        (0, SumSegTree.init 53 (fun _ -> 0), SumSegTree.init 53 (fun _ -> 0)) @@\n        Array.init n @@ fun i -> if (s land (1 lsl i)) = 0 then (as_.(i), true) else (bs.(i), false) in\n      try\n        Array.fold_left ( + ) inv @@\n        Array.init 51 @@ fun i ->\n          let x = SumSegTree.query i (i + 1) diff in\n          if x mod 2 = 1\n          then raise Not_found\n          else x / 2\n      with Not_found -> max_int in\n  Printf.printf \"%d\\n\" @@ if ans = max_int then -1 else ans", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have N cards numbered 1, 2, ..., N.\nCard i (1 \\leq i \\leq N) has an integer A_i written in red ink on one side and an integer B_i written in blue ink on the other side.\nInitially, these cards are arranged from left to right in the order from Card 1 to Card N, with the red numbers facing up.\n\nDetermine whether it is possible to have a non-decreasing sequence facing up from left to right (that is, for each i (1 \\leq i \\leq N - 1), the integer facing up on the (i+1)-th card from the left is not less than the integer facing up on the i-th card from the left) by repeating the operation below. If the answer is yes, find the minimum number of operations required to achieve it.\n\nChoose an integer i (1 \\leq i \\leq N - 1).\nSwap the i-th and (i+1)-th cards from the left, then flip these two cards.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i, B_i \\leq 50 (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 A_2 ... A_N\nB_1 B_2 ... B_N\n\nOutput\n\nIf it is impossible to have a non-decreasing sequence, print -1.\nIf it is possible, print the minimum number of operations required to achieve it.\n\nSample Input 1\n\n3\n3 4 3\n3 2 3\n\nSample Output 1\n\n1\n\nBy doing the operation once with i = 1, we have a sequence [2, 3, 3] facing up, which is non-decreasing.\n\nSample Input 2\n\n2\n2 1\n1 2\n\nSample Output 2\n\n-1\n\nAfter any number of operations, we have the sequence [2, 1] facing up, which is not non-decreasing.\n\nSample Input 3\n\n4\n1 2 3 4\n5 6 7 8\n\nSample Output 3\n\n0\n\nNo operation may be required.\n\nSample Input 4\n\n5\n28 15 22 43 31\n20 22 43 33 32\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n5\n4 46 6 38 43\n33 15 18 27 37\n\nSample Output 5\n\n3", "sample_input": "3\n3 4 3\n3 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02798", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have N cards numbered 1, 2, ..., N.\nCard i (1 \\leq i \\leq N) has an integer A_i written in red ink on one side and an integer B_i written in blue ink on the other side.\nInitially, these cards are arranged from left to right in the order from Card 1 to Card N, with the red numbers facing up.\n\nDetermine whether it is possible to have a non-decreasing sequence facing up from left to right (that is, for each i (1 \\leq i \\leq N - 1), the integer facing up on the (i+1)-th card from the left is not less than the integer facing up on the i-th card from the left) by repeating the operation below. If the answer is yes, find the minimum number of operations required to achieve it.\n\nChoose an integer i (1 \\leq i \\leq N - 1).\nSwap the i-th and (i+1)-th cards from the left, then flip these two cards.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i, B_i \\leq 50 (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 A_2 ... A_N\nB_1 B_2 ... B_N\n\nOutput\n\nIf it is impossible to have a non-decreasing sequence, print -1.\nIf it is possible, print the minimum number of operations required to achieve it.\n\nSample Input 1\n\n3\n3 4 3\n3 2 3\n\nSample Output 1\n\n1\n\nBy doing the operation once with i = 1, we have a sequence [2, 3, 3] facing up, which is non-decreasing.\n\nSample Input 2\n\n2\n2 1\n1 2\n\nSample Output 2\n\n-1\n\nAfter any number of operations, we have the sequence [2, 1] facing up, which is not non-decreasing.\n\nSample Input 3\n\n4\n1 2 3 4\n5 6 7 8\n\nSample Output 3\n\n0\n\nNo operation may be required.\n\nSample Input 4\n\n5\n28 15 22 43 31\n20 22 43 33 32\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n5\n4 46 6 38 43\n33 15 18 27 37\n\nSample Output 5\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3825, "cpu_time_ms": 1587, "memory_kb": 8448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s399976393", "group_id": "codeNet:p02801", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  scanf \"%c\" (fun c -> Char.chr @@ (fun x -> x + 1) @@ Char.code c) |> printf \"%c\\n\"\n", "language": "OCaml", "metadata": {"date": 1581601166, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02801.html", "problem_id": "p02801", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02801/input.txt", "sample_output_relpath": "derived/input_output/data/p02801/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02801/OCaml/s399976393.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s399976393", "user_id": "u388783188"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  scanf \"%c\" (fun c -> Char.chr @@ (fun x -> x + 1) @@ Char.code c) |> printf \"%c\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "sample_input": "a\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02801", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s358868580", "group_id": "codeNet:p02801", "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": 1580756732, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02801.html", "problem_id": "p02801", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02801/input.txt", "sample_output_relpath": "derived/input_output/data/p02801/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02801/OCaml/s358868580.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s358868580", "user_id": "u732304692"}, "prompt_components": {"gold_output": "b\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 : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "sample_input": "a\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02801", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s632109726", "group_id": "codeNet:p02802", "input_text": "let m, cs, c, d = Scanf.scanf \"%d %d\" @@ fun n m -> m, Array.make n (0, 0), ref 0, ref 0\nlet _ = for _ = 1 to m do Scanf.scanf \" %d %s\" @@ fun p s -> let a, w = cs.(p - 1) in if s = \"AC\" then (if a = 0 then (d := !d + w; cs.(p - 1) <- 1, w; incr c)) else if a = 0 then cs.(p - 1) <- a, w + 1 done; Printf.printf \"%d %d\\n\" !c !d", "language": "OCaml", "metadata": {"date": 1578952126, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02802/input.txt", "sample_output_relpath": "derived/input_output/data/p02802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02802/OCaml/s632109726.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s632109726", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "let m, cs, c, d = Scanf.scanf \"%d %d\" @@ fun n m -> m, Array.make n (0, 0), ref 0, ref 0\nlet _ = for _ = 1 to m do Scanf.scanf \" %d %s\" @@ fun p s -> let a, w = cs.(p - 1) in if s = \"AC\" then (if a = 0 then (d := !d + w; cs.(p - 1) <- 1, w; incr c)) else if a = 0 then cs.(p - 1) <- a, w + 1 done; Printf.printf \"%d %d\\n\" !c !d", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "sample_input": "2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p02802", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 52, "memory_kb": 6528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s339009601", "group_id": "codeNet:p02805", "input_text": "let () =\n    let main () =\n        let n = Scanf.scanf \"%d\" (fun n -> n) in\n        let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n        let gx, gy = Array.fold_left (fun (ax, ay) (x, y) -> ax + x, ay + y) (0, 0) xy in\n        let gx = float gx /. float n in\n        let gy = float gy /. float n in\n\n        let ax = Array.init n (fun i -> xy.(i) |> fst |> float) in\n        let ay = Array.init n (fun i -> xy.(i) |> snd |> float) in\n\n        let rec loop_i i p x y last_dist =\n            if i = 0 then sqrt last_dist else\n                let rec loop_j j fx fy max_dist =\n                    if j = n then loop_i (i - 1) (p *. 0.999) (x +. (fx -. x) *. p) (y +. (fy -. y) *. p) max_dist else\n                        let d = (ax.(j) -. x) *. (ax.(j) -. x) +. (ay.(j) -. y) *. (ay.(j) -. y) in\n                        if max_dist < d then loop_j (j + 1) ax.(j) ay.(j) d else\n                            loop_j (j + 1) fx fy max_dist\n                in\n                loop_j 0 0.0 0.0 0.0\n        in\n        loop_i 30000 0.1 gx gy 0.0 |> Printf.printf \"%.10f\\n\"\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1578887728, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02805.html", "problem_id": "p02805", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02805/input.txt", "sample_output_relpath": "derived/input_output/data/p02805/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02805/OCaml/s339009601.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339009601", "user_id": "u342443598"}, "prompt_components": {"gold_output": "0.500000000000000000\n", "input_to_evaluate": "let () =\n    let main () =\n        let n = Scanf.scanf \"%d\" (fun n -> n) in\n        let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n        let gx, gy = Array.fold_left (fun (ax, ay) (x, y) -> ax + x, ay + y) (0, 0) xy in\n        let gx = float gx /. float n in\n        let gy = float gy /. float n in\n\n        let ax = Array.init n (fun i -> xy.(i) |> fst |> float) in\n        let ay = Array.init n (fun i -> xy.(i) |> snd |> float) in\n\n        let rec loop_i i p x y last_dist =\n            if i = 0 then sqrt last_dist else\n                let rec loop_j j fx fy max_dist =\n                    if j = n then loop_i (i - 1) (p *. 0.999) (x +. (fx -. x) *. p) (y +. (fy -. y) *. p) max_dist else\n                        let d = (ax.(j) -. x) *. (ax.(j) -. x) +. (ay.(j) -. y) *. (ay.(j) -. y) in\n                        if max_dist < d then loop_j (j + 1) ax.(j) ay.(j) d else\n                            loop_j (j + 1) fx fy max_dist\n                in\n                loop_j 0 0.0 0.0 0.0\n        in\n        loop_i 30000 0.1 gx gy 0.0 |> Printf.printf \"%.10f\\n\"\n    in\n    main ()", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "sample_input": "2\n0 0\n1 0\n"}, "reference_outputs": ["0.500000000000000000\n"], "source_document_id": "p02805", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 4608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s631197119", "group_id": "codeNet:p02806", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let pair = Array.init n @@ fun _ -> Scanf.scanf \"%s %d\\n\" @@ fun s t -> (s, t) in\n  Scanf.scanf \"%s\\n\" @@ fun x ->\n  let sum = Array.fold_left (fun sum p -> sum + snd p) 0 pair in\n  let listen = Array.fold_left\n      (fun (sum, b) p -> if fst p = x then (sum + snd p, true) else if b then (sum, b) else (sum + snd p, b))\n      (0, false) pair  in\n  Printf.printf \"%d\\n\" (sum - fst listen)", "language": "OCaml", "metadata": {"date": 1592243080, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02806.html", "problem_id": "p02806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02806/input.txt", "sample_output_relpath": "derived/input_output/data/p02806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02806/OCaml/s631197119.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631197119", "user_id": "u307426615"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let pair = Array.init n @@ fun _ -> Scanf.scanf \"%s %d\\n\" @@ fun s t -> (s, t) in\n  Scanf.scanf \"%s\\n\" @@ fun x ->\n  let sum = Array.fold_left (fun sum p -> sum + snd p) 0 pair in\n  let listen = Array.fold_left\n      (fun (sum, b) p -> if fst p = x then (sum + snd p, true) else if b then (sum, b) else (sum + snd p, b))\n      (0, false) pair  in\n  Printf.printf \"%d\\n\" (sum - fst listen)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "sample_input": "3\ndwango 2\nsixth 5\nprelims 25\ndwango\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02806", "source_text": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s744013200", "group_id": "codeNet:p02806", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let ar = Array.init n (fun _ -> scanf \"%s %d \" (fun x y -> (x, y))) in\n  let (_, db) = Array.fold_right (fun (nm, t) (tt, ls) -> (t + tt, (nm, tt) :: ls)) ar (0, []) in\n  let s = scanf \"%s \" (fun x -> x) in\n  printf \"%d\\n\" @@ List.assoc s db\n", "language": "OCaml", "metadata": {"date": 1581540957, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02806.html", "problem_id": "p02806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02806/input.txt", "sample_output_relpath": "derived/input_output/data/p02806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02806/OCaml/s744013200.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744013200", "user_id": "u388783188"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let ar = Array.init n (fun _ -> scanf \"%s %d \" (fun x y -> (x, y))) in\n  let (_, db) = Array.fold_right (fun (nm, t) (tt, ls) -> (t + tt, (nm, tt) :: ls)) ar (0, []) in\n  let s = scanf \"%s \" (fun x -> x) in\n  printf \"%d\\n\" @@ List.assoc s db\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "sample_input": "3\ndwango 2\nsixth 5\nprelims 25\ndwango\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02806", "source_text": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 315, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s349362545", "group_id": "codeNet:p02811", "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 (k, x) = scan \"%d %d\" BatTuple.Tuple2.make\n\nlet () =\n  printf \"%s\\n\"\n    (if x <= k * 500 then\n       \"Yes\"\n     else\n       \"No\")\n", "language": "OCaml", "metadata": {"date": 1581909649, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s349362545.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349362545", "user_id": "u802614675"}, "prompt_components": {"gold_output": "Yes\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 (k, x) = scan \"%d %d\" BatTuple.Tuple2.make\n\nlet () =\n  printf \"%s\\n\"\n    (if x <= k * 500 then\n       \"Yes\"\n     else\n       \"No\")\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 427, "cpu_time_ms": 8, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s737976136", "group_id": "codeNet:p02812", "input_text": "let () = Scanf.scanf \"%d\\n%s\" @@ fun n s ->\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init (n - 2) @@ fun i ->\n    if s.[i] = 'A' && s.[i + 1] = 'B' && s.[i + 2] = 'C'\n    then 1\n    else 0\n", "language": "OCaml", "metadata": {"date": 1578710380, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02812.html", "problem_id": "p02812", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02812/input.txt", "sample_output_relpath": "derived/input_output/data/p02812/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02812/OCaml/s737976136.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s737976136", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n%s\" @@ fun n s ->\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init (n - 2) @@ fun i ->\n    if s.[i] = 'A' && s.[i + 1] = 'B' && s.[i + 2] = 'C'\n    then 1\n    else 0\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\n\nSample Output 3\n\n5", "sample_input": "10\nZABCDBABCQ\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02812", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s773942156", "group_id": "codeNet:p02813", "input_text": "open Batteries\nlet rec perm n ls =\n  if n = 0 then [[]]\n  else flatmap (fun x -> List.map (fun y -> x :: y)\n                                  (perm (n - 1) (remove x ls)))\n               ls\nand remove x ls = List.filter (fun y -> x <> y) ls\nand flatten = function\n  [] -> []\n| x::xs -> x @ (flatten xs)\nand flatmap func ls = flatten (List.map func ls)\n\n\nlet n = read_int ()\nlet rec m lst =\n  match lst with\n   [] -> \"\"\n  | first :: rest -> first ^ m rest\nlet p = m (read_line () |> String.split_on_char ' ')\nlet q = m (read_line () |> String.split_on_char ' ')\nlet rec g k =\n  match k with\n   0 -> []\n  | _ -> k :: g (k-1)\nlet all = \n  let rec h lst =\n    match lst with\n     [] -> []\n    | first :: rest -> m(List.map string_of_int first) :: h rest\n  in List.sort compare (h(perm n (g n)))\n\nlet _ = \n  let rec o target l s =\n    match l with\n     [] -> 0\n    | first :: rest -> if first = target then s else o target rest (s+1)\n  in let jj t = if t < 0 then t * (-1) else t\n    in print_endline(string_of_int (jj( (o p all 1) - (o q all 1))))\n", "language": "OCaml", "metadata": {"date": 1583857371, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02813.html", "problem_id": "p02813", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02813/input.txt", "sample_output_relpath": "derived/input_output/data/p02813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02813/OCaml/s773942156.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773942156", "user_id": "u511870776"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nlet rec perm n ls =\n  if n = 0 then [[]]\n  else flatmap (fun x -> List.map (fun y -> x :: y)\n                                  (perm (n - 1) (remove x ls)))\n               ls\nand remove x ls = List.filter (fun y -> x <> y) ls\nand flatten = function\n  [] -> []\n| x::xs -> x @ (flatten xs)\nand flatmap func ls = flatten (List.map func ls)\n\n\nlet n = read_int ()\nlet rec m lst =\n  match lst with\n   [] -> \"\"\n  | first :: rest -> first ^ m rest\nlet p = m (read_line () |> String.split_on_char ' ')\nlet q = m (read_line () |> String.split_on_char ' ')\nlet rec g k =\n  match k with\n   0 -> []\n  | _ -> k :: g (k-1)\nlet all = \n  let rec h lst =\n    match lst with\n     [] -> []\n    | first :: rest -> m(List.map string_of_int first) :: h rest\n  in List.sort compare (h(perm n (g n)))\n\nlet _ = \n  let rec o target l s =\n    match l with\n     [] -> 0\n    | first :: rest -> if first = target then s else o target rest (s+1)\n  in let jj t = if t < 0 then t * (-1) else t\n    in print_endline(string_of_int (jj( (o p all 1) - (o q all 1))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "sample_input": "3\n1 3 2\n3 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02813", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 120, "memory_kb": 18688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s342685418", "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 i = n then acc else\n                loop (i + 1) (lcm acc (a.(i) / 2))\n        in\n        let l = loop 1 (a.(0) / 2) in\n        let r = if Array.fold_left (fun t k -> t || ((l / (k / 2)) mod 2 = 0)) false a then 0 else (m / l + 1) / 2 in\n        Printf.printf \"%d %d\\n\" l r\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1578711607, "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/s342685418.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s342685418", "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 i = n then acc else\n                loop (i + 1) (lcm acc (a.(i) / 2))\n        in\n        let l = loop 1 (a.(0) / 2) in\n        let r = if Array.fold_left (fun t k -> t || ((l / (k / 2)) mod 2 = 0)) false a then 0 else (m / l + 1) / 2 in\n        Printf.printf \"%d %d\\n\" l r\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s809721355", "group_id": "codeNet:p02817", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc149/tasks/abc149_a\n * string manipulation\n * *)\nprint_endline @@ Scanf.scanf \"%s %s\" @@ fun s t -> t ^ s\n\n", "language": "OCaml", "metadata": {"date": 1593401335, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s809721355.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s809721355", "user_id": "u737840172"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc149/tasks/abc149_a\n * string manipulation\n * *)\nprint_endline @@ Scanf.scanf \"%s %s\" @@ fun s t -> t ^ s\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "sample_input": "oder atc\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p02817", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 7, "memory_kb": 3740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s081797962", "group_id": "codeNet:p02818", "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 (a,b,k) = scan \"%d %d %d\" Tuple3.make\n\nlet () =\n  Printf.printf \"%d %d\" (max 0 (a-k)) @@ max 0 (if a-k < 0 then b + a -k else b)\n", "language": "OCaml", "metadata": {"date": 1590528454, "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/s081797962.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081797962", "user_id": "u802614675"}, "prompt_components": {"gold_output": "0 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 (a,b,k) = scan \"%d %d %d\" Tuple3.make\n\nlet () =\n  Printf.printf \"%d %d\" (max 0 (a-k)) @@ max 0 (if a-k < 0 then b + a -k else 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2134, "cpu_time_ms": 6, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s189391659", "group_id": "codeNet:p02819", "input_text": "let () =\n  let rec prime n m = if n = m then true else if n mod m = 0 then false else prime n (m+1) in\n  let rec check n m = if prime n 2 then n else if n = m then n else check (n+1) m  in\n  let n = read_int () in\n  Printf.printf \"%d\\n\" (check n (n*2))", "language": "OCaml", "metadata": {"date": 1592351126, "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/s189391659.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189391659", "user_id": "u307426615"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "let () =\n  let rec prime n m = if n = m then true else if n mod m = 0 then false else prime n (m+1) in\n  let rec check n m = if prime n 2 then n else if n = m then n else check (n+1) m  in\n  let n = read_int () in\n  Printf.printf \"%d\\n\" (check n (n*2))", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s250577688", "group_id": "codeNet:p02819", "input_text": "let x = read_int ()\nlet f n = if n <= 1 then false else let rec f i = if i * i > n then true else if n mod i = 0 then false else f @@ i + 1 in f 2\nlet _ = for i = x to 100003 do if f i then (Printf.printf \"%d\\n\" i; exit 0) done", "language": "OCaml", "metadata": {"date": 1577863315, "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/s250577688.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250577688", "user_id": "u732304692"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "let x = read_int ()\nlet f n = if n <= 1 then false else let rec f i = if i * i > n then true else if n mod i = 0 then false else f @@ i + 1 in f 2\nlet _ = for i = x to 100003 do if f i then (Printf.printf \"%d\\n\" i; exit 0) done", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s596909176", "group_id": "codeNet:p02820", "input_text": "let k, t, ss = Scanf.scanf \"%d %d %d %d %d %s\" @@ fun n k r s p t -> k, t, Array.init n (fun i -> match t.[i] with 'r' -> p | 's' -> r | _ -> s)\nlet _ = Array.(iteri (fun i s -> if i >= k && ss.(i - k) > 0 && t.[i] = t.[i - k] then ss.(i) <- 0) ss; fold_left (+) 0 ss) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1580512250, "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/s596909176.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s596909176", "user_id": "u732304692"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let k, t, ss = Scanf.scanf \"%d %d %d %d %d %s\" @@ fun n k r s p t -> k, t, Array.init n (fun i -> match t.[i] with 'r' -> p | 's' -> r | _ -> s)\nlet _ = Array.(iteri (fun i s -> if i >= k && ss.(i - k) > 0 && t.[i] = t.[i - k] then ss.(i) <- 0) ss; fold_left (+) 0 ss) |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 6, "memory_kb": 3584}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s144790520", "group_id": "codeNet:p02820", "input_text": "let n, k, r, s, p, t = Scanf.scanf \" %d %d %d %d %d %s\" @@ fun a b c d e f -> a, b, c, d, e, f\nlet f = function 'r' -> p | 's' -> r | _ -> s\nlet ss = Array.init n (fun i -> f t.[i])\nlet _ = Array.(iteri (fun i s -> if i >= k && ss.(i - k) > 0 && t.[i] = t.[i - k] then ss.(i) <- 0) ss; fold_left (+) 0 ss) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1580510665, "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/s144790520.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144790520", "user_id": "u732304692"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let n, k, r, s, p, t = Scanf.scanf \" %d %d %d %d %d %s\" @@ fun a b c d e f -> a, b, c, d, e, f\nlet f = function 'r' -> p | 's' -> r | _ -> s\nlet ss = Array.init n (fun i -> f t.[i])\nlet _ = Array.(iteri (fun i s -> if i >= k && ss.(i - k) > 0 && t.[i] = t.[i - k] then ss.(i) <- 0) ss; fold_left (+) 0 ss) |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 6, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s318967621", "group_id": "codeNet:p02822", "input_text": "let rec fix ~f x = f (fix ~f) x\n\nlet modulo = 1000000007\nlet (+@) a b = (a + b) mod modulo\nlet (-@) a b = (a - b + modulo) mod modulo\nlet ( *@) a b = (a * b) mod modulo\nlet rec ( **@) a n =\n  if n = 0 then 1\n  else if n mod 2 = 1 then a *@ a **@ (n-1)\n  else let h = a **@ (n/2) in h *@ h\nlet modinv a = a **@ (modulo-2)\nlet (/@) a b = a *@ modinv b\n\nlet input () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let g = Array.init (n+1) (fun _ -> []) in\n  for i = 1 to n-1 do\n    Scanf.scanf \" %d %d\" @@ fun a b ->\n    g.(a) <- b :: g.(a);\n    g.(b) <- a :: g.(b);\n  done;\n  n, g\n\nlet () =\n  let n, g = input () in\n  let _, lvs =\n    fix 1 0 [] ~f:(fun dfs u p lvs ->\n      let lv, lvs =\n       List.fold_left (fun (lv, lvs) v ->\n          if v = p then (lv, lvs)\n          else\n            let c, lvs' = dfs v u lvs\n            in (c :: lv, lvs')) ([], lvs) g.(u)\n      in\n      let cn = List.fold_left (+) 0 lv in\n      let lv = n-1-cn :: lv in\n      1 + cn, lv :: lvs)\n  in\n  List.fold_left (fun ans lv ->\n    let b0 = List.fold_left (fun b0 l -> b0 /@ (2 **@ l)) 1 lv in\n    let b1 = List.fold_left (fun b1 l ->\n      b1 +@ b0 *@ (2 **@ l) *@ (1 -@ modinv (2 **@ l))) 0 lv in\n    ans +@ (1 -@ b0 -@ b1) /@ 2) 0 lvs\n  |> Printf.printf \"%d\\n\"\n    \n", "language": "OCaml", "metadata": {"date": 1577688508, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02822.html", "problem_id": "p02822", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02822/input.txt", "sample_output_relpath": "derived/input_output/data/p02822/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02822/OCaml/s318967621.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s318967621", "user_id": "u798181098"}, "prompt_components": {"gold_output": "125000001\n", "input_to_evaluate": "let rec fix ~f x = f (fix ~f) x\n\nlet modulo = 1000000007\nlet (+@) a b = (a + b) mod modulo\nlet (-@) a b = (a - b + modulo) mod modulo\nlet ( *@) a b = (a * b) mod modulo\nlet rec ( **@) a n =\n  if n = 0 then 1\n  else if n mod 2 = 1 then a *@ a **@ (n-1)\n  else let h = a **@ (n/2) in h *@ h\nlet modinv a = a **@ (modulo-2)\nlet (/@) a b = a *@ modinv b\n\nlet input () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let g = Array.init (n+1) (fun _ -> []) in\n  for i = 1 to n-1 do\n    Scanf.scanf \" %d %d\" @@ fun a b ->\n    g.(a) <- b :: g.(a);\n    g.(b) <- a :: g.(b);\n  done;\n  n, g\n\nlet () =\n  let n, g = input () in\n  let _, lvs =\n    fix 1 0 [] ~f:(fun dfs u p lvs ->\n      let lv, lvs =\n       List.fold_left (fun (lv, lvs) v ->\n          if v = p then (lv, lvs)\n          else\n            let c, lvs' = dfs v u lvs\n            in (c :: lv, lvs')) ([], lvs) g.(u)\n      in\n      let cn = List.fold_left (+) 0 lv in\n      let lv = n-1-cn :: lv in\n      1 + cn, lv :: lvs)\n  in\n  List.fold_left (fun ans lv ->\n    let b0 = List.fold_left (fun b0 l -> b0 /@ (2 **@ l)) 1 lv in\n    let b1 = List.fold_left (fun b1 l ->\n      b1 +@ b0 *@ (2 **@ l) *@ (1 -@ modinv (2 **@ l))) 0 lv in\n    ans +@ (1 -@ b0 -@ b1) /@ 2) 0 lvs\n  |> Printf.printf \"%d\\n\"\n    \n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is a tree T with N vertices. The i-th edge connects Vertex A_i and B_i (1 \\leq A_i,B_i \\leq N).\n\nNow, each vertex is painted black with probability 1/2 and white with probability 1/2, which is chosen independently from other vertices. Then, let S be the smallest subtree (connected subgraph) of T containing all the vertices painted black. (If no vertex is painted black, S is the empty graph.)\n\nLet the holeyness of S be the number of white vertices contained in S. Find the expected holeyness of S.\n\nSince the answer is a rational number, we ask you to print it \\bmod 10^9+7, as described in Notes.\n\nNotes\n\nWhen you print a rational number, first write it as a fraction \\frac{y}{x}, where x, y are integers, and x is not divisible by 10^9 + 7\n(under the constraints of the problem, such representation is always possible).\n\nThen, you need to print the only integer z between 0 and 10^9 + 6, inclusive, that satisfies xz \\equiv y \\pmod{10^9 + 7}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i,B_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the expected holeyness of S, \\bmod 10^9+7.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n125000001\n\nIf the vertices 1, 2, 3 are painted black, white, black, respectively, the holeyness of S is 1.\n\nOtherwise, the holeyness is 0, so the expected holeyness is 1/8.\n\nSince 8 \\times 125000001 \\equiv 1 \\pmod{10^9+7}, we should print 125000001.\n\nSample Input 2\n\n4\n1 2\n2 3\n3 4\n\nSample Output 2\n\n375000003\n\nThe expected holeyness is 3/8.\n\nSince 8 \\times 375000003 \\equiv 3 \\pmod{10^9+7}, we should print 375000003.\n\nSample Input 3\n\n4\n1 2\n1 3\n1 4\n\nSample Output 3\n\n250000002\n\nThe expected holeyness is 1/4.\n\nSample Input 4\n\n7\n4 7\n3 1\n2 6\n5 2\n7 1\n2 7\n\nSample Output 4\n\n570312505", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["125000001\n"], "source_document_id": "p02822", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is a tree T with N vertices. The i-th edge connects Vertex A_i and B_i (1 \\leq A_i,B_i \\leq N).\n\nNow, each vertex is painted black with probability 1/2 and white with probability 1/2, which is chosen independently from other vertices. Then, let S be the smallest subtree (connected subgraph) of T containing all the vertices painted black. (If no vertex is painted black, S is the empty graph.)\n\nLet the holeyness of S be the number of white vertices contained in S. Find the expected holeyness of S.\n\nSince the answer is a rational number, we ask you to print it \\bmod 10^9+7, as described in Notes.\n\nNotes\n\nWhen you print a rational number, first write it as a fraction \\frac{y}{x}, where x, y are integers, and x is not divisible by 10^9 + 7\n(under the constraints of the problem, such representation is always possible).\n\nThen, you need to print the only integer z between 0 and 10^9 + 6, inclusive, that satisfies xz \\equiv y \\pmod{10^9 + 7}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i,B_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the expected holeyness of S, \\bmod 10^9+7.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n125000001\n\nIf the vertices 1, 2, 3 are painted black, white, black, respectively, the holeyness of S is 1.\n\nOtherwise, the holeyness is 0, so the expected holeyness is 1/8.\n\nSince 8 \\times 125000001 \\equiv 1 \\pmod{10^9+7}, we should print 125000001.\n\nSample Input 2\n\n4\n1 2\n2 3\n3 4\n\nSample Output 2\n\n375000003\n\nThe expected holeyness is 3/8.\n\nSince 8 \\times 375000003 \\equiv 3 \\pmod{10^9+7}, we should print 375000003.\n\nSample Input 3\n\n4\n1 2\n1 3\n1 4\n\nSample Output 3\n\n250000002\n\nThe expected holeyness is 1/4.\n\nSample Input 4\n\n7\n4 7\n3 1\n2 6\n5 2\n7 1\n2 7\n\nSample Output 4\n\n570312505", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1237, "cpu_time_ms": 1052, "memory_kb": 54140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s231950849", "group_id": "codeNet:p02829", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc148/tasks/abc148_a\n * implementation\n * *)\n\n\nlet solve a b = 6 - a - b\n\nlet main =\n    Scanf.scanf\"%d %d\" solve |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1593440390, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s231950849.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231950849", "user_id": "u737840172"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc148/tasks/abc148_a\n * implementation\n * *)\n\n\nlet solve a b = 6 - a - b\n\nlet main =\n    Scanf.scanf\"%d %d\" solve |> Printf.printf \"%d\\n\"\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s782392910", "group_id": "codeNet:p02829", "input_text": "let a = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ 6 - a - read_int ()", "language": "OCaml", "metadata": {"date": 1582595290, "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/s782392910.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782392910", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let a = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ 6 - a - read_int ()", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "sample_input": "3\n1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02829", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 71, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s436832034", "group_id": "codeNet:p02830", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc148/tasks/abc148_b\n * string manipulation\n * *)\nopen Printf\nopen Scanf\n\nlet main =\n    scanf\"%d %s %s\" (fun n s t ->\n    for i = 0 to n-1 do\n        printf \"%c%c\" s.[i] t.[i]\n    done\n    );\n    printf \"\\n\"\n    \n", "language": "OCaml", "metadata": {"date": 1593442243, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s436832034.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s436832034", "user_id": "u737840172"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc148/tasks/abc148_b\n * string manipulation\n * *)\nopen Printf\nopen Scanf\n\nlet main =\n    scanf\"%d %s %s\" (fun n s t ->\n    for i = 0 to n-1 do\n        printf \"%c%c\" s.[i] t.[i]\n    done\n    );\n    printf \"\\n\"\n    \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "sample_input": "2\nip cc\n"}, "reference_outputs": ["icpc\n"], "source_document_id": "p02830", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 3652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s612201908", "group_id": "codeNet:p02830", "input_text": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let s, t = Scanf.scanf \"%s %s\" (fun s t -> s, t) in\n        let rec loop i acc =\n            if i = n then acc else loop (i + 1)\n            (Printf.sprintf \"%s%c%c\" acc s.[i] t.[i])\n        in\n        loop 0 \"\" |> print_endline\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1577066643, "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/s612201908.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612201908", "user_id": "u342443598"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let s, t = Scanf.scanf \"%s %s\" (fun s t -> s, t) in\n        let rec loop i acc =\n            if i = n then acc else loop (i + 1)\n            (Printf.sprintf \"%s%c%c\" acc s.[i] t.[i])\n        in\n        loop 0 \"\" |> print_endline\n    in\n    main ()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "sample_input": "2\nip cc\n"}, "reference_outputs": ["icpc\n"], "source_document_id": "p02830", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s934803072", "group_id": "codeNet:p02834", "input_text": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n u v ->\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 rec visit visited depth d u =\n    if not visited.(u) then begin\n      depth.(u) <- d;\n      visited.(u) <- true;\n      List.iter (visit visited depth (d + 1)) es.(u)\n    end in\n  let depthT = Array.make n 0 in\n  let depthA = Array.make n 0 in\n  visit (Array.make n false) depthT 0 (u - 1);\n  visit (Array.make n false) depthA 0 (v - 1);\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left max min_int @@\n  Array.init n @@ fun i ->\n    if depthA.(i) < depthT.(i)\n    then min_int\n    else depthA.(i) - 1\n", "language": "OCaml", "metadata": {"date": 1577078494, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02834.html", "problem_id": "p02834", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02834/input.txt", "sample_output_relpath": "derived/input_output/data/p02834/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02834/OCaml/s934803072.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s934803072", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n u v ->\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 rec visit visited depth d u =\n    if not visited.(u) then begin\n      depth.(u) <- d;\n      visited.(u) <- true;\n      List.iter (visit visited depth (d + 1)) es.(u)\n    end in\n  let depthT = Array.make n 0 in\n  let depthA = Array.make n 0 in\n  visit (Array.make n false) depthT 0 (u - 1);\n  visit (Array.make n false) depthA 0 (v - 1);\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left max min_int @@\n  Array.init n @@ fun i ->\n    if depthA.(i) < depthT.(i)\n    then min_int\n    else depthA.(i) - 1\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakahashi is standing at Vertex u, and Aoki is standing at Vertex v.\n\nNow, they will play a game of tag as follows:\n\n1. If Takahashi and Aoki are standing at the same vertex, the game ends. Otherwise, Takahashi moves to a vertex of his choice that is adjacent to his current vertex.\n\n2. If Takahashi and Aoki are standing at the same vertex, the game ends. Otherwise, Aoki moves to a vertex of his choice that is adjacent to his current vertex.\n\n3. Go back to step 1.\n\nTakahashi performs his moves so that the game ends as late as possible, while Aoki performs his moves so that the game ends as early as possible.\n\nFind the number of moves Aoki will perform before the end of the game if both Takahashi and Aoki know each other's position and strategy.\n\nIt can be proved that the game is bound to end.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq u,v \\leq N\n\nu \\neq v\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 u v\nA_1 B_1\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the number of moves Aoki will perform before the end of the game.\n\nSample Input 1\n\n5 4 1\n1 2\n2 3\n3 4\n3 5\n\nSample Output 1\n\n2\n\nIf both players play optimally, the game will progress as follows:\n\nTakahashi moves to Vertex 3.\n\nAoki moves to Vertex 2.\n\nTakahashi moves to Vertex 5.\n\nAoki moves to Vertex 3.\n\nTakahashi moves to Vertex 3.\n\nHere, Aoki performs two moves.\n\nNote that, in each move, it is prohibited to stay at the current vertex.\n\nSample Input 2\n\n5 4 5\n1 2\n1 3\n1 4\n1 5\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2 1 2\n1 2\n\nSample Output 3\n\n0\n\nSample Input 4\n\n9 6 1\n1 2\n2 3\n3 4\n4 5\n5 6\n4 7\n7 8\n8 9\n\nSample Output 4\n\n5", "sample_input": "5 4 1\n1 2\n2 3\n3 4\n3 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02834", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakahashi is standing at Vertex u, and Aoki is standing at Vertex v.\n\nNow, they will play a game of tag as follows:\n\n1. If Takahashi and Aoki are standing at the same vertex, the game ends. Otherwise, Takahashi moves to a vertex of his choice that is adjacent to his current vertex.\n\n2. If Takahashi and Aoki are standing at the same vertex, the game ends. Otherwise, Aoki moves to a vertex of his choice that is adjacent to his current vertex.\n\n3. Go back to step 1.\n\nTakahashi performs his moves so that the game ends as late as possible, while Aoki performs his moves so that the game ends as early as possible.\n\nFind the number of moves Aoki will perform before the end of the game if both Takahashi and Aoki know each other's position and strategy.\n\nIt can be proved that the game is bound to end.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq u,v \\leq N\n\nu \\neq v\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 u v\nA_1 B_1\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the number of moves Aoki will perform before the end of the game.\n\nSample Input 1\n\n5 4 1\n1 2\n2 3\n3 4\n3 5\n\nSample Output 1\n\n2\n\nIf both players play optimally, the game will progress as follows:\n\nTakahashi moves to Vertex 3.\n\nAoki moves to Vertex 2.\n\nTakahashi moves to Vertex 5.\n\nAoki moves to Vertex 3.\n\nTakahashi moves to Vertex 3.\n\nHere, Aoki performs two moves.\n\nNote that, in each move, it is prohibited to stay at the current vertex.\n\nSample Input 2\n\n5 4 5\n1 2\n1 3\n1 4\n1 5\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2 1 2\n1 2\n\nSample Output 3\n\n0\n\nSample Input 4\n\n9 6 1\n1 2\n2 3\n3 4\n4 5\n5 6\n4 7\n7 8\n8 9\n\nSample Output 4\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 734, "cpu_time_ms": 110, "memory_kb": 22656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s427054954", "group_id": "codeNet:p02835", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b c -> Printf.printf \"%s\\n\" @@\n  if a + b + c >= 22\n  then \"bust\"\n  else \"win\"", "language": "OCaml", "metadata": {"date": 1593308392, "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/s427054954.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s427054954", "user_id": "u052332717"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b c -> Printf.printf \"%s\\n\" @@\n  if a + b + c >= 22\n  then \"bust\"\n  else \"win\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 3744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s697107257", "group_id": "codeNet:p02835", "input_text": "Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c ->\n    let r = a + b + c in\n    Printf.printf \"%s\\n\" (if r >= 22 then \"bust\" else \"win\"))", "language": "OCaml", "metadata": {"date": 1575856877, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s697107257.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s697107257", "user_id": "u342443598"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c ->\n    let r = a + b + c in\n    Printf.printf \"%s\\n\" (if r >= 22 then \"bust\" else \"win\"))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s414294737", "group_id": "codeNet:p02836", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc147/tasks/abc147_b\n * string manipulation\n * *)\nopen Scanf\n\nlet main =\n    let s = read_line() in\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left (+) 0 @@\n    Array.init (String.length s/2) @@ fun i ->\n        if s.[i] = s.[String.length s - i - 1] then 0 else 1\n\n", "language": "OCaml", "metadata": {"date": 1593449312, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02836.html", "problem_id": "p02836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02836/input.txt", "sample_output_relpath": "derived/input_output/data/p02836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02836/OCaml/s414294737.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414294737", "user_id": "u737840172"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc147/tasks/abc147_b\n * string manipulation\n * *)\nopen Scanf\n\nlet main =\n    let s = read_line() in\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left (+) 0 @@\n    Array.init (String.length s/2) @@ fun i ->\n        if s.[i] = s.[String.length s - i - 1] then 0 else 1\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.\n\nGiven is a string S. Find the minimum number of hugs needed to make S palindromic.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of hugs needed to make S palindromic.\n\nSample Input 1\n\nredcoder\n\nSample Output 1\n\n1\n\nFor example, we can change the fourth character to o and get a palindrome redooder.\n\nSample Input 2\n\nvvvvvv\n\nSample Output 2\n\n0\n\nWe might need no hugs at all.\n\nSample Input 3\n\nabcdabc\n\nSample Output 3\n\n2", "sample_input": "redcoder\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02836", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.\n\nGiven is a string S. Find the minimum number of hugs needed to make S palindromic.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of hugs needed to make S palindromic.\n\nSample Input 1\n\nredcoder\n\nSample Output 1\n\n1\n\nFor example, we can change the fourth character to o and get a palindrome redooder.\n\nSample Input 2\n\nvvvvvv\n\nSample Output 2\n\n0\n\nWe might need no hugs at all.\n\nSample Input 3\n\nabcdabc\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s212022932", "group_id": "codeNet:p02837", "input_text": "let rec pow x n = if n = 1 then x else x * pow x (n - 1)\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = Array.init n @@ fun _ ->\n  let l = Scanf.sscanf (read_line ()) \"%d\" @@ fun l -> l in\n  Array.init l @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun x y -> (x - 1, y)\n\nlet x = pow 2 n\n\nlet rec to_list x = function\n  | 0 -> []\n  | n -> x mod 2 :: to_list (x / 2) (n - 1)\n\nlet f arr = \n  let res = Array.mapi(fun i t ->\n    Array.fold_left (fun z (x, y) -> \n      z && (t = 0 || arr.(x) = y)\n    ) true a.(i)\n  ) arr in\n  Array.fold_left (&&) true res\n\nlet rec loop m i = \n  if i = x then m \n  else begin\n    let arr = Array.of_list @@ to_list i n in\n    loop (if f arr then max m (Array.fold_left (+) 0 arr) else m) (i + 1)\n  end\n\nlet () = Printf.printf \"%d\\n\" @@ loop 0 0", "language": "OCaml", "metadata": {"date": 1590455375, "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/s212022932.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212022932", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec pow x n = if n = 1 then x else x * pow x (n - 1)\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = Array.init n @@ fun _ ->\n  let l = Scanf.sscanf (read_line ()) \"%d\" @@ fun l -> l in\n  Array.init l @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun x y -> (x - 1, y)\n\nlet x = pow 2 n\n\nlet rec to_list x = function\n  | 0 -> []\n  | n -> x mod 2 :: to_list (x / 2) (n - 1)\n\nlet f arr = \n  let res = Array.mapi(fun i t ->\n    Array.fold_left (fun z (x, y) -> \n      z && (t = 0 || arr.(x) = y)\n    ) true a.(i)\n  ) arr in\n  Array.fold_left (&&) true res\n\nlet rec loop m i = \n  if i = x then m \n  else begin\n    let arr = Array.of_list @@ to_list i n in\n    loop (if f arr then max m (Array.fold_left (+) 0 arr) else m) (i + 1)\n  end\n\nlet () = Printf.printf \"%d\\n\" @@ loop 0 0", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 798, "cpu_time_ms": 52, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s507140370", "group_id": "codeNet:p02838", "input_text": "let m = 1_000_000_007\nlet n = read_int()\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun i -> i))\n\nlet () =\n  let ans = ref 0 in\n  for i = 0 to 59 do\n    let b = 1 lsl i in\n    let z = Array.fold_left (fun z a -> if a land b = 0 then z + 1 else z) 0 a in\n    ans := (!ans + b mod m * z mod m * (n - z) mod m) mod m\n  done;\n  Printf.printf \"%d\\n\" !ans\n", "language": "OCaml", "metadata": {"date": 1600802546, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/OCaml/s507140370.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s507140370", "user_id": "u752907799"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let m = 1_000_000_007\nlet n = read_int()\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun i -> i))\n\nlet () =\n  let ans = ref 0 in\n  for i = 0 to 59 do\n    let b = 1 lsl i in\n    let z = Array.fold_left (fun z a -> if a land b = 0 then z + 1 else z) 0 a in\n    ans := (!ans + b mod m * z mod m * (n - z) mod m) mod m\n  done;\n  Printf.printf \"%d\\n\" !ans\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 207, "memory_kb": 8284}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s195884214", "group_id": "codeNet:p02838", "input_text": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun d -> d) in\n  let an = Array.init n @@\n    fun x -> Scanf.scanf (if x==n-1 then \"%d\\n\" else \"%d \") @@ fun c -> c\n  in\n  let m = int_of_float(10.0 ** 9.) + 7 in\n  let sum = ref 0 in\n  for i = 0 to n-1 do\n    for j = i to n-1 do\n      sum := (!sum + (an.(i) lxor an.(j))) mod m\n    done\n  done;\n  Printf.printf \"%d\\n\" !sum", "language": "OCaml", "metadata": {"date": 1575867843, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/OCaml/s195884214.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s195884214", "user_id": "u269739894"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun d -> d) in\n  let an = Array.init n @@\n    fun x -> Scanf.scanf (if x==n-1 then \"%d\\n\" else \"%d \") @@ fun c -> c\n  in\n  let m = int_of_float(10.0 ** 9.) + 7 in\n  let sum = ref 0 in\n  for i = 0 to n-1 do\n    for j = i to n-1 do\n      sum := (!sum + (an.(i) lxor an.(j))) mod m\n    done\n  done;\n  Printf.printf \"%d\\n\" !sum", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 362, "cpu_time_ms": 2103, "memory_kb": 6144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s621219382", "group_id": "codeNet:p02838", "input_text": "let () =\n    let main () =\n        let n = Scanf.scanf \"%d\" (fun n -> n) in\n        let m = 1000000000 + 7 in\n        let ( +@) a b = (a + b) mod m in\n        let ( *@) a b = ((a mod m) * (b mod m)) mod m in\n        let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n        let rec loop i acc =\n            if i = 60 then acc else\n                let d0, d1 = Array.fold_left (fun (acc1, acc2) v ->\n                    if v land (1 lsl i) = 0 then acc1 + 1, acc2 else acc1, acc2 + 1) (0, 0) a\n                in\n                loop (i + 1) (acc +@ d0 *@ d1 *@ (1 lsl i))\n        in\n        Printf.printf \"%d\\n\" (loop 0 0)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1575864865, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/OCaml/s621219382.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621219382", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () =\n    let main () =\n        let n = Scanf.scanf \"%d\" (fun n -> n) in\n        let m = 1000000000 + 7 in\n        let ( +@) a b = (a + b) mod m in\n        let ( *@) a b = ((a mod m) * (b mod m)) mod m in\n        let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n        let rec loop i acc =\n            if i = 60 then acc else\n                let d0, d1 = Array.fold_left (fun (acc1, acc2) v ->\n                    if v land (1 lsl i) = 0 then acc1 + 1, acc2 else acc1, acc2 + 1) (0, 0) a\n                in\n                loop (i + 1) (acc +@ d0 *@ d1 *@ (1 lsl i))\n        in\n        Printf.printf \"%d\\n\" (loop 0 0)\n    in\n    main ()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 657, "cpu_time_ms": 293, "memory_kb": 6144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s189818810", "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) * 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": 1575869657, "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/s189818810.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s189818810", "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) * 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1220, "cpu_time_ms": 1729, "memory_kb": 665580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s305838565", "group_id": "codeNet:p02841", "input_text": "Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> print_endline @@ if a < c then \"1\" else \"0\"", "language": "OCaml", "metadata": {"date": 1575320495, "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/s305838565.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305838565", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> print_endline @@ if a < c then \"1\" else \"0\"", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.\n\nIntegers M_1, D_1, M_2, and D_2 will be given as input.\n\nIt is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nDetermine whether the date 2019-M_1-D_1 is the last day of a month.\n\nConstraints\n\nBoth 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.\n\nThe date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM_1 D_1\nM_2 D_2\n\nOutput\n\nIf the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.\n\nSample Input 1\n\n11 16\n11 17\n\nSample Output 1\n\n0\n\nNovember 16 is not the last day of a month.\n\nSample Input 2\n\n11 30\n12 1\n\nSample Output 2\n\n1\n\nNovember 30 is the last day of November.", "sample_input": "11 16\n11 17\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02841", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.\n\nIntegers M_1, D_1, M_2, and D_2 will be given as input.\n\nIt is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nDetermine whether the date 2019-M_1-D_1 is the last day of a month.\n\nConstraints\n\nBoth 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.\n\nThe date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM_1 D_1\nM_2 D_2\n\nOutput\n\nIf the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.\n\nSample Input 1\n\n11 16\n11 17\n\nSample Output 1\n\n0\n\nNovember 16 is not the last day of a month.\n\nSample Input 2\n\n11 30\n12 1\n\nSample Output 2\n\n1\n\nNovember 30 is the last day of November.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s290848349", "group_id": "codeNet:p02843", "input_text": "let () =\n    let arr = Array.make 100001 false in\n    arr.(0) <- true;\n    for i = 0 to 100000 do\n        if arr.(i) then (\n            for j = 100 to 105 do\n                if i + j <= 100000 then arr.(i + j) <- true\n            done\n        )\n    done;\n    let main () =\n        let n = int_of_string (read_line ()) in\n        Printf.printf \"%d\\n\" (if arr.(n)then 1 else 0)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1575252729, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02843.html", "problem_id": "p02843", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02843/input.txt", "sample_output_relpath": "derived/input_output/data/p02843/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02843/OCaml/s290848349.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s290848349", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n    let arr = Array.make 100001 false in\n    arr.(0) <- true;\n    for i = 0 to 100000 do\n        if arr.(i) then (\n            for j = 100 to 105 do\n                if i + j <= 100000 then arr.(i + j) <- true\n            done\n        )\n    done;\n    let main () =\n        let n = int_of_string (read_line ()) in\n        Printf.printf \"%d\\n\" (if arr.(n)then 1 else 0)\n    in\n    main ()", "problem_context": "Score: 300 points\n\nProblem Statement\n\nAtCoder Mart sells 1000000 of each of the six items below:\n\nRiceballs, priced at 100 yen (the currency of Japan) each\n\nSandwiches, priced at 101 yen each\n\nCookies, priced at 102 yen each\n\nCakes, priced at 103 yen each\n\nCandies, priced at 104 yen each\n\nComputers, priced at 105 yen each\n\nTakahashi wants to buy some of them that cost exactly X yen in total.\nDetermine whether this is possible.\n\n(Ignore consumption tax.)\n\nConstraints\n\n1 \\leq X \\leq 100000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf it is possible to buy some set of items that cost exactly X yen in total, print 1; otherwise, print 0.\n\nSample Input 1\n\n615\n\nSample Output 1\n\n1\n\nFor example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615 yen in total.\n\nSample Input 2\n\n217\n\nSample Output 2\n\n0\n\nNo set of items costs 217 yen in total.", "sample_input": "615\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02843", "source_text": "Score: 300 points\n\nProblem Statement\n\nAtCoder Mart sells 1000000 of each of the six items below:\n\nRiceballs, priced at 100 yen (the currency of Japan) each\n\nSandwiches, priced at 101 yen each\n\nCookies, priced at 102 yen each\n\nCakes, priced at 103 yen each\n\nCandies, priced at 104 yen each\n\nComputers, priced at 105 yen each\n\nTakahashi wants to buy some of them that cost exactly X yen in total.\nDetermine whether this is possible.\n\n(Ignore consumption tax.)\n\nConstraints\n\n1 \\leq X \\leq 100000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf it is possible to buy some set of items that cost exactly X yen in total, print 1; otherwise, print 0.\n\nSample Input 1\n\n615\n\nSample Output 1\n\n1\n\nFor example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615 yen in total.\n\nSample Input 2\n\n217\n\nSample Output 2\n\n0\n\nNo set of items costs 217 yen in total.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s663899959", "group_id": "codeNet:p02844", "input_text": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.eprintf \"[debug]%s\\n\" @@ dump x; x\n\nlet n = scan \"%d\" identity\nlet s = scan \"%s\" identity\n\nlet () =\n  Enum.Labels.map (0 --^ 1000)\n    ~f:(fun i ->\n        let d = String.to_list @@ Printf.sprintf \"%03d\" i in\n        let last = List.Labels.fold_left d\n            ~init:0 ~f:(fun i c ->\n                if i < n then\n                  match String.Exceptionless.find_from s i @@ String.of_char c with\n                  | Some i -> succ i\n                  | None -> n+1\n                else n+1)\n        in\n        if last < n+1 then 1 else 0)\n  |> Enum.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1586876284, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02844.html", "problem_id": "p02844", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02844/input.txt", "sample_output_relpath": "derived/input_output/data/p02844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02844/OCaml/s663899959.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663899959", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.eprintf \"[debug]%s\\n\" @@ dump x; x\n\nlet n = scan \"%d\" identity\nlet s = scan \"%s\" identity\n\nlet () =\n  Enum.Labels.map (0 --^ 1000)\n    ~f:(fun i ->\n        let d = String.to_list @@ Printf.sprintf \"%03d\" i in\n        let last = List.Labels.fold_left d\n            ~init:0 ~f:(fun i c ->\n                if i < n then\n                  match String.Exceptionless.find_from s i @@ String.of_char c with\n                  | Some i -> succ i\n                  | None -> n+1\n                else n+1)\n        in\n        if last < n+1 then 1 else 0)\n  |> Enum.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "sample_input": "4\n0224\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02844", "source_text": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1039, "cpu_time_ms": 44, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s539682808", "group_id": "codeNet:p02845", "input_text": "let rec fix f x = f (fix f) x\nlet ( *@) a b = a * b mod 1000000007\nlet _ =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let hats = [|0; 0; 0|] in\n  (1, 0) |> fix (fun f (d, i) ->\n    if i >= n then d else begin\n      let c = Array.fold_left (fun c h -> if a.(i) = h then c+1 else c) 0 hats in\n      0 |> fix (fun f j ->\n        if j >= 3 then ()\n        else if hats.(j) = a.(i) then hats.(j) <- hats.(j) + 1\n        else f (j+1));\n      f (c *@ d, i+1)\n    end)\n  |> Printf.printf \"%d\\n\"\n\n\n", "language": "OCaml", "metadata": {"date": 1575256455, "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/s539682808.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539682808", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let rec fix f x = f (fix f) x\nlet ( *@) a b = a * b mod 1000000007\nlet _ =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let hats = [|0; 0; 0|] in\n  (1, 0) |> fix (fun f (d, i) ->\n    if i >= n then d else begin\n      let c = Array.fold_left (fun c h -> if a.(i) = h then c+1 else c) 0 hats in\n      0 |> fix (fun f j ->\n        if j >= 3 then ()\n        else if hats.(j) = a.(i) then hats.(j) <- hats.(j) + 1\n        else f (j+1));\n      f (c *@ d, i+1)\n    end)\n  |> Printf.printf \"%d\\n\"\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 30, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s139705480", "group_id": "codeNet:p02847", "input_text": "let scan_string () = Scanf.scanf \" %s\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet calc s =\n  if s = \"SUN\" then 7\n  else if s = \"MON\" then 6\n  else if s = \"TUE\" then 5\n  else if s = \"WED\" then 4\n  else if s = \"THU\" then 3\n  else if s = \"FRI\" then 2\n  else 1\n\nlet () =\n  let s = scan_string() in\n  print_int (calc s)", "language": "OCaml", "metadata": {"date": 1574797435, "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/s139705480.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s139705480", "user_id": "u521364030"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let scan_string () = Scanf.scanf \" %s\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet calc s =\n  if s = \"SUN\" then 7\n  else if s = \"MON\" then 6\n  else if s = \"TUE\" then 5\n  else if s = \"WED\" then 4\n  else if s = \"THU\" then 3\n  else if s = \"FRI\" then 2\n  else 1\n\nlet () =\n  let s = scan_string() in\n  print_int (calc s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "sample_input": "SAT\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02847", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s742312873", "group_id": "codeNet:p02847", "input_text": "let () =\n  Printf.printf \"%d\\n\" @@\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\n\n", "language": "OCaml", "metadata": {"date": 1574653895, "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/s742312873.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742312873", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  Printf.printf \"%d\\n\" @@\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\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "sample_input": "SAT\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02847", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s219673574", "group_id": "codeNet:p02850", "input_text": "module S = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let find_root ver =\n        let rec loop prev cur =\n            let rec loop_2 = function\n                | [] -> cur\n                | (hd, _) :: tl -> if hd = prev then loop_2 tl else loop cur hd\n            in\n            loop_2 ver.(cur)\n        in\n        loop 1 (fst (List.hd ver.(1)))\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let ab = Array.init (n - 1) (fun i -> Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> a, b, i)) in\n        let ver = Array.make (n + 1) [] in\n        let used = Array.make (n + 1) S.empty in\n        let col = Array.make (n + 1) 0 in\n        Array.iter (fun (a, b, i) ->\n            ver.(a) <- (b, i) :: ver.(a);\n            ver.(b) <- (a, i) :: ver.(b)) ab;\n        let k = Array.fold_left (fun acc l -> max acc (List.length l)) 0 ver in\n        let find_color set =\n            let rec loop i set = if S.mem i set then loop (i + 1) set else i in\n            loop 1 set\n        in\n        let rec loop cur =\n            let rec loop2 = function\n                | [] -> ()\n                | (hd, edge) :: tl -> (\n                    if col.(edge) = 0 then (\n                        let c = find_color used.(cur) in\n                        col.(edge) <- c;\n                        used.(cur) <- S.add c used.(cur);\n                        used.(hd) <- S.add c used.(hd);\n                        loop hd\n                    );\n                    loop2 tl\n                )\n            in\n            loop2 ver.(cur)\n        in\n        let root = find_root ver in\n        loop root;\n        Printf.printf \"%d\\n\" k;\n        for i = 0 to n - 2 do\n            Printf.printf \"%d\\n\" col.(i)\n        done\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1574650178, "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/s219673574.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s219673574", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n1\n2\n", "input_to_evaluate": "module S = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let find_root ver =\n        let rec loop prev cur =\n            let rec loop_2 = function\n                | [] -> cur\n                | (hd, _) :: tl -> if hd = prev then loop_2 tl else loop cur hd\n            in\n            loop_2 ver.(cur)\n        in\n        loop 1 (fst (List.hd ver.(1)))\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let ab = Array.init (n - 1) (fun i -> Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> a, b, i)) in\n        let ver = Array.make (n + 1) [] in\n        let used = Array.make (n + 1) S.empty in\n        let col = Array.make (n + 1) 0 in\n        Array.iter (fun (a, b, i) ->\n            ver.(a) <- (b, i) :: ver.(a);\n            ver.(b) <- (a, i) :: ver.(b)) ab;\n        let k = Array.fold_left (fun acc l -> max acc (List.length l)) 0 ver in\n        let find_color set =\n            let rec loop i set = if S.mem i set then loop (i + 1) set else i in\n            loop 1 set\n        in\n        let rec loop cur =\n            let rec loop2 = function\n                | [] -> ()\n                | (hd, edge) :: tl -> (\n                    if col.(edge) = 0 then (\n                        let c = find_color used.(cur) in\n                        col.(edge) <- c;\n                        used.(cur) <- S.add c used.(cur);\n                        used.(hd) <- S.add c used.(hd);\n                        loop hd\n                    );\n                    loop2 tl\n                )\n            in\n            loop2 ver.(cur)\n        in\n        let root = find_root ver in\n        loop root;\n        Printf.printf \"%d\\n\" k;\n        for i = 0 to n - 2 do\n            Printf.printf \"%d\\n\" col.(i)\n        done\n    in\n    main ()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["2\n1\n2\n"], "source_document_id": "p02850", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1769, "cpu_time_ms": 2104, "memory_kb": 27136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s322965649", "group_id": "codeNet:p02855", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet (h, w, k) = Scanf.sscanf (read_line ()) \"%d %d %d\" @@ fun h w k -> (h, w, k)\nlet ss = Array.init h @@ fun _ -> read_line ()\n\nlet rows = Array.init h @@ fun i -> String.length (Str.global_replace (Str.regexp \"[^#]\") \"\" ss.(i)) > 0\nlet ans = Array.make_matrix h w 0\n\nlet () =\n  let num = ref 1 in\n  Array.iteri (fun i s -> if rows.(i) then begin\n    for j = 0 to w - 1 do\n      if s.[j] = '#' then begin\n        ans.(i).(j) <- !num;\n        num := !num + 1\n      end else if j > 0 && ans.(i).(j - 1)  > 0 then\n        ans.(i).(j) <- ans.(i).(j - 1)\n    done;\n    for j = w - 2 downto 0 do\n      if ans.(i).(j) = 0 then ans.(i).(j) <- ans.(i).(j + 1)\n    done\n  end) ss;\n  for i = 0 to w - 1 do\n    for j = 1 to h - 1 do\n      if ans.(j).(i) = 0 && ans.(j - 1).(i) > 0 then ans.(j).(i) <- ans.(j - 1).(i)\n    done;\n    for j = h - 2 downto 0 do\n      if ans.(j).(i) = 0 && ans.(j + 1).(i) > 0 then ans.(j).(i) <- ans.(j + 1).(i)\n    done\n  done;\n  Array.iter (fun arr ->\n    Array.map string_of_int arr |> Array.to_list |> String.concat \" \" |> print_endline\n  ) ans", "language": "OCaml", "metadata": {"date": 1592686462, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02855.html", "problem_id": "p02855", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02855/input.txt", "sample_output_relpath": "derived/input_output/data/p02855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02855/OCaml/s322965649.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s322965649", "user_id": "u811309788"}, "prompt_components": {"gold_output": "1 2 2\n1 3 4\n5 5 4\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet (h, w, k) = Scanf.sscanf (read_line ()) \"%d %d %d\" @@ fun h w k -> (h, w, k)\nlet ss = Array.init h @@ fun _ -> read_line ()\n\nlet rows = Array.init h @@ fun i -> String.length (Str.global_replace (Str.regexp \"[^#]\") \"\" ss.(i)) > 0\nlet ans = Array.make_matrix h w 0\n\nlet () =\n  let num = ref 1 in\n  Array.iteri (fun i s -> if rows.(i) then begin\n    for j = 0 to w - 1 do\n      if s.[j] = '#' then begin\n        ans.(i).(j) <- !num;\n        num := !num + 1\n      end else if j > 0 && ans.(i).(j - 1)  > 0 then\n        ans.(i).(j) <- ans.(i).(j - 1)\n    done;\n    for j = w - 2 downto 0 do\n      if ans.(i).(j) = 0 then ans.(i).(j) <- ans.(i).(j + 1)\n    done\n  end) ss;\n  for i = 0 to w - 1 do\n    for j = 1 to h - 1 do\n      if ans.(j).(i) = 0 && ans.(j - 1).(i) > 0 then ans.(j).(i) <- ans.(j - 1).(i)\n    done;\n    for j = h - 2 downto 0 do\n      if ans.(j).(i) = 0 && ans.(j + 1).(i) > 0 then ans.(j).(i) <- ans.(j + 1).(i)\n    done\n  done;\n  Array.iter (fun arr ->\n    Array.map string_of_int arr |> Array.to_list |> String.concat \" \" |> print_endline\n  ) ans", "problem_context": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "sample_input": "3 3 5\n#.#\n.#.\n#.#\n"}, "reference_outputs": ["1 2 2\n1 3 4\n5 5 4\n"], "source_document_id": "p02855", "source_text": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1131, "cpu_time_ms": 40, "memory_kb": 7440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517999367", "group_id": "codeNet:p02859", "input_text": "let () = Scanf.scanf \"%d\" @@ fun r -> Printf.printf \"%d\\n\" @@ r * r", "language": "OCaml", "metadata": {"date": 1593564280, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s517999367.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517999367", "user_id": "u052332717"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun r -> Printf.printf \"%d\\n\" @@ 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s390801852", "group_id": "codeNet:p02860", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet _ = print_endline @@ if String.(sub s 0 @@ n / 2 = sub s (n / 2) @@ (n + 1) / 2) then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1573980201, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/OCaml/s390801852.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s390801852", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet _ = print_endline @@ if String.(sub s 0 @@ n / 2 = sub s (n / 2) @@ (n + 1) / 2) then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS consists of lowercase English letters.\n\n|S| = N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS consists of lowercase English letters.\n\n|S| = N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s204343634", "group_id": "codeNet:p02861", "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\nlet n = scan \"%d\" id\nlet ls = Array.of_list @@ scan_lines n \"%f %f\" Tuple2.make\n\nlet () =\n  let sets = permutations (0++^n) in\n  ListL.map sets ~f:(fun set ->\n      ListL.map (List.combine (List.take (pred @@ List.length set) set) (List.drop 1 set))\n        ~f:(fun (i, j) ->\n            let (x0,y0)= ls.(i) in\n            let (x1,y1)= ls.(j) in\n            Float.sqrt (Float.pow (x0-.x1) 2.0  +. Float.pow (y0 -. y1) 2.0)\n          ) |> List.fsum\n    ) |> List.fsum\n  |> (fun v -> v /. (Float.of_int @@ List.length sets))\n  |> Printf.printf \"%f\\n\"\n", "language": "OCaml", "metadata": {"date": 1591419433, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02861/input.txt", "sample_output_relpath": "derived/input_output/data/p02861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02861/OCaml/s204343634.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s204343634", "user_id": "u802614675"}, "prompt_components": {"gold_output": "2.2761423749\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\nlet n = scan \"%d\" id\nlet ls = Array.of_list @@ scan_lines n \"%f %f\" Tuple2.make\n\nlet () =\n  let sets = permutations (0++^n) in\n  ListL.map sets ~f:(fun set ->\n      ListL.map (List.combine (List.take (pred @@ List.length set) set) (List.drop 1 set))\n        ~f:(fun (i, j) ->\n            let (x0,y0)= ls.(i) in\n            let (x1,y1)= ls.(j) in\n            Float.sqrt (Float.pow (x0-.x1) 2.0  +. Float.pow (y0 -. y1) 2.0)\n          ) |> List.fsum\n    ) |> List.fsum\n  |> (fun v -> v /. (Float.of_int @@ List.length sets))\n  |> Printf.printf \"%f\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "sample_input": "3\n0 0\n1 0\n0 1\n"}, "reference_outputs": ["2.2761423749\n"], "source_document_id": "p02861", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2353, "cpu_time_ms": 40, "memory_kb": 12032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s007110914", "group_id": "codeNet:p02861", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %f %f\" (fun x y -> x, y)) in\n\n    let dist a b =\n        let x1, y1 = xy.(a) in\n        let x2, y2 = xy.(b) in\n        sqrt ((x1 -. x2) *. (x1 -. x2) +. (y1 -. y2) *. (y1 -. y2))\n    in\n\n    let rec loop1 i1 acc =\n        let rec loop2 i2 acc =\n            if i2 = n then acc else\n                loop2 (i2 + 1) (acc +. dist i1 i2)\n        in\n        if i1 = n then acc else\n            loop1 (i1 + 1) (loop2 (i1 + 1) acc)\n    in\n    let s = loop1 0 0. *. 2. /. float n in\n    Printf.printf \"%.8f\\n\" s\n)", "language": "OCaml", "metadata": {"date": 1586228564, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02861/input.txt", "sample_output_relpath": "derived/input_output/data/p02861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02861/OCaml/s007110914.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007110914", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %f %f\" (fun x y -> x, y)) in\n\n    let dist a b =\n        let x1, y1 = xy.(a) in\n        let x2, y2 = xy.(b) in\n        sqrt ((x1 -. x2) *. (x1 -. x2) +. (y1 -. y2) *. (y1 -. y2))\n    in\n\n    let rec loop1 i1 acc =\n        let rec loop2 i2 acc =\n            if i2 = n then acc else\n                loop2 (i2 + 1) (acc +. dist i1 i2)\n        in\n        if i1 = n then acc else\n            loop1 (i1 + 1) (loop2 (i1 + 1) acc)\n    in\n    let s = loop1 0 0. *. 2. /. float n in\n    Printf.printf \"%.8f\\n\" s\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "sample_input": "3\n0 0\n1 0\n0 1\n"}, "reference_outputs": ["2.2761423749\n"], "source_document_id": "p02861", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 580, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s154527682", "group_id": "codeNet:p02861", "input_text": "let () =\n    let calc (x1, y1) (x2, y2) =\n        sqrt (float ((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)))\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let xy = Array.init n (fun _ ->\n            Scanf.sscanf (read_line ()) \"%d %d\" (fun x y -> x, y))\n        in\n        let rec loop_i i acc =\n            let rec loop_j j acc =\n                if j >= n then acc else\n                    let acc = calc xy.(i) xy.(j) +. acc in\n                    loop_j (j + 1) acc\n            in\n            if i = n then acc else\n                let acc = loop_j (i + 1) acc in\n                loop_i (i + 1) acc\n        in\n        let r = loop_i 0 0. in\n        let r = r *. 2. /. float n in\n        Printf.printf \"%.7f\\n\" r\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1573959196, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02861/input.txt", "sample_output_relpath": "derived/input_output/data/p02861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02861/OCaml/s154527682.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154527682", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "let () =\n    let calc (x1, y1) (x2, y2) =\n        sqrt (float ((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)))\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let xy = Array.init n (fun _ ->\n            Scanf.sscanf (read_line ()) \"%d %d\" (fun x y -> x, y))\n        in\n        let rec loop_i i acc =\n            let rec loop_j j acc =\n                if j >= n then acc else\n                    let acc = calc xy.(i) xy.(j) +. acc in\n                    loop_j (j + 1) acc\n            in\n            if i = n then acc else\n                let acc = loop_j (i + 1) acc in\n                loop_i (i + 1) acc\n        in\n        let r = loop_i 0 0. in\n        let r = r *. 2. /. float n in\n        Printf.printf \"%.7f\\n\" r\n    in\n    main ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "sample_input": "3\n0 0\n1 0\n0 1\n"}, "reference_outputs": ["2.2761423749\n"], "source_document_id": "p02861", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 770, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s494364902", "group_id": "codeNet:p02862", "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\nmodule Comb = struct\n  let prime = 1_000_000_007\n\n  let ( * ) a b = a * b mod prime\n\n  let rec pow n m =\n    if m = 0 then 1\n    else if m mod 2 = 0 then pow (n*n) (m/2)\n    else n * pow (n*n) (m/2)\n\n  let fact n =\n    let rec aux m acc =\n      if m = 0 then acc\n      else aux (pred m) @@ m * acc\n    in aux n 1\n\n  let comb n k =\n    if n <= 0 || k <= 0 then 1\n    else\n      fact n * (pow (fact k) (prime-2)) * (pow (fact (n - k)) (prime-2))\nend\n\nlet (x,y) = scan \"%d %d\" Tuple2.make\n\nexception Found\n\nlet () =\n  try\n    ListL.iter (0 ++ x) ~f:(fun k ->\n        if (x-k) mod 2 = 0 &&  (x - k) / 2 = (y - 2*k) then\n          Printf.printf \"%d\\n\" @@ Comb.comb (k+ (x-k)/2) k)\n  with Found -> ()\n", "language": "OCaml", "metadata": {"date": 1589851936, "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/s494364902.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s494364902", "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\nmodule Comb = struct\n  let prime = 1_000_000_007\n\n  let ( * ) a b = a * b mod prime\n\n  let rec pow n m =\n    if m = 0 then 1\n    else if m mod 2 = 0 then pow (n*n) (m/2)\n    else n * pow (n*n) (m/2)\n\n  let fact n =\n    let rec aux m acc =\n      if m = 0 then acc\n      else aux (pred m) @@ m * acc\n    in aux n 1\n\n  let comb n k =\n    if n <= 0 || k <= 0 then 1\n    else\n      fact n * (pow (fact k) (prime-2)) * (pow (fact (n - k)) (prime-2))\nend\n\nlet (x,y) = scan \"%d %d\" Tuple2.make\n\nexception Found\n\nlet () =\n  try\n    ListL.iter (0 ++ x) ~f:(fun k ->\n        if (x-k) mod 2 = 0 &&  (x - k) / 2 = (y - 2*k) then\n          Printf.printf \"%d\\n\" @@ Comb.comb (k+ (x-k)/2) k)\n  with Found -> ()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "sample_input": "3 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02862", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2696, "cpu_time_ms": 71, "memory_kb": 26624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s807680134", "group_id": "codeNet:p02863", "input_text": "Scanf.scanf \"%d %d\" (fun n t ->\n    let ab = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun a b -> a, b)) in\n    Array.sort compare ab;\n    let dp = Array.make (t + 1) 0 in\n    Array.iter (fun (a, b) ->\n        for j = t - 1 downto 0 do\n            let idx = min t (j + a) in\n            dp.(idx) <- max dp.(idx) (dp.(j) + b)\n        done\n    ) ab;\n    Array.fold_left max 0 dp |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1588147500, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02863.html", "problem_id": "p02863", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02863/input.txt", "sample_output_relpath": "derived/input_output/data/p02863/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02863/OCaml/s807680134.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s807680134", "user_id": "u342443598"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n t ->\n    let ab = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun a b -> a, b)) in\n    Array.sort compare ab;\n    let dp = Array.make (t + 1) 0 in\n    Array.iter (fun (a, b) ->\n        for j = t - 1 downto 0 do\n            let idx = min t (j + a) in\n            dp.(idx) <- max dp.(idx) (dp.(j) + b)\n        done\n    ) ab;\n    Array.fold_left max 0 dp |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi is at an all-you-can-eat restaurant.\n\nThe restaurant offers N kinds of dishes. It takes A_i minutes to eat the i-th dish, whose deliciousness is B_i.\n\nThe restaurant has the following rules:\n\nYou can only order one dish at a time. The dish ordered will be immediately served and ready to eat.\n\nYou cannot order the same kind of dish more than once.\n\nUntil you finish eating the dish already served, you cannot order a new dish.\n\nAfter T-0.5 minutes from the first order, you can no longer place a new order, but you can continue eating the dish already served.\n\nLet Takahashi's happiness be the sum of the deliciousness of the dishes he eats in this restaurant.\n\nWhat is the maximum possible happiness achieved by making optimal choices?\n\nConstraints\n\n2 \\leq N \\leq 3000\n\n1 \\leq T \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\n1 \\leq B_i \\leq 3000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the maximum possible happiness Takahashi can achieve.\n\nSample Input 1\n\n2 60\n10 10\n100 100\n\nSample Output 1\n\n110\n\nBy ordering the first and second dishes in this order, Takahashi's happiness will be 110.\n\nNote that, if we manage to order a dish in time, we can spend any amount of time to eat it.\n\nSample Input 2\n\n3 60\n10 10\n10 20\n10 30\n\nSample Output 2\n\n60\n\nTakahashi can eat all the dishes within 60 minutes.\n\nSample Input 3\n\n3 60\n30 10\n30 20\n30 30\n\nSample Output 3\n\n50\n\nBy ordering the second and third dishes in this order, Takahashi's happiness will be 50.\n\nWe cannot order three dishes, in whatever order we place them.\n\nSample Input 4\n\n10 100\n15 23\n20 18\n13 17\n24 12\n18 29\n19 27\n23 21\n18 20\n27 15\n22 25\n\nSample Output 4\n\n145", "sample_input": "2 60\n10 10\n100 100\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02863", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi is at an all-you-can-eat restaurant.\n\nThe restaurant offers N kinds of dishes. It takes A_i minutes to eat the i-th dish, whose deliciousness is B_i.\n\nThe restaurant has the following rules:\n\nYou can only order one dish at a time. The dish ordered will be immediately served and ready to eat.\n\nYou cannot order the same kind of dish more than once.\n\nUntil you finish eating the dish already served, you cannot order a new dish.\n\nAfter T-0.5 minutes from the first order, you can no longer place a new order, but you can continue eating the dish already served.\n\nLet Takahashi's happiness be the sum of the deliciousness of the dishes he eats in this restaurant.\n\nWhat is the maximum possible happiness achieved by making optimal choices?\n\nConstraints\n\n2 \\leq N \\leq 3000\n\n1 \\leq T \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\n1 \\leq B_i \\leq 3000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the maximum possible happiness Takahashi can achieve.\n\nSample Input 1\n\n2 60\n10 10\n100 100\n\nSample Output 1\n\n110\n\nBy ordering the first and second dishes in this order, Takahashi's happiness will be 110.\n\nNote that, if we manage to order a dish in time, we can spend any amount of time to eat it.\n\nSample Input 2\n\n3 60\n10 10\n10 20\n10 30\n\nSample Output 2\n\n60\n\nTakahashi can eat all the dishes within 60 minutes.\n\nSample Input 3\n\n3 60\n30 10\n30 20\n30 30\n\nSample Output 3\n\n50\n\nBy ordering the second and third dishes in this order, Takahashi's happiness will be 50.\n\nWe cannot order three dishes, in whatever order we place them.\n\nSample Input 4\n\n10 100\n15 23\n20 18\n13 17\n24 12\n18 29\n19 27\n23 21\n18 20\n27 15\n22 25\n\nSample Output 4\n\n145", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 206, "memory_kb": 1920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s970180818", "group_id": "codeNet:p02869", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet upper_bound x s =\n  match IntSet.split x s with\n  | (_, true, _) -> x\n  | (s, false, _) -> IntSet.max_elt s\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n k ->\n  try\n    let (_, abcs) =\n      Array.fold_right (fun c (s, abcs) ->\n        let a = IntSet.max_elt s in\n        let s = IntSet.remove a s in\n        (*\n         * a + b <= c\n         * b <= c - a\n         *)\n        let b = upper_bound (c - a) s in\n        let s = IntSet.remove b s in\n        (s, (a, b, c) :: abcs)) (Array.init n (( + ) (k + 2 * n))) @@\n        ( IntSet.of_list @@\n          Array.to_list @@\n          Array.init (2 * n) (( + ) k), [] ) in\n    List.iter (fun (a, b, c) -> Printf.printf \"%d %d %d\\n\" a b c) abcs\n  with Not_found -> print_endline \"-1\"\n", "language": "OCaml", "metadata": {"date": 1573358337, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02869.html", "problem_id": "p02869", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02869/input.txt", "sample_output_relpath": "derived/input_output/data/p02869/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02869/OCaml/s970180818.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s970180818", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 2 3\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet upper_bound x s =\n  match IntSet.split x s with\n  | (_, true, _) -> x\n  | (s, false, _) -> IntSet.max_elt s\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n k ->\n  try\n    let (_, abcs) =\n      Array.fold_right (fun c (s, abcs) ->\n        let a = IntSet.max_elt s in\n        let s = IntSet.remove a s in\n        (*\n         * a + b <= c\n         * b <= c - a\n         *)\n        let b = upper_bound (c - a) s in\n        let s = IntSet.remove b s in\n        (s, (a, b, c) :: abcs)) (Array.init n (( + ) (k + 2 * n))) @@\n        ( IntSet.of_list @@\n          Array.to_list @@\n          Array.init (2 * n) (( + ) k), [] ) in\n    List.iter (fun (a, b, c) -> Printf.printf \"%d %d %d\\n\" a b c) abcs\n  with Not_found -> print_endline \"-1\"\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nGiven are positive integers N and K.\n\nDetermine if the 3N integers K, K+1, ..., K+3N-1 can be partitioned into N triples (a_1,b_1,c_1), ..., (a_N,b_N,c_N) so that the condition below is satisfied. Any of the integers K, K+1, ..., K+3N-1 must appear in exactly one of those triples.\n\nFor every integer i from 1 to N, a_i + b_i \\leq c_i holds.\n\nIf the answer is yes, construct one such partition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf it is impossible to partition the integers satisfying the condition, print -1. If it is possible, print N triples in the following format:\n\na_1 b_1 c_1\n:\na_N b_N c_N\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1 2 3\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1", "sample_input": "1 1\n"}, "reference_outputs": ["1 2 3\n"], "source_document_id": "p02869", "source_text": "Score : 700 points\n\nProblem Statement\n\nGiven are positive integers N and K.\n\nDetermine if the 3N integers K, K+1, ..., K+3N-1 can be partitioned into N triples (a_1,b_1,c_1), ..., (a_N,b_N,c_N) so that the condition below is satisfied. Any of the integers K, K+1, ..., K+3N-1 must appear in exactly one of those triples.\n\nFor every integer i from 1 to N, a_i + b_i \\leq c_i holds.\n\nIf the answer is yes, construct one such partition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf it is impossible to partition the integers satisfying the condition, print -1. If it is possible, print N triples in the following format:\n\na_1 b_1 c_1\n:\na_N b_N c_N\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1 2 3\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 804, "cpu_time_ms": 231, "memory_kb": 18848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s391677864", "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) (r.(p) - l.(p)) in\n        let t = Array.make (n + 1) (r.(q) - l.(q)) in\n        for i = 1     to     n do t.(i) <- min t.(i - 1) (snd work.(i - 1)); done;\n        for i = n - 1 downto 0 do s.(i) <- min s.(i + 1) (fst work.(i    )); 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": 1599409494, "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/s391677864.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391677864", "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) (r.(p) - l.(p)) in\n        let t = Array.make (n + 1) (r.(q) - l.(q)) in\n        for i = 1     to     n do t.(i) <- min t.(i - 1) (snd work.(i - 1)); done;\n        for i = n - 1 downto 0 do s.(i) <- min s.(i + 1) (fst work.(i    )); 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1303, "cpu_time_ms": 133, "memory_kb": 12936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s072052566", "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\" result2\n)", "language": "OCaml", "metadata": {"date": 1599409295, "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/s072052566.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s072052566", "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\" result2\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1441, "cpu_time_ms": 134, "memory_kb": 12848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s557041333", "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 0\n    )\n    in\n    Printf.printf \"%d\\n\" @@ max result1 result2\n)", "language": "OCaml", "metadata": {"date": 1599379289, "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/s557041333.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s557041333", "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 0\n    )\n    in\n    Printf.printf \"%d\\n\" @@ max result1 result2\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1450, "cpu_time_ms": 144, "memory_kb": 12888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s333337298", "group_id": "codeNet:p02874", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let lr = Array.init n (fun i -> Scanf.scanf \" %d %d\" (fun l r -> l, r)) in\n\n    let rec loop i bestl besti =\n        if i = n then besti else\n            let l, r = lr.(i) in\n            if l > bestl then loop (i + 1) l i\n                         else loop (i + 1) bestl besti\n    in\n    let p = loop 0 0 0 in\n    let rec loop i bestr besti =\n        if i = n then besti else\n            let l, r = lr.(i) in\n            if r < bestr then loop (i + 1) r i\n                         else loop (i + 1) bestr besti\n    in\n    let q = loop 0 max_int 0 in\n    let lp, rp = lr.(p) in\n    let lq, rq = lr.(q) in\n\n    let result = if p = q then (\n        let l0, r0 = lr.(p) in\n        let rec loop j acc =\n            if j = n then acc + r0 - l0 + 1 else\n            if j = p then loop (j + 1) acc else\n                let l1, r1 = lr.(j) in\n                loop (j + 1) (max acc (r1 - l1 + 1))\n        in\n        loop 0 0\n    ) else (\n        let work = Array.map (fun (l, r) -> max (r - lp + 1) 0, max (rq - l + 1) 0) lr in\n        Array.sort (fun (a0, b0) (a1, b1) -> compare (a0, -b0) (a1, -b1)) work;\n        let work2 = Array.init (n + 1) (fun _ -> [| 0; 0 |]) in\n        work2.(0).(1) <- rq - lq + 1;\n        work2.(n).(0) <- rp - lp + 1;\n        for i = 1 to n do\n            let _, b = work.(i - 1) in\n            work2.(i).(1) <- min work2.(i - 1).(1) b;\n        done;\n        for i = n - 1 downto 0 do\n            let a, _ = work.(i) in\n            work2.(i).(0) <- min work2.(i + 1).(0) a;\n        done;\n\n        Array.fold_left (fun acc arr -> max acc (arr.(0) + arr.(1))) 0 work2\n    )\n    in\n    Printf.printf \"%d\\n\" result\n)", "language": "OCaml", "metadata": {"date": 1599367907, "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/s333337298.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s333337298", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let lr = Array.init n (fun i -> Scanf.scanf \" %d %d\" (fun l r -> l, r)) in\n\n    let rec loop i bestl besti =\n        if i = n then besti else\n            let l, r = lr.(i) in\n            if l > bestl then loop (i + 1) l i\n                         else loop (i + 1) bestl besti\n    in\n    let p = loop 0 0 0 in\n    let rec loop i bestr besti =\n        if i = n then besti else\n            let l, r = lr.(i) in\n            if r < bestr then loop (i + 1) r i\n                         else loop (i + 1) bestr besti\n    in\n    let q = loop 0 max_int 0 in\n    let lp, rp = lr.(p) in\n    let lq, rq = lr.(q) in\n\n    let result = if p = q then (\n        let l0, r0 = lr.(p) in\n        let rec loop j acc =\n            if j = n then acc + r0 - l0 + 1 else\n            if j = p then loop (j + 1) acc else\n                let l1, r1 = lr.(j) in\n                loop (j + 1) (max acc (r1 - l1 + 1))\n        in\n        loop 0 0\n    ) else (\n        let work = Array.map (fun (l, r) -> max (r - lp + 1) 0, max (rq - l + 1) 0) lr in\n        Array.sort (fun (a0, b0) (a1, b1) -> compare (a0, -b0) (a1, -b1)) work;\n        let work2 = Array.init (n + 1) (fun _ -> [| 0; 0 |]) in\n        work2.(0).(1) <- rq - lq + 1;\n        work2.(n).(0) <- rp - lp + 1;\n        for i = 1 to n do\n            let _, b = work.(i - 1) in\n            work2.(i).(1) <- min work2.(i - 1).(1) b;\n        done;\n        for i = n - 1 downto 0 do\n            let a, _ = work.(i) in\n            work2.(i).(0) <- min work2.(i + 1).(0) a;\n        done;\n\n        Array.fold_left (fun acc arr -> max acc (arr.(0) + arr.(1))) 0 work2\n    )\n    in\n    Printf.printf \"%d\\n\" result\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1663, "cpu_time_ms": 145, "memory_kb": 15708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s087599931", "group_id": "codeNet:p02874", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let lim = 10_000_000_000 in\n    let lr = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun l r -> l, r)) in\n    let lp = Array.fold_left (fun acc (l, r) -> max acc l) 0  lr in\n    let rq = Array.fold_left (fun acc (l, r) -> min acc r) lim lr in\n    let ab = Array.mapi (fun i (l, r)-> max (r - lp + 1) 0, - max (rq - l + 1) 0, l, r) lr in\n    Array.sort compare ab;\n    let s = Array.make (n - 1) 0 in\n    let rec loop i l r =\n        if i = n - 1 then () else\n            let (_, _, ll, rr) = ab.(i) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i) <- max 0 (r - l + 1) in\n            loop (i + 1) l r\n    in\n    loop 0 0 lim;\n\n    let rec loop i l r =\n        if i = 0 then () else\n            let (_, _, ll, rr) = ab.(i) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i - 1) <- s.(i - 1) + max 0 (r - l + 1) in\n            loop (i - 1) l r\n    in\n    loop (n - 1) 0 lim;\n\n    Array.fold_left max 0 s |> Printf.printf \"%d\\n\"\n)\n", "language": "OCaml", "metadata": {"date": 1596525860, "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/s087599931.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s087599931", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let lim = 10_000_000_000 in\n    let lr = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun l r -> l, r)) in\n    let lp = Array.fold_left (fun acc (l, r) -> max acc l) 0  lr in\n    let rq = Array.fold_left (fun acc (l, r) -> min acc r) lim lr in\n    let ab = Array.mapi (fun i (l, r)-> max (r - lp + 1) 0, - max (rq - l + 1) 0, l, r) lr in\n    Array.sort compare ab;\n    let s = Array.make (n - 1) 0 in\n    let rec loop i l r =\n        if i = n - 1 then () else\n            let (_, _, ll, rr) = ab.(i) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i) <- max 0 (r - l + 1) in\n            loop (i + 1) l r\n    in\n    loop 0 0 lim;\n\n    let rec loop i l r =\n        if i = 0 then () else\n            let (_, _, ll, rr) = ab.(i) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i - 1) <- s.(i - 1) + max 0 (r - l + 1) in\n            loop (i - 1) l r\n    in\n    loop (n - 1) 0 lim;\n\n    Array.fold_left max 0 s |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1048, "cpu_time_ms": 148, "memory_kb": 15476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s657109901", "group_id": "codeNet:p02874", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let lr = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun l r -> l, r)) in\n    let lp = Array.fold_left (fun acc (l, r) -> max acc l) 0       lr in\n    let rq = Array.fold_left (fun acc (l, r) -> min acc r) max_int lr in\n    let ab = Array.mapi (fun i (l, r)-> max (r - lp + 1) 0, - max (rq - l + 1) 0, i) lr in\n    Array.sort compare ab;\n    let s = Array.make (n - 1) 0 in\n    let rec loop i l r =\n        if i = n - 1 then () else\n            let (_, _, j) = ab.(i) in\n            let ll, rr = lr.(j) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i) <- max 0 (r - l + 1) in\n            loop (i + 1) l r\n    in\n    loop 0 0 max_int;\n\n    let rec loop i l r =\n        if i = 0 then () else\n            let (_, _, j) = ab.(i) in\n            let ll, rr = lr.(j) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i - 1) <- s.(i - 1) + max 0 (r - l + 1) in\n            loop (i - 1) l r\n    in\n    loop (n - 1) 0 max_int;\n\n    Array.fold_left max 0 s |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1596510471, "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/s657109901.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s657109901", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let lr = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun l r -> l, r)) in\n    let lp = Array.fold_left (fun acc (l, r) -> max acc l) 0       lr in\n    let rq = Array.fold_left (fun acc (l, r) -> min acc r) max_int lr in\n    let ab = Array.mapi (fun i (l, r)-> max (r - lp + 1) 0, - max (rq - l + 1) 0, i) lr in\n    Array.sort compare ab;\n    let s = Array.make (n - 1) 0 in\n    let rec loop i l r =\n        if i = n - 1 then () else\n            let (_, _, j) = ab.(i) in\n            let ll, rr = lr.(j) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i) <- max 0 (r - l + 1) in\n            loop (i + 1) l r\n    in\n    loop 0 0 max_int;\n\n    let rec loop i l r =\n        if i = 0 then () else\n            let (_, _, j) = ab.(i) in\n            let ll, rr = lr.(j) in\n            let l = max ll l in\n            let r = min rr r in\n            let () = s.(i - 1) <- s.(i - 1) + max 0 (r - l + 1) in\n            loop (i - 1) l r\n    in\n    loop (n - 1) 0 max_int;\n\n    Array.fold_left max 0 s |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1089, "cpu_time_ms": 163, "memory_kb": 14388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s119048218", "group_id": "codeNet:p02881", "input_text": "let rec max_divisor acc i n =\n  if n < i * i then acc\n  else max_divisor (if n mod i = 0 then i else acc) (i + 1) n\n\nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  let i = max_divisor 1 1 n in\n  Printf.printf \"%d\\n\" @@ i + n / i - 2\n\n", "language": "OCaml", "metadata": {"date": 1572226427, "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/s119048218.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s119048218", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let rec max_divisor acc i n =\n  if n < i * i then acc\n  else max_divisor (if n mod i = 0 then i else acc) (i + 1) n\n\nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  let i = max_divisor 1 1 n in\n  Printf.printf \"%d\\n\" @@ i + n / i - 2\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "sample_input": "10\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02881", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s908448910", "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 atan2 b @@ 2. *. x /. (a *. b) else atan2 (2. *. (a *. b -. x /. a)) (a *. a)", "language": "OCaml", "metadata": {"date": 1572801257, "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/s908448910.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908448910", "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 atan2 b @@ 2. *. x /. (a *. b) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s541908559", "group_id": "codeNet:p02883", "input_text": "open Scanf ;;\nopen Printf ;;\n\nlet read_int () = scanf \" %d\" (fun x -> x) ;;\n\nlet rec powi a b = if b = 0 then 1 else a * powi a (b - 1);;\n\nlet list_sum a = List.fold_left (+) 0 a ;;\n\nlet rec read_ints n = if n = 0 then [] else read_int() :: read_ints (n - 1) ;;\n\nlet () =\n  let n = read_int () in\n  let k = read_int () in\n  let a = read_ints n |> List.sort compare in\n  let f = read_ints n |> List.sort compare |> List.rev in\n  let rec search l r =\n    if r - l = 1 then r\n    else begin\n      let m = (l + r) / 2 in\n      let v = List.map2 (fun x y -> max 0 (x - m / y)) a f |> list_sum in\n      if v <= k\n        then search l m\n        else search m r\n    end\n  in\n  let ans = search (-1) (powi 10 12) in\n  printf \"%d\\n\" ans\n  ;;\n\n", "language": "OCaml", "metadata": {"date": 1572487546, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02883.html", "problem_id": "p02883", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02883/input.txt", "sample_output_relpath": "derived/input_output/data/p02883/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02883/OCaml/s541908559.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s541908559", "user_id": "u006493569"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Scanf ;;\nopen Printf ;;\n\nlet read_int () = scanf \" %d\" (fun x -> x) ;;\n\nlet rec powi a b = if b = 0 then 1 else a * powi a (b - 1);;\n\nlet list_sum a = List.fold_left (+) 0 a ;;\n\nlet rec read_ints n = if n = 0 then [] else read_int() :: read_ints (n - 1) ;;\n\nlet () =\n  let n = read_int () in\n  let k = read_int () in\n  let a = read_ints n |> List.sort compare in\n  let f = read_ints n |> List.sort compare |> List.rev in\n  let rec search l r =\n    if r - l = 1 then r\n    else begin\n      let m = (l + r) / 2 in\n      let v = List.map2 (fun x y -> max 0 (x - m / y)) a f |> list_sum in\n      if v <= k\n        then search l m\n        else search m r\n    end\n  in\n  let ans = search (-1) (powi 10 12) in\n  printf \"%d\\n\" ans\n  ;;\n\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "sample_input": "3 5\n4 2 1\n2 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02883", "source_text": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 734, "cpu_time_ms": 1141, "memory_kb": 42896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s498700251", "group_id": "codeNet:p02885", "input_text": "Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> let r = max 0 (a - 2 * b) in Printf.printf \"%d\\n\" r)", "language": "OCaml", "metadata": {"date": 1571533330, "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/s498700251.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s498700251", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> let r = max 0 (a - 2 * b) in Printf.printf \"%d\\n\" r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "sample_input": "12 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02885", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s877143547", "group_id": "codeNet:p02886", "input_text": "let i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.map (fun x -> int_of_string x) (inp_split)\n\n  \nlet rec pairs : 'a list -> ('a * 'a) list = function\n    [] -> []\n  | x :: xs -> List.map (fun y -> (x, y)) xs @ (pairs xs)\n  \nlet () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun n -> n) in\n  let l = i_inp_list () in\n  let p = pairs l in\n  let ans = List.fold_right(fun (a,b) s -> a * b + s) p 0 \n  in\n  print_int ans;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1572625580, "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/s877143547.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s877143547", "user_id": "u977566741"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.map (fun x -> int_of_string x) (inp_split)\n\n  \nlet rec pairs : 'a list -> ('a * 'a) list = function\n    [] -> []\n  | x :: xs -> List.map (fun y -> (x, y)) xs @ (pairs xs)\n  \nlet () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun n -> n) in\n  let l = i_inp_list () in\n  let p = pairs l in\n  let ans = List.fold_right(fun (a,b) s -> a * b + s) p 0 \n  in\n  print_int ans;\n  print_newline ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 514, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s541205153", "group_id": "codeNet:p02890", "input_text": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet scan_array len read_func = Array.init len (fun _ -> read_func())\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet input n =\n  let arr = Array.make n 0 in\n  let _ =\n    for i = 0 to n-1 do\n      let a = scan_int() in\n      arr.(a-1) <- arr.(a-1) + 1\n    done in\n  arr\n\nlet cumulative_sum n arr =\n  let ret = Array.make (n+1) 0 in\n  let _ =\n    for i = 0 to n-1 do\n      ret.(i+1) <- ret.(i) + arr.(i)\n    done in\n  ret\n\nlet rec binary_search left right eval =\n  if right - left <= 1 then right\n  else \n    let mid = (right + left) / 2 in\n    if eval mid then binary_search mid right eval\n    else binary_search left mid eval\n\nlet inner_eval arr value mid = arr.(mid) > value\n\nlet eval i arr cum remain mid =\n  let r = binary_search (-1) i (inner_eval arr mid) in\n  let require = (i-r) * mid - (cum.(i) - cum.(r)) in\n  remain >= require\n\nlet solve i n arr cum =\n  let remain = n - cum.(i) in\n  (binary_search 0 (n+1) (eval i arr cum remain)) - 1  (* get left *)\n\n\nlet () =\n  let n = scan_int() in\n  let arr = input n in\n  let _ = Array.fast_sort (fun x y -> if x < y then 1 else 0) arr in\n  let cum = cumulative_sum n arr in\n  for i = 1 to n do\n    print_int (solve i n arr cum)\n  done\n  ", "language": "OCaml", "metadata": {"date": 1571889980, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02890.html", "problem_id": "p02890", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02890/input.txt", "sample_output_relpath": "derived/input_output/data/p02890/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02890/OCaml/s541205153.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s541205153", "user_id": "u521364030"}, "prompt_components": {"gold_output": "3\n1\n0\n", "input_to_evaluate": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet scan_array len read_func = Array.init len (fun _ -> read_func())\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet input n =\n  let arr = Array.make n 0 in\n  let _ =\n    for i = 0 to n-1 do\n      let a = scan_int() in\n      arr.(a-1) <- arr.(a-1) + 1\n    done in\n  arr\n\nlet cumulative_sum n arr =\n  let ret = Array.make (n+1) 0 in\n  let _ =\n    for i = 0 to n-1 do\n      ret.(i+1) <- ret.(i) + arr.(i)\n    done in\n  ret\n\nlet rec binary_search left right eval =\n  if right - left <= 1 then right\n  else \n    let mid = (right + left) / 2 in\n    if eval mid then binary_search mid right eval\n    else binary_search left mid eval\n\nlet inner_eval arr value mid = arr.(mid) > value\n\nlet eval i arr cum remain mid =\n  let r = binary_search (-1) i (inner_eval arr mid) in\n  let require = (i-r) * mid - (cum.(i) - cum.(r)) in\n  remain >= require\n\nlet solve i n arr cum =\n  let remain = n - cum.(i) in\n  (binary_search 0 (n+1) (eval i arr cum remain)) - 1  (* get left *)\n\n\nlet () =\n  let n = scan_int() in\n  let arr = input n in\n  let _ = Array.fast_sort (fun x y -> if x < y then 1 else 0) arr in\n  let cum = cumulative_sum n arr in\n  for i = 1 to n do\n    print_int (solve i n arr cum)\n  done\n  ", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N cards. The i-th of these cards has an integer A_i written on it.\n\nTakahashi will choose an integer K, and then repeat the following operation some number of times:\n\nChoose exactly K cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)\n\nFor each K = 1,2, \\ldots, N, find the maximum number of times Takahashi can do the operation.\n\nConstraints\n\n1 \\le N \\le 3 \\times 10^5\n\n1 \\le A_i \\le N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint N integers.\nThe t-th (1 \\le t \\le N) of them should be the answer for the case K=t.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n3\n1\n0\n\nFor K = 1, we can do the operation as follows:\n\nChoose the first card to eat.\n\nChoose the second card to eat.\n\nChoose the third card to eat.\n\nFor K = 2, we can do the operation as follows:\n\nChoose the first and second cards to eat.\n\nFor K = 3, we cannot do the operation at all. Note that we cannot choose the first and third cards at the same time.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n5\n2\n1\n1\n1\n\nSample Input 3\n\n4\n1 3 3 3\n\nSample Output 3\n\n4\n1\n0\n0", "sample_input": "3\n2 1 2\n"}, "reference_outputs": ["3\n1\n0\n"], "source_document_id": "p02890", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N cards. The i-th of these cards has an integer A_i written on it.\n\nTakahashi will choose an integer K, and then repeat the following operation some number of times:\n\nChoose exactly K cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)\n\nFor each K = 1,2, \\ldots, N, find the maximum number of times Takahashi can do the operation.\n\nConstraints\n\n1 \\le N \\le 3 \\times 10^5\n\n1 \\le A_i \\le N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint N integers.\nThe t-th (1 \\le t \\le N) of them should be the answer for the case K=t.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n3\n1\n0\n\nFor K = 1, we can do the operation as follows:\n\nChoose the first card to eat.\n\nChoose the second card to eat.\n\nChoose the third card to eat.\n\nFor K = 2, we can do the operation as follows:\n\nChoose the first and second cards to eat.\n\nFor K = 3, we cannot do the operation at all. Note that we cannot choose the first and third cards at the same time.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n5\n2\n1\n1\n1\n\nSample Input 3\n\n4\n1 3 3 3\n\nSample Output 3\n\n4\n1\n0\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1236, "cpu_time_ms": 1441, "memory_kb": 10368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s965149822", "group_id": "codeNet:p02897", "input_text": "let n = read_int ()\nlet ans = if n mod 2 = 0 then 0.5 else (float_of_int (n/2+1)) /. (float_of_int n)\nlet () = print_float ans", "language": "OCaml", "metadata": {"date": 1588325662, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02897.html", "problem_id": "p02897", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02897/input.txt", "sample_output_relpath": "derived/input_output/data/p02897/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02897/OCaml/s965149822.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965149822", "user_id": "u307426615"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "let n = read_int ()\nlet ans = if n mod 2 = 0 then 0.5 else (float_of_int (n/2+1)) /. (float_of_int n)\nlet () = print_float ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "sample_input": "4\n"}, "reference_outputs": ["0.5000000000\n"], "source_document_id": "p02897", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s340429503", "group_id": "codeNet:p02897", "input_text": "open Printf\nopen Scanf\n\nlet solve n =\n  float_of_int ((n + 1) / 2) /. float_of_int n\n\nlet () =\n  scanf \"%d \" solve |> printf \"%.9f\\n\"\n", "language": "OCaml", "metadata": {"date": 1582401660, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02897.html", "problem_id": "p02897", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02897/input.txt", "sample_output_relpath": "derived/input_output/data/p02897/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02897/OCaml/s340429503.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340429503", "user_id": "u388783188"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve n =\n  float_of_int ((n + 1) / 2) /. float_of_int n\n\nlet () =\n  scanf \"%d \" solve |> printf \"%.9f\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "sample_input": "4\n"}, "reference_outputs": ["0.5000000000\n"], "source_document_id": "p02897", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s646969987", "group_id": "codeNet:p02897", "input_text": "let n = read_int ()\nlet _ = Printf.printf \"%.10f\\n\" @@ float (n - n / 2) /. float n", "language": "OCaml", "metadata": {"date": 1569755551, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02897.html", "problem_id": "p02897", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02897/input.txt", "sample_output_relpath": "derived/input_output/data/p02897/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02897/OCaml/s646969987.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646969987", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "let n = read_int ()\nlet _ = Printf.printf \"%.10f\\n\" @@ float (n - n / 2) /. float n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "sample_input": "4\n"}, "reference_outputs": ["0.5000000000\n"], "source_document_id": "p02897", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s648547284", "group_id": "codeNet:p02898", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let h = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let ans = Array.fold_left (fun a x -> if x >= k then a+1 else a) 0 h in\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1599421498, "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/s648547284.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s648547284", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let h = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let ans = Array.fold_left (fun a x -> if x >= k then a+1 else a) 0 h 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 28, "memory_kb": 6684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s794999793", "group_id": "codeNet:p02898", "input_text": "(* unihernandez22\n * https://atcoder.jp/contests/abc142/tasks/abc142_b\n * implementation, simulation\n * *)\n\nScanf.scanf \"%d %d\\n\" @@ fun n k ->\n    Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@\n    Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun h -> if h >= k then 1 else 0\n\n", "language": "OCaml", "metadata": {"date": 1593658545, "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/s794999793.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s794999793", "user_id": "u878654696"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* unihernandez22\n * https://atcoder.jp/contests/abc142/tasks/abc142_b\n * implementation, simulation\n * *)\n\nScanf.scanf \"%d %d\\n\" @@ fun n k ->\n    Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@\n    Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun h -> if h >= k then 1 else 0\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 30, "memory_kb": 6620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s125556874", "group_id": "codeNet:p02898", "input_text": "let i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.map (fun x -> int_of_string x) (inp_split)\n  \nlet () =\n  let (n, k) = Scanf.sscanf (input_line stdin) \"%d %d\" (fun a b -> (a, b)) in\n  let l = i_inp_list () in\n  let ans = List.fold_right (fun h num -> num + (if h >= k then 1 else 0)) l 0\n  in\n  print_int ans;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1572469097, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s125556874.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s125556874", "user_id": "u977566741"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.map (fun x -> int_of_string x) (inp_split)\n  \nlet () =\n  let (n, k) = Scanf.sscanf (input_line stdin) \"%d %d\" (fun a b -> (a, b)) in\n  let l = i_inp_list () in\n  let ans = List.fold_right (fun h num -> num + (if h >= k then 1 else 0)) l 0\n  in\n  print_int ans;\n  print_newline ()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 400, "cpu_time_ms": 38, "memory_kb": 13824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s883873697", "group_id": "codeNet:p02899", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\nopen BatList\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" (\n        fun n -> \n                n\n)\n\nlet lst = Str.split (Str.regexp \" \") (read_line ())\n          |> BatList.map int_of_string\n\nlet lst2 = BatList.map2 (fun i elmnt -> (i, elmnt)) (BatList.range 1 `To n) lst\n           |> BatList.fast_sort (fun (ai, ae) (bi, be) -> if ae = be then 0 else if ae < be then -1 else 1)\n           |> BatList.map (fun (i, e) -> string_of_int i)\n\nlet () = \n        BatList.fold_right (fun a b -> a ^ \" \" ^ b) lst2 \"\"\n        |> Printf.printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1590190571, "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/s883873697.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s883873697", "user_id": "u280335093"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\nopen BatList\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" (\n        fun n -> \n                n\n)\n\nlet lst = Str.split (Str.regexp \" \") (read_line ())\n          |> BatList.map int_of_string\n\nlet lst2 = BatList.map2 (fun i elmnt -> (i, elmnt)) (BatList.range 1 `To n) lst\n           |> BatList.fast_sort (fun (ai, ae) (bi, be) -> if ae = be then 0 else if ae < be then -1 else 1)\n           |> BatList.map (fun (i, e) -> string_of_int i)\n\nlet () = \n        BatList.fold_right (fun a b -> a ^ \" \" ^ b) lst2 \"\"\n        |> Printf.printf \"%s\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 622, "cpu_time_ms": 2105, "memory_kb": 26300}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s169455559", "group_id": "codeNet:p02899", "input_text": "type 'a tree =\n    Leaf\n  | Node of 'a tree * 'a * 'a tree\n\nlet empty : 'a tree = Leaf\n          \nlet rec insert : ('a -> 'b) -> 'a -> 'a tree -> 'a tree = fun f x t ->\n  match t with\n    Leaf -> Node (Leaf, x , Leaf)\n  | Node (l, y, r) ->\n     if f x < f y then\n       Node (insert f x l, y, r)\n     else\n       Node (l, y, insert f x  r)\n\nlet rec print_tree_int t =\n  match t with\n    Leaf -> ()\n  | Node (l, (x, i), r) ->\n     print_tree_int l;\n     print_int i;\n     print_char ' ' ;\n     print_tree_int r\n                \nlet i_inp_list : unit -> (int * int) list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.mapi (fun i x -> (int_of_string x, i + 1)) (inp_split)\n  \nlet () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let l = i_inp_list () in\n  let ans = List.fold_left (fun t x -> insert (fun (a, b) -> b) x t) empty l in\n  print_tree_int ans;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1572533014, "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/s169455559.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s169455559", "user_id": "u977566741"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "type 'a tree =\n    Leaf\n  | Node of 'a tree * 'a * 'a tree\n\nlet empty : 'a tree = Leaf\n          \nlet rec insert : ('a -> 'b) -> 'a -> 'a tree -> 'a tree = fun f x t ->\n  match t with\n    Leaf -> Node (Leaf, x , Leaf)\n  | Node (l, y, r) ->\n     if f x < f y then\n       Node (insert f x l, y, r)\n     else\n       Node (l, y, insert f x  r)\n\nlet rec print_tree_int t =\n  match t with\n    Leaf -> ()\n  | Node (l, (x, i), r) ->\n     print_tree_int l;\n     print_int i;\n     print_char ' ' ;\n     print_tree_int r\n                \nlet i_inp_list : unit -> (int * int) list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.mapi (fun i x -> (int_of_string x, i + 1)) (inp_split)\n  \nlet () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let l = i_inp_list () in\n  let ans = List.fold_left (fun t x -> insert (fun (a, b) -> b) x t) empty l in\n  print_tree_int ans;\n  print_newline ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 933, "cpu_time_ms": 2104, "memory_kb": 19388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676702407", "group_id": "codeNet:p02899", "input_text": "type 'a tree =\n    Leaf\n  | Node of 'a tree * 'a * 'a tree\n\nlet empty = Leaf\n          \nlet rec insert (x, i) t =\n  match t with\n    Leaf -> Node (Leaf, (x, i) , Leaf)\n  | Node (l, (y, j), r) ->\n     if x < y then\n       Node (insert (x, i) l, (y, j), r)\n     else\n       Node (l, (y, j), insert (x, i) r)\n\nlet rec print_tree_int t =\n  match t with\n    Leaf -> ()\n  | Node (l, (x, i), r) ->\n     print_tree_int l;\n     print_int i;\n     print_char ' ' ;\n     print_tree_int r\n                \nlet i_inp_list : unit -> (int * int) list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.mapi (fun i x -> (int_of_string x, i + 1)) (inp_split)\n  \nlet () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let l = i_inp_list () in\n  let ans = List.fold_left (fun t x -> insert x t) empty l in\n  print_tree_int ans;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1572532766, "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/s676702407.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676702407", "user_id": "u977566741"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "type 'a tree =\n    Leaf\n  | Node of 'a tree * 'a * 'a tree\n\nlet empty = Leaf\n          \nlet rec insert (x, i) t =\n  match t with\n    Leaf -> Node (Leaf, (x, i) , Leaf)\n  | Node (l, (y, j), r) ->\n     if x < y then\n       Node (insert (x, i) l, (y, j), r)\n     else\n       Node (l, (y, j), insert (x, i) r)\n\nlet rec print_tree_int t =\n  match t with\n    Leaf -> ()\n  | Node (l, (x, i), r) ->\n     print_tree_int l;\n     print_int i;\n     print_char ' ' ;\n     print_tree_int r\n                \nlet i_inp_list : unit -> (int * int) list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  List.mapi (fun i x -> (int_of_string x, i + 1)) (inp_split)\n  \nlet () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let l = i_inp_list () in\n  let ans = List.fold_left (fun t x -> insert x t) empty l in\n  print_tree_int ans;\n  print_newline ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 244, "memory_kb": 21692}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s176477761", "group_id": "codeNet:p02899", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" pred\nlet rs = Array.make n 0\nlet _ = Array.(iteri (fun i a -> rs.(a) <- i + 1) a_s; iteri (fun i r -> Printf.printf (if i = 0 then \"%d\" else \" %d\") r) rs; print_newline ())", "language": "OCaml", "metadata": {"date": 1569758631, "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/s176477761.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176477761", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" pred\nlet rs = Array.make n 0\nlet _ = Array.(iteri (fun i a -> rs.(a) <- i + 1) a_s; iteri (fun i r -> Printf.printf (if i = 0 then \"%d\" else \" %d\") r) rs; 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 47, "memory_kb": 6784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380164770", "group_id": "codeNet:p02899", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let as' = Array.make n 0 in\n  Array.iteri (fun i a -> as'.(a - 1) <- i + 1) as_;\n  Array.iter (Printf.printf \"%d \") as';\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1569719701, "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/s380164770.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380164770", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3 1 2\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  let as' = Array.make n 0 in\n  Array.iteri (fun i a -> as'.(a - 1) <- i + 1) as_;\n  Array.iter (Printf.printf \"%d \") as';\n  print_newline ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 47, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s166497311", "group_id": "codeNet:p02904", "input_text": "Scanf.scanf \"%d %d\" (fun n k ->\n    let p = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun p -> p)) in\n    let module S = Set.Make (struct type t = int let compare = compare end) in\n\n    let rec loop i streak count =\n        if i = n then count else\n            let streak = if p.(i - 1) < p.(i) then streak + 1 else 0 in\n            let count = if streak = k - 1 then count + 1 else count in\n            loop (i + 1) streak count\n    in\n    let count = loop 1 0 0 in\n\n    let rec loop i set acc =\n        if i = n then acc else\n            let set = S.remove p.(i - k) set in\n            let nmi = S.min_elt set in\n            let nmx = S.max_elt set in\n            let acc = if p.(i - k) > nmi || p.(i) < nmx then acc + 1 else acc in\n            let set = S.add p.(i) set in\n            loop (i + 1) set acc\n    in\n    let init =\n        let rec loop i set =\n            if i = k then set else loop (i + 1) (S.add p.(i) set)\n        in\n        loop 0 S.empty\n    in\n    let ans = loop k init 1 in\n    Printf.printf \"%d\\n\" (ans - max 0 (count - 1))\n)", "language": "OCaml", "metadata": {"date": 1591235265, "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/s166497311.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166497311", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n k ->\n    let p = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun p -> p)) in\n    let module S = Set.Make (struct type t = int let compare = compare end) in\n\n    let rec loop i streak count =\n        if i = n then count else\n            let streak = if p.(i - 1) < p.(i) then streak + 1 else 0 in\n            let count = if streak = k - 1 then count + 1 else count in\n            loop (i + 1) streak count\n    in\n    let count = loop 1 0 0 in\n\n    let rec loop i set acc =\n        if i = n then acc else\n            let set = S.remove p.(i - k) set in\n            let nmi = S.min_elt set in\n            let nmx = S.max_elt set in\n            let acc = if p.(i - k) > nmi || p.(i) < nmx then acc + 1 else acc in\n            let set = S.add p.(i) set in\n            loop (i + 1) set acc\n    in\n    let init =\n        let rec loop i set =\n            if i = k then set else loop (i + 1) (S.add p.(i) set)\n        in\n        loop 0 S.empty\n    in\n    let ans = loop k init 1 in\n    Printf.printf \"%d\\n\" (ans - max 0 (count - 1))\n)", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "sample_input": "5 3\n0 2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02904", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1050, "cpu_time_ms": 349, "memory_kb": 20736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s550748544", "group_id": "codeNet:p02910", "input_text": "let () =\n  Scanf.scanf \"%s\\n\" @@ fun s ->\n  let ans = ref true in\n  let check i c =\n    if i mod 2 = 1 then\n      if c = 'R' || c = 'U' || c = 'D' then () else ans := !ans && false\n    else\n      if c = 'L' || c = 'U' || c = 'D' then () else ans := !ans && false in\n  StringLabels.iteri (fun i c -> check (i+1) c) s;\n  Printf.printf \"%s\\n\" (if !ans then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1599421982, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02910.html", "problem_id": "p02910", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02910/input.txt", "sample_output_relpath": "derived/input_output/data/p02910/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02910/OCaml/s550748544.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s550748544", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%s\\n\" @@ fun s ->\n  let ans = ref true in\n  let check i c =\n    if i mod 2 = 1 then\n      if c = 'R' || c = 'U' || c = 'D' then () else ans := !ans && false\n    else\n      if c = 'L' || c = 'U' || c = 'D' then () else ans := !ans && false in\n  StringLabels.iteri (fun i c -> check (i+1) c) s;\n  Printf.printf \"%s\\n\" (if !ans then \"Yes\" else \"No\")", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "sample_input": "RUDLUDR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02910", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 8, "memory_kb": 3716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s484667284", "group_id": "codeNet:p02911", "input_text": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n k q ->\n  let ppoint = Array.make n 0 in\n  for i = 1 to q do\n    Scanf.scanf \"%d\\n\" @@ fun a -> ppoint.(a-1) <- ppoint.(a-1) + 1\n  done;\n  for i = 0 to n - 1 do\n    if k - q + ppoint.(i) > 0 then Printf.printf \"Yes\\n\"\n    else Printf.printf \"No\\n\"\n  done;", "language": "OCaml", "metadata": {"date": 1596420802, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s484667284.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s484667284", "user_id": "u052332717"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n k q ->\n  let ppoint = Array.make n 0 in\n  for i = 1 to q do\n    Scanf.scanf \"%d\\n\" @@ fun a -> ppoint.(a-1) <- ppoint.(a-1) + 1\n  done;\n  for i = 0 to n - 1 do\n    if k - q + ppoint.(i) > 0 then Printf.printf \"Yes\\n\"\n    else Printf.printf \"No\\n\"\n  done;", "problem_context": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "sample_input": "6 3 4\n3\n1\n3\n2\n"}, "reference_outputs": ["No\nNo\nYes\nNo\nNo\nNo\n"], "source_document_id": "p02911", "source_text": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 34, "memory_kb": 6628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s800340386", "group_id": "codeNet:p02911", "input_text": "let n, k, q = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet rs = Array.make n 0\nlet s = for i = 1 to q do Scanf.scanf \" %d\" @@ fun a -> rs.(a - 1) <- rs.(a - 1) + 1 done; Array.fold_left (+) 0 rs\nlet _ = Array.iter (fun r -> print_endline @@ if k - (s - r) > 0 then \"Yes\" else \"No\") rs", "language": "OCaml", "metadata": {"date": 1568660660, "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/s800340386.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800340386", "user_id": "u732304692"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "let n, k, q = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet rs = Array.make n 0\nlet s = for i = 1 to q do Scanf.scanf \" %d\" @@ fun a -> rs.(a - 1) <- rs.(a - 1) + 1 done; Array.fold_left (+) 0 rs\nlet _ = Array.iter (fun r -> print_endline @@ if k - (s - r) > 0 then \"Yes\" else \"No\") rs", "problem_context": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "sample_input": "6 3 4\n3\n1\n3\n2\n"}, "reference_outputs": ["No\nNo\nYes\nNo\nNo\nNo\n"], "source_document_id": "p02911", "source_text": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 165, "memory_kb": 5632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s360790935", "group_id": "codeNet:p02915", "input_text": "let password n = n * n * n\nlet () = Printf.printf \"%d\\n\" (password (read_int ()))", "language": "OCaml", "metadata": {"date": 1595715384, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s360790935.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360790935", "user_id": "u272377260"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let password n = n * n * n\nlet () = Printf.printf \"%d\\n\" (password (read_int ()))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 81, "cpu_time_ms": 8, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s085142697", "group_id": "codeNet:p02920", "input_text": "\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss =\n    Array.init (1 lsl n) @@ fun _ ->\n      Scanf.scanf \"%d \" @@ fun s -> s in\n  print_endline @@\n  try\n    Array.sort (fun s s' -> compare s' s) ss;\n    let ssq = Queue.create () in\n    Array.iter (fun s -> Queue.push s ssq) ss;\n    let q = Queue.create () in\n    Queue.push (Queue.pop ssq, n) q;\n    while not (Queue.is_empty q) do\n      let (s, n) = Queue.pop q in\n      for m = n - 1 downto 0 do\n        let s' = Queue.pop ssq in\n        if s <= s'\n        then raise Not_found\n        else Queue.push (s', m) q\n      done\n    done;\n    \"Yes\"\n  with Not_found -> \"No\"\n", "language": "OCaml", "metadata": {"date": 1568026215, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02920.html", "problem_id": "p02920", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02920/input.txt", "sample_output_relpath": "derived/input_output/data/p02920/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02920/OCaml/s085142697.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s085142697", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss =\n    Array.init (1 lsl n) @@ fun _ ->\n      Scanf.scanf \"%d \" @@ fun s -> s in\n  print_endline @@\n  try\n    Array.sort (fun s s' -> compare s' s) ss;\n    let ssq = Queue.create () in\n    Array.iter (fun s -> Queue.push s ssq) ss;\n    let q = Queue.create () in\n    Queue.push (Queue.pop ssq, n) q;\n    while not (Queue.is_empty q) do\n      let (s, n) = Queue.pop q in\n      for m = n - 1 downto 0 do\n        let s' = Queue.pop ssq in\n        if s <= s'\n        then raise Not_found\n        else Queue.push (s', m) q\n      done\n    done;\n    \"Yes\"\n  with Not_found -> \"No\"\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have one slime.\n\nYou can set the health of this slime to any integer value of your choice.\n\nA slime reproduces every second by spawning another slime that has strictly less health. You can freely choose the health of each new slime. The first reproduction of our slime will happen in one second.\n\nDetermine if it is possible to set the healths of our first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals a multiset S.\n\nHere S is a multiset containing 2^N (possibly duplicated) integers: S_1,~S_2,~...,~S_{2^N}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 18\n\n1 \\leq S_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_{2^N}\n\nOutput\n\nIf it is possible to set the healths of the first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals S, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n4 2 3 1\n\nSample Output 1\n\nYes\n\nWe will show one way to make the multiset of the healths of the slimes that will exist in 2 seconds equal to S.\n\nFirst, set the health of the first slime to 4.\n\nBy letting the first slime spawn a slime whose health is 3, the healths of the slimes that exist in 1 second can be 4,~3.\n\nThen, by letting the first slime spawn a slime whose health is 2, and letting the second slime spawn a slime whose health is 1, the healths of the slimes that exist in 2 seconds can be 4,~3,~2,~1, which is equal to S as multisets.\n\nSample Input 2\n\n2\n1 2 3 1\n\nSample Output 2\n\nYes\n\nS may contain multiple instances of the same integer.\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n\nSample Output 4\n\nNo", "sample_input": "2\n4 2 3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02920", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have one slime.\n\nYou can set the health of this slime to any integer value of your choice.\n\nA slime reproduces every second by spawning another slime that has strictly less health. You can freely choose the health of each new slime. The first reproduction of our slime will happen in one second.\n\nDetermine if it is possible to set the healths of our first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals a multiset S.\n\nHere S is a multiset containing 2^N (possibly duplicated) integers: S_1,~S_2,~...,~S_{2^N}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 18\n\n1 \\leq S_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_{2^N}\n\nOutput\n\nIf it is possible to set the healths of the first slime and the subsequent slimes spawn so that the multiset of the healths of the 2^N slimes that will exist in N seconds equals S, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n4 2 3 1\n\nSample Output 1\n\nYes\n\nWe will show one way to make the multiset of the healths of the slimes that will exist in 2 seconds equal to S.\n\nFirst, set the health of the first slime to 4.\n\nBy letting the first slime spawn a slime whose health is 3, the healths of the slimes that exist in 1 second can be 4,~3.\n\nThen, by letting the first slime spawn a slime whose health is 2, and letting the second slime spawn a slime whose health is 1, the healths of the slimes that exist in 2 seconds can be 4,~3,~2,~1, which is equal to S as multisets.\n\nSample Input 2\n\n2\n1 2 3 1\n\nSample Output 2\n\nYes\n\nS may contain multiple instances of the same integer.\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 228, "memory_kb": 17664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s468422553", "group_id": "codeNet:p02921", "input_text": "let scan_string () = Scanf.scanf \" %s\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet () =\n  let s = scan_string() and t = scan_string() in\n  let judge i = if (s.[i] == t.[i]) then 1 else 0 in\n  print_int (judge 0 + judge 1 + judge 2)\n", "language": "OCaml", "metadata": {"date": 1567461590, "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/s468422553.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s468422553", "user_id": "u521364030"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let scan_string () = Scanf.scanf \" %s\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet () =\n  let s = scan_string() and t = scan_string() in\n  let judge i = if (s.[i] == t.[i]) then 1 else 0 in\n  print_int (judge 0 + judge 1 + judge 2)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s812674433", "group_id": "codeNet:p02922", "input_text": "let divu x y = \n        if x mod y >= 1 then\n                (x / y) + 1\n        else\n                (x / y)\n\nlet () = Scanf.scanf \"%d %d\" (\n        fun a b -> \n                divu b a\n) |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1588623834, "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/s812674433.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s812674433", "user_id": "u280335093"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let divu x y = \n        if x mod y >= 1 then\n                (x / y) + 1\n        else\n                (x / y)\n\nlet () = Scanf.scanf \"%d %d\" (\n        fun a b -> \n                divu b a\n) |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s597139587", "group_id": "codeNet:p02922", "input_text": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet () =\n  let a = scan_int() and b = scan_int() in\n  let ans =\n    if b < a then 1 \n    else 1 + (b-2) / (a-1) in\n  print_int ans ", "language": "OCaml", "metadata": {"date": 1567461843, "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/s597139587.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s597139587", "user_id": "u521364030"}, "prompt_components": {"gold_output": "3\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 a = scan_int() and b = scan_int() in\n  let ans =\n    if b < a then 1 \n    else 1 + (b-2) / (a-1) in\n  print_int ans ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 222, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s218567929", "group_id": "codeNet:p02922", "input_text": "open Scanf;;\nopen Printf;;\n\nlet rint () = scanf \" %d\" (fun x -> x);;\n\nlet () =\n  let a = rint () and b = rint () in\n  let ans = (b - 1 + a - 2) / (a - 1) in\n  printf \"%d\\n\" ans;\n", "language": "OCaml", "metadata": {"date": 1567401628, "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/s218567929.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218567929", "user_id": "u006493569"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Scanf;;\nopen Printf;;\n\nlet rint () = scanf \" %d\" (fun x -> x);;\n\nlet () =\n  let a = rint () and b = rint () in\n  let ans = (b - 1 + a - 2) / (a - 1) in\n  printf \"%d\\n\" ans;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 178, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s347352546", "group_id": "codeNet:p02926", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n    Array.sort (fun (x0, y0) (x1, y1) ->\n        compare (atan2 (float y0) (float x0)) (atan2 (float y1) (float x1))) xy;\n    let sum = Array.make (2 * n + 1) (0, 0) in\n    for i = 1 to 2 * n do\n        let (x, y) = sum.(i - 1) in\n        let (vx, vy) = xy.((i - 1) mod n) in\n        sum.(i) <- x + vx, y + vy\n    done;\n    let rec loop0 i acc =\n        let rec loop1 j acc =\n            if j = 2 * n + 1 || j >= i + n + 1 then loop0 (i + 1) acc else\n                let (x0, y0) = sum.(i) in\n                let (x1, y1) = sum.(j) in\n                let x = x1 - x0 in\n                let y = y1 - y0 in\n                let acc = max acc (x * x + y * y) in\n                loop1 (j + 1) acc\n        in\n        if i = 2 * n then float acc |> sqrt else loop1 (i + 1) acc\n    in\n    loop0 0 0 |> Printf.printf \"%.12f\\n\"\n)", "language": "OCaml", "metadata": {"date": 1598910481, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s347352546.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s347352546", "user_id": "u342443598"}, "prompt_components": {"gold_output": "10.000000000000000000000000000000000000000000000000\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n    Array.sort (fun (x0, y0) (x1, y1) ->\n        compare (atan2 (float y0) (float x0)) (atan2 (float y1) (float x1))) xy;\n    let sum = Array.make (2 * n + 1) (0, 0) in\n    for i = 1 to 2 * n do\n        let (x, y) = sum.(i - 1) in\n        let (vx, vy) = xy.((i - 1) mod n) in\n        sum.(i) <- x + vx, y + vy\n    done;\n    let rec loop0 i acc =\n        let rec loop1 j acc =\n            if j = 2 * n + 1 || j >= i + n + 1 then loop0 (i + 1) acc else\n                let (x0, y0) = sum.(i) in\n                let (x1, y1) = sum.(j) in\n                let x = x1 - x0 in\n                let y = y1 - y0 in\n                let acc = max acc (x * x + y * y) in\n                loop1 (j + 1) acc\n        in\n        if i = 2 * n then float acc |> sqrt else loop1 (i + 1) acc\n    in\n    loop0 0 0 |> Printf.printf \"%.12f\\n\"\n)", "problem_context": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "sample_input": "3\n0 10\n5 -5\n-5 -5\n"}, "reference_outputs": ["10.000000000000000000000000000000000000000000000000\n"], "source_document_id": "p02926", "source_text": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 925, "cpu_time_ms": 9, "memory_kb": 4332}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s744367025", "group_id": "codeNet:p02928", "input_text": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\n\nmodule IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet sort_count cmp xs =\n  let rec rev_merge_count xs lxs ys invs acc k =\n    match xs, ys with\n    | _, [] -> k invs (List.rev_append xs acc)\n    | [], _ -> k invs (List.rev_append ys acc)\n    | x :: xs', y :: ys' ->\n        if cmp x y <= 0\n        then rev_merge_count xs' (lxs - 1) ys invs (x :: acc) k\n        else rev_merge_count xs lxs ys' (lxs + invs) (y :: acc) k in\n  let rec rev_merge_count_rev xs ys lys invs acc k =\n    match xs, ys with\n    | _, [] -> k invs (List.rev_append xs acc)\n    | [], _ -> k invs (List.rev_append ys acc)\n    | x :: xs', y :: ys' ->\n        if cmp x y > 0\n        then rev_merge_count_rev xs' ys lys (lys + invs) (x :: acc) k\n        else rev_merge_count_rev xs ys' (lys - 1) invs (y :: acc) k in\n  let rec sort_count invs n xs k =\n    match n, xs with\n    | 0, _ -> k xs invs []\n    | 1, x :: xs -> k xs invs [x]\n    | _, _ ->\n        sort_count_rev invs ((n + 1) lsr 1) xs @@ fun xs invs ys ->\n          sort_count_rev invs (n lsr 1) xs @@ fun xs invs zs ->\n            rev_merge_count_rev ys zs (n lsr 1) invs [] @@ k xs\n  and sort_count_rev invs n xs k =\n    match n, xs with\n    | 0, _ -> k xs invs []\n    | 1, x :: xs -> k xs invs [x]\n    | _, _ ->\n        sort_count invs (n lsr 1) xs @@ fun xs invs ys ->\n          sort_count invs ((n + 1) lsr 1) xs @@ fun xs invs zs ->\n            rev_merge_count ys (n lsr 1) zs invs [] @@ k xs in\n  sort_count 0 (List.length xs) xs @@ fun _ invs zs -> invs, zs\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  Printf.printf \"%d\\n\" @@\n  ( +^ ) (k *^ fst (sort_count compare (Array.to_list as_))) @@\n  ( *^ ) (k * (k - 1) / 2 mod m) @@\n  fst @@\n  IntMap.fold (fun _ n (acc, sum) -> (acc + n * sum, sum + n))\n    (Array.fold_left (fun m a ->\n      IntMap.add a (1 +\n        try IntMap.find a m\n        with Not_found -> 0) m) IntMap.empty as_) (0, 0)\n", "language": "OCaml", "metadata": {"date": 1589253069, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02928.html", "problem_id": "p02928", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02928/input.txt", "sample_output_relpath": "derived/input_output/data/p02928/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02928/OCaml/s744367025.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744367025", "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 IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet sort_count cmp xs =\n  let rec rev_merge_count xs lxs ys invs acc k =\n    match xs, ys with\n    | _, [] -> k invs (List.rev_append xs acc)\n    | [], _ -> k invs (List.rev_append ys acc)\n    | x :: xs', y :: ys' ->\n        if cmp x y <= 0\n        then rev_merge_count xs' (lxs - 1) ys invs (x :: acc) k\n        else rev_merge_count xs lxs ys' (lxs + invs) (y :: acc) k in\n  let rec rev_merge_count_rev xs ys lys invs acc k =\n    match xs, ys with\n    | _, [] -> k invs (List.rev_append xs acc)\n    | [], _ -> k invs (List.rev_append ys acc)\n    | x :: xs', y :: ys' ->\n        if cmp x y > 0\n        then rev_merge_count_rev xs' ys lys (lys + invs) (x :: acc) k\n        else rev_merge_count_rev xs ys' (lys - 1) invs (y :: acc) k in\n  let rec sort_count invs n xs k =\n    match n, xs with\n    | 0, _ -> k xs invs []\n    | 1, x :: xs -> k xs invs [x]\n    | _, _ ->\n        sort_count_rev invs ((n + 1) lsr 1) xs @@ fun xs invs ys ->\n          sort_count_rev invs (n lsr 1) xs @@ fun xs invs zs ->\n            rev_merge_count_rev ys zs (n lsr 1) invs [] @@ k xs\n  and sort_count_rev invs n xs k =\n    match n, xs with\n    | 0, _ -> k xs invs []\n    | 1, x :: xs -> k xs invs [x]\n    | _, _ ->\n        sort_count invs (n lsr 1) xs @@ fun xs invs ys ->\n          sort_count invs ((n + 1) lsr 1) xs @@ fun xs invs zs ->\n            rev_merge_count ys (n lsr 1) zs invs [] @@ k xs in\n  sort_count 0 (List.length xs) xs @@ fun _ invs zs -> invs, zs\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  Printf.printf \"%d\\n\" @@\n  ( +^ ) (k *^ fst (sort_count compare (Array.to_list as_))) @@\n  ( *^ ) (k * (k - 1) / 2 mod m) @@\n  fst @@\n  IntMap.fold (fun _ n (acc, sum) -> (acc + n * sum, sum + n))\n    (Array.fold_left (fun m a ->\n      IntMap.add a (1 +\n        try IntMap.find a m\n        with Not_found -> 0) m) IntMap.empty as_) (0, 0)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "sample_input": "2 2\n2 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02928", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2062, "cpu_time_ms": 4, "memory_kb": 4608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s597051947", "group_id": "codeNet:p02935", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let v = Array.init n (fun _ -> Scanf.scanf \" %f\" (fun v -> v)) in\n    Array.sort compare v;\n    let rec loop i cur =\n        if i = n then cur else\n            loop (i + 1) ((cur +. v.(i)) /. 2.)\n    in\n    loop 1 v.(0) |> Printf.printf \"%.6f\\n\"\n)", "language": "OCaml", "metadata": {"date": 1599537046, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s597051947.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s597051947", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let v = Array.init n (fun _ -> Scanf.scanf \" %f\" (fun v -> v)) in\n    Array.sort compare v;\n    let rec loop i cur =\n        if i = n then cur else\n            loop (i + 1) ((cur +. v.(i)) /. 2.)\n    in\n    loop 1 v.(0) |> Printf.printf \"%.6f\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "sample_input": "2\n3 4\n"}, "reference_outputs": ["3.5\n"], "source_document_id": "p02935", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 9, "memory_kb": 3956}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s222567864", "group_id": "codeNet:p02941", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let b = Array.make n 0 in \n    let rec loop i set =\n        if i = n then set else\n            let set = Scanf.scanf \" %d\" (fun k -> b.(i) <- k; S.add (k, i) set) in\n            loop (i + 1) set\n    in\n    let set = loop 0 S.empty in\n\n    let check set = S.for_all (fun (k, i) -> a.(i) = k) set in\n\n    let rec loop set c =\n        let (k, i) = S.max_elt set in\n        let set = S.remove (k, i) set in\n        let (k2 ,i2) = S.max_elt set in\n        let delta = b.((i - 1 + n) mod n) + b.((i + 1) mod n) in\n        let q = (k - k2 + delta) / delta in\n        let nb = b.(i) - q * delta in\n        if nb < a.(i) then (if check set then c + q - 1 else -1) else (\n            b.(i) <- nb;\n            loop (S.add (nb, i) set) (c + q)\n        )\n    in\n    loop set 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1588747718, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02941.html", "problem_id": "p02941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02941/input.txt", "sample_output_relpath": "derived/input_output/data/p02941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02941/OCaml/s222567864.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s222567864", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let b = Array.make n 0 in \n    let rec loop i set =\n        if i = n then set else\n            let set = Scanf.scanf \" %d\" (fun k -> b.(i) <- k; S.add (k, i) set) in\n            loop (i + 1) set\n    in\n    let set = loop 0 S.empty in\n\n    let check set = S.for_all (fun (k, i) -> a.(i) = k) set in\n\n    let rec loop set c =\n        let (k, i) = S.max_elt set in\n        let set = S.remove (k, i) set in\n        let (k2 ,i2) = S.max_elt set in\n        let delta = b.((i - 1 + n) mod n) + b.((i + 1) mod n) in\n        let q = (k - k2 + delta) / delta in\n        let nb = b.(i) - q * delta in\n        if nb < a.(i) then (if check set then c + q - 1 else -1) else (\n            b.(i) <- nb;\n            loop (S.add (nb, i) set) (c + q)\n        )\n    in\n    loop set 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere are N positive integers arranged in a circle.\n\nNow, the i-th number is A_i. Takahashi wants the i-th number to be B_i. For this objective, he will repeatedly perform the following operation:\n\nChoose an integer i such that 1 \\leq i \\leq N.\n\nLet a, b, c be the (i-1)-th, i-th, and (i+1)-th numbers, respectively. Replace the i-th number with a+b+c.\n\nHere the 0-th number is the N-th number, and the (N+1)-th number is the 1-st number.\n\nDetermine if Takahashi can achieve his objective.\nIf the answer is yes, find the minimum number of operations required.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the minimum number of operations required, or -1 if the objective cannot be achieved.\n\nSample Input 1\n\n3\n1 1 1\n13 5 7\n\nSample Output 1\n\n4\n\nTakahashi can achieve his objective by, for example, performing the following operations:\n\nReplace the second number with 3.\n\nReplace the second number with 5.\n\nReplace the third number with 7.\n\nReplace the first number with 13.\n\nSample Input 2\n\n4\n1 2 3 4\n2 3 4 5\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n5\n5 6 5 2 1\n9817 1108 6890 4343 8704\n\nSample Output 3\n\n25", "sample_input": "3\n1 1 1\n13 5 7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02941", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere are N positive integers arranged in a circle.\n\nNow, the i-th number is A_i. Takahashi wants the i-th number to be B_i. For this objective, he will repeatedly perform the following operation:\n\nChoose an integer i such that 1 \\leq i \\leq N.\n\nLet a, b, c be the (i-1)-th, i-th, and (i+1)-th numbers, respectively. Replace the i-th number with a+b+c.\n\nHere the 0-th number is the N-th number, and the (N+1)-th number is the 1-st number.\n\nDetermine if Takahashi can achieve his objective.\nIf the answer is yes, find the minimum number of operations required.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the minimum number of operations required, or -1 if the objective cannot be achieved.\n\nSample Input 1\n\n3\n1 1 1\n13 5 7\n\nSample Output 1\n\n4\n\nTakahashi can achieve his objective by, for example, performing the following operations:\n\nReplace the second number with 3.\n\nReplace the second number with 5.\n\nReplace the third number with 7.\n\nReplace the first number with 13.\n\nSample Input 2\n\n4\n1 2 3 4\n2 3 4 5\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n5\n5 6 5 2 1\n9817 1108 6890 4343 8704\n\nSample Output 3\n\n25", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 975, "cpu_time_ms": 2105, "memory_kb": 36368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s640860640", "group_id": "codeNet:p02945", "input_text": "let a_calc a b =\n  max (a + b) (max (a - b) (a * b))\n\nlet a, b = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\nlet () = Printf.printf \"%d\\n\" (a_calc a b)", "language": "OCaml", "metadata": {"date": 1595772045, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s640860640.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s640860640", "user_id": "u272377260"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "let a_calc a b =\n  max (a + b) (max (a - b) (a * b))\n\nlet a, b = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\nlet () = Printf.printf \"%d\\n\" (a_calc a b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 163, "cpu_time_ms": 10, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s295258486", "group_id": "codeNet:p02946", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun k x ->\n  let left = max (-1000000) (x - k + 1) in\n  let right = min 1000000 (x + k -1) in\n  Printf.printf \"%d\" left;\n  for i = (left + 1) to right do\n    Printf.printf \" %d\" i\n  done;", "language": "OCaml", "metadata": {"date": 1596610424, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02946/input.txt", "sample_output_relpath": "derived/input_output/data/p02946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02946/OCaml/s295258486.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s295258486", "user_id": "u052332717"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun k x ->\n  let left = max (-1000000) (x - k + 1) in\n  let right = min 1000000 (x + k -1) in\n  Printf.printf \"%d\" left;\n  for i = (left + 1) to right do\n    Printf.printf \" %d\" i\n  done;", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "sample_input": "3 7\n"}, "reference_outputs": ["5 6 7 8 9\n"], "source_document_id": "p02946", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 8, "memory_kb": 3792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s931348301", "group_id": "codeNet:p02946", "input_text": "let k, x = Scanf.sscanf (read_line()) \"%d %d\" (fun k x ->k,x)\nlet rec show i e =\n  if i > e then () else\n  (Printf.printf \"%d \" i; show (i+1) e)\n\nlet _ = show (x-k+1) (x+k-1); Printf.printf \"\\n\"", "language": "OCaml", "metadata": {"date": 1588517433, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02946/input.txt", "sample_output_relpath": "derived/input_output/data/p02946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02946/OCaml/s931348301.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931348301", "user_id": "u511870776"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "let k, x = Scanf.sscanf (read_line()) \"%d %d\" (fun k x ->k,x)\nlet rec show i e =\n  if i > e then () else\n  (Printf.printf \"%d \" i; show (i+1) e)\n\nlet _ = show (x-k+1) (x+k-1); Printf.printf \"\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "sample_input": "3 7\n"}, "reference_outputs": ["5 6 7 8 9\n"], "source_document_id": "p02946", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s537875404", "group_id": "codeNet:p02946", "input_text": "open Scanf\nopen Printf\n\nlet rint () = scanf \" %d\" (fun x -> x)\nlet stoa s = Array.init (String.length s) (String.get s)\nlet atos a = String.init (Array.length a) (Array.get a)\n\nlet () =\n  let k = rint () and x = rint () in\n  for i = -1000000 to 1000000 do\n    if i >= x - k + 1 && i <= x + k - 1 then\n      printf \"%d \" i\n  done;\n  printf \"\\n\"", "language": "OCaml", "metadata": {"date": 1565485413, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02946/input.txt", "sample_output_relpath": "derived/input_output/data/p02946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02946/OCaml/s537875404.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s537875404", "user_id": "u006493569"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet rint () = scanf \" %d\" (fun x -> x)\nlet stoa s = Array.init (String.length s) (String.get s)\nlet atos a = String.init (Array.length a) (Array.get a)\n\nlet () =\n  let k = rint () and x = rint () in\n  for i = -1000000 to 1000000 do\n    if i >= x - k + 1 && i <= x + k - 1 then\n      printf \"%d \" i\n  done;\n  printf \"\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "sample_input": "3 7\n"}, "reference_outputs": ["5 6 7 8 9\n"], "source_document_id": "p02946", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s838933250", "group_id": "codeNet:p02947", "input_text": "open Batteries\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet n = read_int ()\nlet dict = Array.init (n+1) @@ fun a -> 0\nlet rec get_basyo lst s i =\n  match lst with\n  | [] -> -1\n  | first :: rest -> if first = s then i else get_basyo rest s (i+1)\nlet rec loop lst i =\n  if i >= n then () else\n  let s = read_line () |> explode |> List.sort compare in\n  if List.mem s lst then (dict.(get_basyo lst s 0) <- dict.(get_basyo lst s 0) + 1; loop lst (i+1)) else\n  (dict.(List.length lst) <- 1; loop (List.append lst [s]) (i+1))\n\nlet rec answ i ans =\n  if dict.(i) = 0 then ans else\n  answ (i+1) (ans + (dict.(i) * (dict.(i)-1)))\n\nlet _ = loop [] 0; Printf.printf \"%d\\n\" @@ (answ 0 0) / 2", "language": "OCaml", "metadata": {"date": 1586959797, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/OCaml/s838933250.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s838933250", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet n = read_int ()\nlet dict = Array.init (n+1) @@ fun a -> 0\nlet rec get_basyo lst s i =\n  match lst with\n  | [] -> -1\n  | first :: rest -> if first = s then i else get_basyo rest s (i+1)\nlet rec loop lst i =\n  if i >= n then () else\n  let s = read_line () |> explode |> List.sort compare in\n  if List.mem s lst then (dict.(get_basyo lst s 0) <- dict.(get_basyo lst s 0) + 1; loop lst (i+1)) else\n  (dict.(List.length lst) <- 1; loop (List.append lst [s]) (i+1))\n\nlet rec answ i ans =\n  if dict.(i) = 0 then ans else\n  answ (i+1) (ans + (dict.(i) * (dict.(i)-1)))\n\nlet _ = loop [] 0; Printf.printf \"%d\\n\" @@ (answ 0 0) / 2", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 736, "cpu_time_ms": 2104, "memory_kb": 10404}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s861854295", "group_id": "codeNet:p02947", "input_text": "module StringMap = Map.Make (struct\n  type t = string\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ ->\n    Scanf.scanf \"%s\\n\" @@ fun s ->\n      let a = Array.init (String.length s) (String.get s) in\n      Array.sort compare a;\n      String.init (String.length s) (Array.get a) in\n  Printf.printf \"%d\\n\" @@\n  StringMap.fold (fun _ n acc -> acc + n * (n - 1) / 2)\n    (Array.fold_left (fun m s ->\n      StringMap.add s\n        (1 + try StringMap.find s m with Not_found -> 0) m)\n    StringMap.empty ss) 0\n\n\n", "language": "OCaml", "metadata": {"date": 1565487125, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/OCaml/s861854295.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861854295", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module StringMap = Map.Make (struct\n  type t = string\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ ->\n    Scanf.scanf \"%s\\n\" @@ fun s ->\n      let a = Array.init (String.length s) (String.get s) in\n      Array.sort compare a;\n      String.init (String.length s) (Array.get a) in\n  Printf.printf \"%d\\n\" @@\n  StringMap.fold (fun _ n acc -> acc + n * (n - 1) / 2)\n    (Array.fold_left (fun m s ->\n      StringMap.add s\n        (1 + try StringMap.find s m with Not_found -> 0) m)\n    StringMap.empty ss) 0\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 562, "cpu_time_ms": 381, "memory_kb": 17152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s749891470", "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, Empty            -> Empty\n    | Node(_, _, _, _), 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, q2, merge l1 r1)\n    | _, _ -> failwith \"merge\"\n\nlet pop q =\n    match q with\n    | Empty -> failwith \"pop\"\n    | Node(_, _, l, r) -> merge l r\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 + 2, 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": 1565668777, "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/s749891470.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749891470", "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, Empty            -> Empty\n    | Node(_, _, _, _), 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, q2, merge l1 r1)\n    | _, _ -> failwith \"merge\"\n\nlet pop q =\n    match q with\n    | Empty -> failwith \"pop\"\n    | Node(_, _, l, r) -> merge l r\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 + 2, 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1847, "cpu_time_ms": 364, "memory_kb": 21760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s601221266", "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 + 2, large, push small l, 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": 1565648370, "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/s601221266.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s601221266", "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 + 2, large, push small l, 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2070, "cpu_time_ms": 2104, "memory_kb": 20648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s935555759", "group_id": "codeNet:p02951", "input_text": "let _ = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c ->\n  match c - (a - b) with\n  | x when x <= 0 -> print_endline \"0\"\n  | x -> print_endline (string_of_int x)\n)", "language": "OCaml", "metadata": {"date": 1583931219, "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/s935555759.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s935555759", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c ->\n  match c - (a - b) 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\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "sample_input": "6 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02951", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s971347168", "group_id": "codeNet:p02951", "input_text": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ c - min c (a - b)", "language": "OCaml", "metadata": {"date": 1564998406, "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/s971347168.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s971347168", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ c - min c (a - b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "sample_input": "6 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02951", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s040707297", "group_id": "codeNet:p02957", "input_text": "let () = Scanf.sscanf (read_line()) \"%d %d\" (\n  fun a b ->\n    if a mod 2 = b mod 2\n      then print_int ((a + b) / 2)\n    else print_string \"IMPOSSIBLE\\n\"\n); print_string \"\\n\";;\n", "language": "OCaml", "metadata": {"date": 1564415873, "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/s040707297.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s040707297", "user_id": "u494514222"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let () = Scanf.sscanf (read_line()) \"%d %d\" (\n  fun a b ->\n    if a mod 2 = b mod 2\n      then print_int ((a + b) / 2)\n    else print_string \"IMPOSSIBLE\\n\"\n); print_string \"\\n\";;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s985288820", "group_id": "codeNet:p02957", "input_text": "let answer a b =\n  let sa = a - b in\n    if (sa mod 2) = 1 then\n      \"IMPOSSIBLE\"\n    else\n      if sa < 0 then\n        sa / 2 * (-1) |> string_of_int\n      else\n        sa / 2 |> string_of_int\n\n\nlet () = Scanf.scanf \"%d %d\" (fun a b -> print_endline (answer a b))\n", "language": "OCaml", "metadata": {"date": 1564277816, "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/s985288820.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s985288820", "user_id": "u950428333"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let answer a b =\n  let sa = a - b in\n    if (sa mod 2) = 1 then\n      \"IMPOSSIBLE\"\n    else\n      if sa < 0 then\n        sa / 2 * (-1) |> string_of_int\n      else\n        sa / 2 |> string_of_int\n\n\nlet () = Scanf.scanf \"%d %d\" (fun a b -> print_endline (answer a b))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s482705787", "group_id": "codeNet:p02958", "input_text": "open Batteries\nlet n = read_int ()\nlet p = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\n\nlet rec loop i ans =\n  if i >= n then ans else\n  if p.(i) != i+1 then loop (i+1) ans+1 else loop (i+1) ans\n\nlet _ = (if loop 0 0 > 2 then \"NO\" else \"YES\") |> print_endline\n", "language": "OCaml", "metadata": {"date": 1588518090, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s482705787.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482705787", "user_id": "u511870776"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Batteries\nlet n = read_int ()\nlet p = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\n\nlet rec loop i ans =\n  if i >= n then ans else\n  if p.(i) != i+1 then loop (i+1) ans+1 else loop (i+1) ans\n\nlet _ = (if loop 0 0 > 2 then \"NO\" else \"YES\") |> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s683193463", "group_id": "codeNet:p02958", "input_text": "let c, n = ref 0, Scanf.scanf \" %d\" (+) 0\nlet _ = for i = 1 to n do Scanf.scanf \" %d\" @@ fun p -> if i <> p then incr c done; print_endline @@ if !c <= 2 then \"YES\" else \"NO\"", "language": "OCaml", "metadata": {"date": 1573008601, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s683193463.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683193463", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let c, n = ref 0, Scanf.scanf \" %d\" (+) 0\nlet _ = for i = 1 to n do Scanf.scanf \" %d\" @@ fun p -> if i <> p then incr c done; print_endline @@ if !c <= 2 then \"YES\" else \"NO\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "sample_input": "5\n5 2 3 4 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02958", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s344340852", "group_id": "codeNet:p02962", "input_text": "let readString () = Scanf.scanf \" %s\" (fun s -> s)\n\nlet borders s =\n  let n = String.length s in\n  let b = Array.make (n+1) (-1) in\n  for i=0 to n-1 do\n    let j = ref b.(i) in\n    while !j >= 0 && s.[!j] <> s.[i] do\n      j := b.(!j)\n    done;\n    b.(i+1) <- !j+1\n  done;\n  b\n\ntype result = [`Unknown | `Cycle | `Length of int]\ntype knownResult = [`Cycle | `Length of int]\n\nlet rec compare (a: result) (b: result) =\n  match (a, b) with\n  | (`Unknown, `Unknown) -> 0\n  | (`Cycle, `Cycle) -> 0\n  | (`Length x, `Length y) -> Pervasives.compare x y\n  | (`Unknown, _) -> -1\n  | (`Cycle, _) -> 1\n  | _ -> -(compare b a)\n\nlet solve s t : knownResult =\n  let n = String.length s in\n  let m = String.length t in\n  let b = borders t in\n  let yes = Array.make n false in\n  let j = ref 0 in\n  for i=0 to n+m-2 do\n    while !j >= 0 && (!j >= m || t.[!j] <> s.[i mod n]) do\n      j := b.(!j)\n    done;\n    incr j;\n    if !j = m then yes.(i+1-m) <- true\n  done;\n  let plen: result array = Array.make n `Unknown in\n  let rec calc ?(start = None) i : knownResult =\n    let i0 = match start with None -> i | Some i0 -> i0 in\n    match plen.(i) with\n    | `Unknown ->\n        begin\n          let ans =\n            if start <> None && i = i0 then `Cycle\n            else if not yes.(i) then `Length 0\n            else\n              match calc ~start:(Some i0) ((i + m) mod n) with\n              | `Cycle -> `Cycle\n              | `Length x -> `Length (1 + x)\n          in\n          plen.(i) <- ans;\n          ans\n        end\n    | `Cycle -> `Cycle\n    | `Length x -> `Length x\n  in\n  let res: knownResult ref = ref (`Length 0) in\n  for i=0 to n-1 do\n    let x = calc i in\n    if compare (!res :> result) (x :> result) < 0 then res := x\n  done;\n  match !res with\n  | `Cycle -> `Cycle\n  | `Length x -> `Length x\n\nlet main () =\n  let s = readString () in\n  let t = readString () in\n  Printf.printf \"%d\\n\" (match solve s t with `Cycle -> -1 | `Length x -> x)\n\nlet () = main ()\n", "language": "OCaml", "metadata": {"date": 1564384522, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02962.html", "problem_id": "p02962", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02962/input.txt", "sample_output_relpath": "derived/input_output/data/p02962/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02962/OCaml/s344340852.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s344340852", "user_id": "u310083442"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let readString () = Scanf.scanf \" %s\" (fun s -> s)\n\nlet borders s =\n  let n = String.length s in\n  let b = Array.make (n+1) (-1) in\n  for i=0 to n-1 do\n    let j = ref b.(i) in\n    while !j >= 0 && s.[!j] <> s.[i] do\n      j := b.(!j)\n    done;\n    b.(i+1) <- !j+1\n  done;\n  b\n\ntype result = [`Unknown | `Cycle | `Length of int]\ntype knownResult = [`Cycle | `Length of int]\n\nlet rec compare (a: result) (b: result) =\n  match (a, b) with\n  | (`Unknown, `Unknown) -> 0\n  | (`Cycle, `Cycle) -> 0\n  | (`Length x, `Length y) -> Pervasives.compare x y\n  | (`Unknown, _) -> -1\n  | (`Cycle, _) -> 1\n  | _ -> -(compare b a)\n\nlet solve s t : knownResult =\n  let n = String.length s in\n  let m = String.length t in\n  let b = borders t in\n  let yes = Array.make n false in\n  let j = ref 0 in\n  for i=0 to n+m-2 do\n    while !j >= 0 && (!j >= m || t.[!j] <> s.[i mod n]) do\n      j := b.(!j)\n    done;\n    incr j;\n    if !j = m then yes.(i+1-m) <- true\n  done;\n  let plen: result array = Array.make n `Unknown in\n  let rec calc ?(start = None) i : knownResult =\n    let i0 = match start with None -> i | Some i0 -> i0 in\n    match plen.(i) with\n    | `Unknown ->\n        begin\n          let ans =\n            if start <> None && i = i0 then `Cycle\n            else if not yes.(i) then `Length 0\n            else\n              match calc ~start:(Some i0) ((i + m) mod n) with\n              | `Cycle -> `Cycle\n              | `Length x -> `Length (1 + x)\n          in\n          plen.(i) <- ans;\n          ans\n        end\n    | `Cycle -> `Cycle\n    | `Length x -> `Length x\n  in\n  let res: knownResult ref = ref (`Length 0) in\n  for i=0 to n-1 do\n    let x = calc i in\n    if compare (!res :> result) (x :> result) < 0 then res := x\n  done;\n  match !res with\n  | `Cycle -> `Cycle\n  | `Length x -> `Length x\n\nlet main () =\n  let s = readString () in\n  let t = readString () in\n  Printf.printf \"%d\\n\" (match solve s t with `Cycle -> -1 | `Length x -> x)\n\nlet () = main ()\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if the number of non-negative integers i satisfying the following condition is finite, and find the maximum value of such i if the number is finite.\n\nThere exists a non-negative integer j such that the concatenation of i copies of t is a substring of the concatenation of j copies of s.\n\nNotes\n\nA string a is a substring of another string b if and only if there exists an integer x (0 \\leq x \\leq |b| - |a|) such that, for any y (1 \\leq y \\leq |a|), a_y = b_{x+y} holds.\n\nWe assume that the concatenation of zero copies of any string is the empty string. From the definition above, the empty string is a substring of any string. Thus, for any two strings s and t, i = 0 satisfies the condition in the problem statement.\n\nConstraints\n\n1 \\leq |s| \\leq 5 \\times 10^5\n\n1 \\leq |t| \\leq 5 \\times 10^5\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 the number of non-negative integers i satisfying the following condition is finite, print the maximum value of such i; if the number is infinite, print -1.\n\nSample Input 1\n\nabcabab\nab\n\nSample Output 1\n\n3\n\nThe concatenation of three copies of t, ababab, is a substring of the concatenation of two copies of s, abcabababcabab, so i = 3 satisfies the condition.\n\nOn the other hand, the concatenation of four copies of t, abababab, is not a substring of the concatenation of any number of copies of s, so i = 4 does not satisfy the condition.\n\nSimilarly, any integer greater than 4 does not satisfy the condition, either. Thus, the number of non-negative integers i satisfying the condition is finite, and the maximum value of such i is 3.\n\nSample Input 2\n\naa\naaaaaaa\n\nSample Output 2\n\n-1\n\nFor any non-negative integer i, the concatenation of i copies of t is a substring of the concatenation of 4i copies of s. Thus, there are infinitely many non-negative integers i that satisfy the condition.\n\nSample Input 3\n\naba\nbaaab\n\nSample Output 3\n\n0\n\nAs stated in Notes, i = 0 always satisfies the condition.", "sample_input": "abcabab\nab\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02962", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if the number of non-negative integers i satisfying the following condition is finite, and find the maximum value of such i if the number is finite.\n\nThere exists a non-negative integer j such that the concatenation of i copies of t is a substring of the concatenation of j copies of s.\n\nNotes\n\nA string a is a substring of another string b if and only if there exists an integer x (0 \\leq x \\leq |b| - |a|) such that, for any y (1 \\leq y \\leq |a|), a_y = b_{x+y} holds.\n\nWe assume that the concatenation of zero copies of any string is the empty string. From the definition above, the empty string is a substring of any string. Thus, for any two strings s and t, i = 0 satisfies the condition in the problem statement.\n\nConstraints\n\n1 \\leq |s| \\leq 5 \\times 10^5\n\n1 \\leq |t| \\leq 5 \\times 10^5\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 the number of non-negative integers i satisfying the following condition is finite, print the maximum value of such i; if the number is infinite, print -1.\n\nSample Input 1\n\nabcabab\nab\n\nSample Output 1\n\n3\n\nThe concatenation of three copies of t, ababab, is a substring of the concatenation of two copies of s, abcabababcabab, so i = 3 satisfies the condition.\n\nOn the other hand, the concatenation of four copies of t, abababab, is not a substring of the concatenation of any number of copies of s, so i = 4 does not satisfy the condition.\n\nSimilarly, any integer greater than 4 does not satisfy the condition, either. Thus, the number of non-negative integers i satisfying the condition is finite, and the maximum value of such i is 3.\n\nSample Input 2\n\naa\naaaaaaa\n\nSample Output 2\n\n-1\n\nFor any non-negative integer i, the concatenation of i copies of t is a substring of the concatenation of 4i copies of s. Thus, there are infinitely many non-negative integers i that satisfy the condition.\n\nSample Input 3\n\naba\nbaaab\n\nSample Output 3\n\n0\n\nAs stated in Notes, i = 0 always satisfies the condition.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1954, "cpu_time_ms": 118, "memory_kb": 39936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s183388947", "group_id": "codeNet:p02970", "input_text": "let answer a b =\n  let n = a / (b * 2 + 1) in\n    n\n\nlet () = Scanf.scanf \"%d %d\" (fun a b -> print_endline (string_of_int (answer a b)))\n", "language": "OCaml", "metadata": {"date": 1563837223, "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/s183388947.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s183388947", "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    n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s116561373", "group_id": "codeNet:p02970", "input_text": "let () =\n    let main () =\n        let n, d = Scanf.sscanf (read_line ()) \"%d %d\" (fun n d -> n, d) in\n        let c = 2 * d + 1 in\n        Printf.printf \"%d\\n\" ((n + c - 1) / c)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1563671017, "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/s116561373.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116561373", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n    let main () =\n        let n, d = Scanf.sscanf (read_line ()) \"%d %d\" (fun n d -> n, d) in\n        let c = 2 * d + 1 in\n        Printf.printf \"%d\\n\" ((n + c - 1) / c)\n    in\n    main ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 197, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s151212550", "group_id": "codeNet:p02972", "input_text": "let n = read_int ()\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet bs = Array.make n 0\nlet _ = for k = n downto 1 do let s, i = ref 0, ref 2 in while !i * k <= n do s := !s + bs.(!i * k - 1); incr i done; bs.(k - 1) <- if !s mod 2 = a_s.(k - 1) mod 2 then 0 else 1 done; Array.(Printf.printf \"%d\\n\" @@ fold_left (+) 0 bs; iteri (fun i b -> if b = 1 then Printf.printf \"%d \" (i + 1)) bs)", "language": "OCaml", "metadata": {"date": 1582948147, "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/s151212550.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151212550", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "let n = read_int ()\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet bs = Array.make n 0\nlet _ = for k = n downto 1 do let s, i = ref 0, ref 2 in while !i * k <= n do s := !s + bs.(!i * k - 1); incr i done; bs.(k - 1) <- if !s mod 2 = a_s.(k - 1) mod 2 then 0 else 1 done; Array.(Printf.printf \"%d\\n\" @@ fold_left (+) 0 bs; iteri (fun i b -> if b = 1 then Printf.printf \"%d \" (i + 1)) bs)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 73, "memory_kb": 6912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s281355929", "group_id": "codeNet:p02977", "input_text": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        if n <> 1 && n mod 2 = 1 then (\n            print_endline \"Yes\";\n            for i = 1 to (n - 1) / 2 do\n                Printf.printf \"%d %d\\n\" 1 (2 * i);\n                Printf.printf \"%d %d\\n\" (2 * i) (2 * i + 1);\n                Printf.printf \"%d %d\\n\" 1 (2 * i + 1 + n);\n                Printf.printf \"%d %d\\n\" (2 * i + n) (2 * i + 1 + n);\n            done;\n            Printf.printf \"%d %d\\n\" 3 (n + 1)\n        ) else print_endline \"No\"\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1563159441, "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/s281355929.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s281355929", "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 mod 2 = 1 then (\n            print_endline \"Yes\";\n            for i = 1 to (n - 1) / 2 do\n                Printf.printf \"%d %d\\n\" 1 (2 * i);\n                Printf.printf \"%d %d\\n\" (2 * i) (2 * i + 1);\n                Printf.printf \"%d %d\\n\" 1 (2 * i + 1 + n);\n                Printf.printf \"%d %d\\n\" (2 * i + n) (2 * i + 1 + n);\n            done;\n            Printf.printf \"%d %d\\n\" 3 (n + 1)\n        ) else print_endline \"No\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 83, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s317277889", "group_id": "codeNet:p02981", "input_text": "Scanf.sscanf (read_line ()) \"%d %d %d\" (fun n a b ->\n    Printf.printf \"%d\\n\" (min b (a * n)))", "language": "OCaml", "metadata": {"date": 1562547690, "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/s317277889.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317277889", "user_id": "u342443598"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d %d %d\" (fun n a b ->\n    Printf.printf \"%d\\n\" (min b (a * 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s627226594", "group_id": "codeNet:p02982", "input_text": "let is_integer xs ys =\n  let dim = Array.length xs in\n  let sq_dist = Array.fold_left ( + ) 0 @@\n    Array.init dim @@ fun i -> (xs.(i) - ys.(i)) * (xs.(i) - ys.(i)) in\n  let check = Array.exists (fun d -> d * d = sq_dist) (Array.init 160 @@ fun i -> (i + 1)) in\n  if check then 1 else 0\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n d ->\n  let points =\n    Array.init n @@ fun _ ->\n      Array.init d @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let check_boxes =\n    Array.init (n - 1) @@ fun i ->\n      Array.init (n - 1 - i) @@ fun j -> is_integer points.(i) points.(i + j + 1) in\n  let ans = \n    Array.fold_left (Array.fold_left ( + )) 0 check_boxes in\n  Printf.printf \"%d\\n\" ans \n\n\n(*\n  Array.fold_left: ('a -> 'b -> 'a) -> 'a -> 'b array -> 'a\n  1つ目の fold_left は (int -> int array -> int) -> int -> int array array -> int\n  2つ目の fold_left は ( + ) を渡しているので ('a -> 'a array -> 'a) になる\n  ここで期待するのは int -> int list -> int\n*)\n\n", "language": "OCaml", "metadata": {"date": 1597256410, "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/s627226594.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s627226594", "user_id": "u052332717"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let is_integer xs ys =\n  let dim = Array.length xs in\n  let sq_dist = Array.fold_left ( + ) 0 @@\n    Array.init dim @@ fun i -> (xs.(i) - ys.(i)) * (xs.(i) - ys.(i)) in\n  let check = Array.exists (fun d -> d * d = sq_dist) (Array.init 160 @@ fun i -> (i + 1)) in\n  if check then 1 else 0\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n d ->\n  let points =\n    Array.init n @@ fun _ ->\n      Array.init d @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let check_boxes =\n    Array.init (n - 1) @@ fun i ->\n      Array.init (n - 1 - i) @@ fun j -> is_integer points.(i) points.(i + j + 1) in\n  let ans = \n    Array.fold_left (Array.fold_left ( + )) 0 check_boxes in\n  Printf.printf \"%d\\n\" ans \n\n\n(*\n  Array.fold_left: ('a -> 'b -> 'a) -> 'a -> 'b array -> 'a\n  1つ目の fold_left は (int -> int array -> int) -> int -> int array array -> int\n  2つ目の fold_left は ( + ) を渡しているので ('a -> 'a array -> 'a) になる\n  ここで期待するのは int -> int list -> int\n*)\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 978, "cpu_time_ms": 3, "memory_kb": 3928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s434894431", "group_id": "codeNet:p02982", "input_text": "let is_integer xs ys =\n  let dim = Array.length xs in\n  let sq_dist = Array.fold_left ( + ) 0 @@\n    Array.init dim @@ fun i -> (xs.(i) - ys.(i)) * (xs.(i) - ys.(i)) in\n  let check = Array.exists (fun d -> d * d = sq_dist) (Array.init 44 @@ fun i -> (i + 1)) in\n  if check then 1 else 0\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n d ->\n  let points =\n    Array.init n @@ fun _ ->\n      Array.init d @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let check_boxes =\n    Array.init (n - 1) @@ fun i ->\n      Array.init (n - 1 - i) @@ fun j -> is_integer points.(i) points.(i + j) in\n  let ans = \n    Array.fold_left (Array.fold_left ( + )) 0 check_boxes in\n  Printf.printf \"%d\\n\" ans \n\n\n(*\n  Array.fold_left: ('a -> 'b -> 'a) -> 'a -> 'b array -> 'a\n  1つ目の fold_left は (int -> int array -> int) -> int -> int array array -> int\n  2つ目の fold_left は ( + ) を渡しているので ('a -> 'a array -> 'a) になる\n  ここで期待するのは int -> int list -> int\n*)\n\n", "language": "OCaml", "metadata": {"date": 1597255874, "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/s434894431.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s434894431", "user_id": "u052332717"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let is_integer xs ys =\n  let dim = Array.length xs in\n  let sq_dist = Array.fold_left ( + ) 0 @@\n    Array.init dim @@ fun i -> (xs.(i) - ys.(i)) * (xs.(i) - ys.(i)) in\n  let check = Array.exists (fun d -> d * d = sq_dist) (Array.init 44 @@ fun i -> (i + 1)) in\n  if check then 1 else 0\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n d ->\n  let points =\n    Array.init n @@ fun _ ->\n      Array.init d @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let check_boxes =\n    Array.init (n - 1) @@ fun i ->\n      Array.init (n - 1 - i) @@ fun j -> is_integer points.(i) points.(i + j) in\n  let ans = \n    Array.fold_left (Array.fold_left ( + )) 0 check_boxes in\n  Printf.printf \"%d\\n\" ans \n\n\n(*\n  Array.fold_left: ('a -> 'b -> 'a) -> 'a -> 'b array -> 'a\n  1つ目の fold_left は (int -> int array -> int) -> int -> int array array -> int\n  2つ目の fold_left は ( + ) を渡しているので ('a -> 'a array -> 'a) になる\n  ここで期待するのは int -> int list -> int\n*)\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 973, "cpu_time_ms": 10, "memory_kb": 3832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s405763608", "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 n i = if i * i >= n then i * i = n else f n (i + 1)\nlet g a b = let s = ref 0 in Array.iteri (fun i x -> s := !s + (x - b.(i)) * (x - b.(i))) a; !s\nlet _ = for i = 0 to n - 1 do for j = i + 1 to n - 1 do if f (g xss.(i) xss.(j)) 0 then incr ans done done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1582345466, "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/s405763608.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405763608", "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 n i = if i * i >= n then i * i = n else f n (i + 1)\nlet g a b = let s = ref 0 in Array.iteri (fun i x -> s := !s + (x - b.(i)) * (x - b.(i))) a; !s\nlet _ = for i = 0 to n - 1 do for j = i + 1 to n - 1 do if f (g xss.(i) xss.(j)) 0 then incr ans done done; 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s005438066", "group_id": "codeNet:p02984", "input_text": "let rec fix f x = f (fix f) x\nlet ans =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let w0 =\n    (0, min a.(0) a.(n-1) + 1) |> fix (fun f (l, r) ->\n      if l+1 >= r then l else\n        let m = (l+r) / 2 in\n        let w = Array.fold_left (fun w h -> h - w) m a in\n        if w < m then f (l, m) else f (m, r))\n  in\n  let wn, h' = Array.fold_left (fun (w, acc) h -> (h-w, (2*w)::acc)) (w0, []) a in\n  List.rev h' |> List.iter (Printf.printf \"%d \");\n  print_newline ()\n ", "language": "OCaml", "metadata": {"date": 1575428373, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02984.html", "problem_id": "p02984", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02984/input.txt", "sample_output_relpath": "derived/input_output/data/p02984/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02984/OCaml/s005438066.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s005438066", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "let rec fix f x = f (fix f) x\nlet ans =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let w0 =\n    (0, min a.(0) a.(n-1) + 1) |> fix (fun f (l, r) ->\n      if l+1 >= r then l else\n        let m = (l+r) / 2 in\n        let w = Array.fold_left (fun w h -> h - w) m a in\n        if w < m then f (l, m) else f (m, r))\n  in\n  let wn, h' = Array.fold_left (fun (w, acc) h -> (h-w, (2*w)::acc)) (w0, []) a in\n  List.rev h' |> List.iter (Printf.printf \"%d \");\n  print_newline ()\n ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "sample_input": "3\n2 2 4\n"}, "reference_outputs": ["4 0 4\n"], "source_document_id": "p02984", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 521, "cpu_time_ms": 72, "memory_kb": 8832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s047811060", "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        (up (max 0 (depth.(u) - depth.(v))) u)\n        (up (max 0 (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", "language": "OCaml", "metadata": {"date": 1562555659, "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/s047811060.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s047811060", "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        (up (max 0 (depth.(u) - depth.(v))) u)\n        (up (max 0 (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", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "sample_input": "5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n"}, "reference_outputs": ["130\n200\n60\n"], "source_document_id": "p02986", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2421, "cpu_time_ms": 1298, "memory_kb": 117880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s650191056", "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 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 u v =\n    if 0 <= dist.(v) then ()\n    else begin\n      dist.(v) <- d;\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') v u) es.(v)\n    end in\n  visit IntMap.empty IntMap.empty 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 lca u v = function\n    | 0 ->\n        if u = v then u\n        else 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  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) 16 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": 1562554554, "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/s650191056.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650191056", "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 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 u v =\n    if 0 <= dist.(v) then ()\n    else begin\n      dist.(v) <- d;\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') v u) es.(v)\n    end in\n  visit IntMap.empty IntMap.empty 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 lca u v = function\n    | 0 ->\n        if u = v then u\n        else 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  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) 16 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2083, "cpu_time_ms": 1074, "memory_kb": 116608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s899562737", "group_id": "codeNet:p02987", "input_text": "open Batteries\nlet explode s = List.init (String.length s) (String.get s)\nlet s = read_line () |> explode\n\nlet get_all_elements l =\n  let rec get existed lst =\n    match lst with\n     [] -> existed\n    | first :: rest -> if List.exists (fun a -> a = first) existed then get existed rest \n                       else get (first :: existed) rest\n  in get [] l\n\nlet ans l =\n  let rec p lst =\n    match lst with\n    | [] -> true\n    | first :: rest -> if List.length (List.find_all (fun a -> a = first) s) = 2 then p rest else false\n  in p l\n\nlet all = get_all_elements s\nlet _ = if List.length all != 2 then print_endline \"No\"\n        else if ans all then print_endline \"Yes\" else print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1583932843, "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/s899562737.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899562737", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nlet explode s = List.init (String.length s) (String.get s)\nlet s = read_line () |> explode\n\nlet get_all_elements l =\n  let rec get existed lst =\n    match lst with\n     [] -> existed\n    | first :: rest -> if List.exists (fun a -> a = first) existed then get existed rest \n                       else get (first :: existed) rest\n  in get [] l\n\nlet ans l =\n  let rec p lst =\n    match lst with\n    | [] -> true\n    | first :: rest -> if List.length (List.find_all (fun a -> a = first) s) = 2 then p rest else false\n  in p l\n\nlet all = get_all_elements s\nlet _ = if List.length all != 2 then print_endline \"No\"\n        else if ans all then print_endline \"Yes\" else print_endline \"No\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 697, "cpu_time_ms": 3, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s038082258", "group_id": "codeNet:p02987", "input_text": "open Printf\nopen Scanf\n\nlet solve s =\n  let l = List.sort compare @@ List.map (fun i -> String.get s i) [0;1;2;3] in\n  match l with\n    a::b::c::d::_ when a = b && c = d && b <> c -> \"Yes\"\n  | _ -> \"No\"\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582407784, "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/s038082258.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038082258", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s =\n  let l = List.sort compare @@ List.map (fun i -> String.get s i) [0;1;2;3] in\n  match l with\n    a::b::c::d::_ when a = b && c = d && b <> c -> \"Yes\"\n  | _ -> \"No\"\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s165822030", "group_id": "codeNet:p02987", "input_text": "let inp : unit -> string = fun () -> \n  input_line stdin\n\n  \nlet () =\n  let s = inp () in\n  let rec count n l =\n    if n = 4 then\n      l\n    else\n      if List.mem s.[n] l then\n        count (n + 1) l\n      else\n        count (n + 1) (s.[n] :: l)\n  in\n  let c = List.length (count 0 []) in\n  let n =\n    let rec f n m =\n          if n = 4 then\n            m\n          else\n            if s.[n] = s.[0] then\n              f (n + 1) (m + 1)\n            else\n              f (n + 1) m in\n    f 0 0\n  in\n  if c = 2 && n = 2 then\n    print_endline \"Yes\"\n  else\n    print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1561857173, "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/s165822030.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s165822030", "user_id": "u977566741"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let inp : unit -> string = fun () -> \n  input_line stdin\n\n  \nlet () =\n  let s = inp () in\n  let rec count n l =\n    if n = 4 then\n      l\n    else\n      if List.mem s.[n] l then\n        count (n + 1) l\n      else\n        count (n + 1) (s.[n] :: l)\n  in\n  let c = List.length (count 0 []) in\n  let n =\n    let rec f n m =\n          if n = 4 then\n            m\n          else\n            if s.[n] = s.[0] then\n              f (n + 1) (m + 1)\n            else\n              f (n + 1) m in\n    f 0 0\n  in\n  if c = 2 && n = 2 then\n    print_endline \"Yes\"\n  else\n    print_endline \"No\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 580, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s469778595", "group_id": "codeNet:p02988", "input_text": "let ans, n = ref 0, Scanf.scanf \" %d\" (+) 0\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = for i = 1 to n - 2 do if ps.(i - 1) < ps.(i) && ps.(i) < ps.(i + 1) || ps.(i - 1) > ps.(i) && ps.(i) > ps.(i + 1) then incr ans done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1573445182, "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/s469778595.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s469778595", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let ans, n = ref 0, Scanf.scanf \" %d\" (+) 0\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = for i = 1 to n - 2 do if ps.(i - 1) < ps.(i) && ps.(i) < ps.(i + 1) || ps.(i - 1) > ps.(i) && ps.(i) > ps.(i + 1) then incr ans done; 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 269, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s325072852", "group_id": "codeNet:p02989", "input_text": "open Batteries\n\nlet read_two () = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\n\nlet read_three () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> (a, b, c))\n\nlet read_four () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c d -> (a, b, c, d))\n\nlet read_list () =\n  read_line () |> String.split_on_char ' '\n  |> List.map (fun s -> int_of_string s)\n\n(* a**x *)\nlet pow a x =\n  let rec aux acc = function 0 -> acc | n -> aux (acc * a) (n - 1) in\n  aux 1 x\n\nlet rec pow2 n = if n mod 2 = 0 then 1 + pow2 (n / 2) else 0\n\nlet rec f n = function\n  | d1 :: d2 :: rest -> if n = 1 then (d1, d2) else f (n - 2) rest\n  | _ -> (0, 0)\n\nlet () =\n  let n = read_int () in\n  let d = read_list () |> List.sort compare in\n  let a, b = f (n / 2) d in\n  print_int (b - a);\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1587162156, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/OCaml/s325072852.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s325072852", "user_id": "u395620499"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\n\nlet read_two () = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\n\nlet read_three () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> (a, b, c))\n\nlet read_four () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c d -> (a, b, c, d))\n\nlet read_list () =\n  read_line () |> String.split_on_char ' '\n  |> List.map (fun s -> int_of_string s)\n\n(* a**x *)\nlet pow a x =\n  let rec aux acc = function 0 -> acc | n -> aux (acc * a) (n - 1) in\n  aux 1 x\n\nlet rec pow2 n = if n mod 2 = 0 then 1 + pow2 (n / 2) else 0\n\nlet rec f n = function\n  | d1 :: d2 :: rest -> if n = 1 then (d1, d2) else f (n - 2) rest\n  | _ -> (0, 0)\n\nlet () =\n  let n = read_int () in\n  let d = read_list () |> List.sort compare in\n  let a, b = f (n / 2) d in\n  print_int (b - a);\n  print_newline ()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 797, "cpu_time_ms": 72, "memory_kb": 11520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s749198944", "group_id": "codeNet:p02989", "input_text": "open Batteries\n\nlet read_two () = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\n\nlet read_three () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> (a, b, c))\n\nlet read_four () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c d -> (a, b, c, d))\n\nlet read_list () =\n  read_line () |> String.split_on_char ' '\n  |> List.map (fun s -> int_of_string s)\n\n(* a**x *)\nlet pow a x =\n  let rec aux acc = function 0 -> acc | n -> aux (acc * a) (n - 1) in\n  aux 1 x\n\nlet rec pow2 n = if n mod 2 = 0 then 1 + pow2 (n / 2) else 0\n\nlet rec f n = function\n  | d1 :: d2 :: rest -> if n = 1 then (d1, d2) else f (n - 2) rest\n  | _ -> invalid_arg \"list smaller than n/2\"\n\nlet () =\n  let n = read_int () in\n  let d = read_list () |> List.sort compare in\n  let a, b = f (n / 2) d in\n  print_int (b - a);\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1587162014, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/OCaml/s749198944.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s749198944", "user_id": "u395620499"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\n\nlet read_two () = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\n\nlet read_three () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> (a, b, c))\n\nlet read_four () =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c d -> (a, b, c, d))\n\nlet read_list () =\n  read_line () |> String.split_on_char ' '\n  |> List.map (fun s -> int_of_string s)\n\n(* a**x *)\nlet pow a x =\n  let rec aux acc = function 0 -> acc | n -> aux (acc * a) (n - 1) in\n  aux 1 x\n\nlet rec pow2 n = if n mod 2 = 0 then 1 + pow2 (n / 2) else 0\n\nlet rec f n = function\n  | d1 :: d2 :: rest -> if n = 1 then (d1, d2) else f (n - 2) rest\n  | _ -> invalid_arg \"list smaller than n/2\"\n\nlet () =\n  let n = read_int () in\n  let d = read_list () |> List.sort compare in\n  let a, b = f (n / 2) d in\n  print_int (b - a);\n  print_newline ()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 826, "cpu_time_ms": 72, "memory_kb": 11520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s009637901", "group_id": "codeNet:p02989", "input_text": "let () =\n  Printf.printf \"%d\\n\" @@\n  Scanf.scanf \"%d\" @@ fun n ->\n  let d = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) d;\n  if n mod 2 = 1 then 0 else d.(n/2) - d.(n/2-1)", "language": "OCaml", "metadata": {"date": 1561858628, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/OCaml/s009637901.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s009637901", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Printf.printf \"%d\\n\" @@\n  Scanf.scanf \"%d\" @@ fun n ->\n  let d = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) d;\n  if n mod 2 = 1 then 0 else d.(n/2) - d.(n/2-1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 197, "cpu_time_ms": 57, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s829272253", "group_id": "codeNet:p02990", "input_text": "let modulo = 1_000_000_007\nlet (+%) a b = (a + b) mod modulo\nlet (-%) a b = let tmp = (a - b) mod modulo in\n               if tmp >= 0 then tmp\n               else tmp + modulo\nlet ( *% ) a b = (a * b) mod modulo\nlet rec ( **% ) a n =\n  if n = 0 then 1\n  else if n mod 2 = 1 then a *% a **% (n - 1)\n  else let t = a **% (n / 2) in t *% t\nlet (/%) a b =\n  let inv a = a **% (modulo - 2)\n  in\n  a *% inv b\n\nlet m_fact = Array.make 3000 (-1)\nlet rec fact n =\n  if n <= 0 then 1\n  else\n    if m_fact.(n) >= 0 then m_fact.(n)\n    else (m_fact.(n) <- n *% fact (n - 1);\n          m_fact.(n))\n  \nlet m_nCr = Array.make_matrix 3000 3000 (-1)\nlet rec nCr n r =\n  fact n /% fact (n - r) /% fact r\n  \nlet () =\n  let (n, k) = Scanf.sscanf (input_line stdin) \"%d %d\" (fun a b -> (a, b)) in\n  let rec loop i =\n    if i > k then ()\n    else\n      let ans = nCr (n-k+1) i *% nCr (k-1) (i-1) in\n      (print_int ans;\n       print_newline ();\n       loop (i + 1))\n  in loop 1\n    \n", "language": "OCaml", "metadata": {"date": 1561905478, "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/s829272253.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s829272253", "user_id": "u977566741"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "let modulo = 1_000_000_007\nlet (+%) a b = (a + b) mod modulo\nlet (-%) a b = let tmp = (a - b) mod modulo in\n               if tmp >= 0 then tmp\n               else tmp + modulo\nlet ( *% ) a b = (a * b) mod modulo\nlet rec ( **% ) a n =\n  if n = 0 then 1\n  else if n mod 2 = 1 then a *% a **% (n - 1)\n  else let t = a **% (n / 2) in t *% t\nlet (/%) a b =\n  let inv a = a **% (modulo - 2)\n  in\n  a *% inv b\n\nlet m_fact = Array.make 3000 (-1)\nlet rec fact n =\n  if n <= 0 then 1\n  else\n    if m_fact.(n) >= 0 then m_fact.(n)\n    else (m_fact.(n) <- n *% fact (n - 1);\n          m_fact.(n))\n  \nlet m_nCr = Array.make_matrix 3000 3000 (-1)\nlet rec nCr n r =\n  fact n /% fact (n - r) /% fact r\n  \nlet () =\n  let (n, k) = Scanf.sscanf (input_line stdin) \"%d %d\" (fun a b -> (a, b)) in\n  let rec loop i =\n    if i > k then ()\n    else\n      let ans = nCr (n-k+1) i *% nCr (k-1) (i-1) in\n      (print_int ans;\n       print_newline ();\n       loop (i + 1))\n  in loop 1\n    \n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 963, "cpu_time_ms": 72, "memory_kb": 73592}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s356563897", "group_id": "codeNet:p02990", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet r = n - k\nlet memo = Array.make_matrix 4010 4010 @@ -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 h n k = comb (n + k - 1) k\nlet _ =\n  for i = 1 to k do\n    Printf.printf \"%d\\n\" @@ comb (k - 1) (i - 1) * h (i + 1) (r - i + 1) mod 1_000_000_007 done", "language": "OCaml", "metadata": {"date": 1561873715, "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/s356563897.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s356563897", "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 r = n - k\nlet memo = Array.make_matrix 4010 4010 @@ -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 h n k = comb (n + k - 1) k\nlet _ =\n  for i = 1 to k do\n    Printf.printf \"%d\\n\" @@ comb (k - 1) (i - 1) * h (i + 1) (r - i + 1) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 130, "memory_kb": 127864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s200056447", "group_id": "codeNet:p02994", "input_text": "let n, l, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b, b + a - 1\nlet _ = Printf.printf \"%d\\n\" @@ n * (l + m) / 2 - if l * m <= 0 then 0 else snd @@ min (abs l, l) (abs m, m)", "language": "OCaml", "metadata": {"date": 1572190257, "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/s200056447.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s200056447", "user_id": "u732304692"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "let n, l, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b, b + a - 1\nlet _ = Printf.printf \"%d\\n\" @@ n * (l + m) / 2 - if l * m <= 0 then 0 else snd @@ min (abs l, l) (abs m, m)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s356491946", "group_id": "codeNet:p02998", "input_text": "module Union_find : sig\n  type t\n  val make : int -> t\n  val find : int -> t -> int\n  val size : int -> t -> int\n  val same : int -> int -> t -> bool\n  val unite : int -> int -> t -> unit\nend = struct\n  type t = int array\n  let make n = Array.make n (-1)\n  let rec find x uf =\n    if uf.(x) < 0 then x\n    else (( let x' = find uf.(x) uf in uf.(x) <- x'; x' ))\n  let same x y uf = find x uf = find y uf\n  let size x uf = - uf.(find x uf)\n  let unite x y uf =\n    let x = find x uf and y = 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      ))\nend\nmodule UF = Union_find\n\nmodule M = Map.Make(struct type t = int let compare = (-) end)\nmodule S = Set.Make(struct type t = int let compare = (-) end)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let uf = UF.make 100000 in\n  let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  Array.sort (fun (a,_) (c,_) -> a-c) xy;\n  let _ = Array.fold_left (fun (u, v) (w, x) ->\n    if u = w then UF.unite v x uf; (w, x)\n  ) (-1, -1) xy in\n  let ss = Array.fold_left (fun ss (x, y) ->\n    let k = UF.find x uf in\n    try M.add k (S.add y (M.find k ss)) ss\n    with Not_found -> M.add k (S.singleton y) ss\n  ) M.empty xy in\n  let t = M.fold (fun k v s -> UF.size k uf * S.cardinal v + s) ss 0 in\n  Printf.printf \"%d\\n\" (t - n)\n", "language": "OCaml", "metadata": {"date": 1561412751, "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/s356491946.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s356491946", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module Union_find : sig\n  type t\n  val make : int -> t\n  val find : int -> t -> int\n  val size : int -> t -> int\n  val same : int -> int -> t -> bool\n  val unite : int -> int -> t -> unit\nend = struct\n  type t = int array\n  let make n = Array.make n (-1)\n  let rec find x uf =\n    if uf.(x) < 0 then x\n    else (( let x' = find uf.(x) uf in uf.(x) <- x'; x' ))\n  let same x y uf = find x uf = find y uf\n  let size x uf = - uf.(find x uf)\n  let unite x y uf =\n    let x = find x uf and y = 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      ))\nend\nmodule UF = Union_find\n\nmodule M = Map.Make(struct type t = int let compare = (-) end)\nmodule S = Set.Make(struct type t = int let compare = (-) end)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let uf = UF.make 100000 in\n  let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  Array.sort (fun (a,_) (c,_) -> a-c) xy;\n  let _ = Array.fold_left (fun (u, v) (w, x) ->\n    if u = w then UF.unite v x uf; (w, x)\n  ) (-1, -1) xy in\n  let ss = Array.fold_left (fun ss (x, y) ->\n    let k = UF.find x uf in\n    try M.add k (S.add y (M.find k ss)) ss\n    with Not_found -> M.add k (S.singleton y) ss\n  ) M.empty xy in\n  let t = M.fold (fun k v s -> UF.size k uf * S.cardinal v + s) ss 0 in\n  Printf.printf \"%d\\n\" (t - n)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "sample_input": "3\n1 1\n5 1\n5 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02998", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1432, "cpu_time_ms": 183, "memory_kb": 15872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s110694217", "group_id": "codeNet:p02998", "input_text": "module Union_find : sig\n  type t\n  val make : int -> t\n  val find : int -> t -> int\n  val size : int -> t -> int\n  val same : int -> int -> t -> bool\n  val unite : int -> int -> t -> unit\nend = struct\n  type t = int array\n  let make n = Array.make n (-1)\n  let rec find x uf =\n    if uf.(x) < 0 then x\n    else (( let x' = find uf.(x) uf in uf.(x) <- x'; x' ))\n  let same x y uf = find x uf = find y uf\n  let size x uf = - uf.(find x uf)\n  let unite x y uf =\n    let x = find x uf and y = 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      ))\nend\nmodule UF = Union_find\n\nmodule M = Map.Make(struct type t = int let compare = (-) end)\nmodule S = Set.Make(struct type t = int let compare = (-) end)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let uf = UF.make 10000 in\n  let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  Array.sort (fun (a,_) (c,_) -> a-c) xy;\n  let _ = Array.fold_left (fun (u, v) (w, x) ->\n    if u = w then UF.unite v x uf; (w, x)\n  ) (-1, -1) xy in\n  let ss = Array.fold_left (fun ss (x, y) ->\n    let k = UF.find x uf in\n    try M.add k (S.add y (M.find k ss)) ss\n    with Not_found -> M.add k (S.singleton y) ss\n  ) M.empty xy in\n  let t = M.fold (fun k v s -> UF.size k uf * S.cardinal v + s) ss 0 in\n  Printf.printf \"%d\\n\" (t - n)\n", "language": "OCaml", "metadata": {"date": 1561412724, "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/s110694217.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s110694217", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module Union_find : sig\n  type t\n  val make : int -> t\n  val find : int -> t -> int\n  val size : int -> t -> int\n  val same : int -> int -> t -> bool\n  val unite : int -> int -> t -> unit\nend = struct\n  type t = int array\n  let make n = Array.make n (-1)\n  let rec find x uf =\n    if uf.(x) < 0 then x\n    else (( let x' = find uf.(x) uf in uf.(x) <- x'; x' ))\n  let same x y uf = find x uf = find y uf\n  let size x uf = - uf.(find x uf)\n  let unite x y uf =\n    let x = find x uf and y = 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      ))\nend\nmodule UF = Union_find\n\nmodule M = Map.Make(struct type t = int let compare = (-) end)\nmodule S = Set.Make(struct type t = int let compare = (-) end)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let uf = UF.make 10000 in\n  let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  Array.sort (fun (a,_) (c,_) -> a-c) xy;\n  let _ = Array.fold_left (fun (u, v) (w, x) ->\n    if u = w then UF.unite v x uf; (w, x)\n  ) (-1, -1) xy in\n  let ss = Array.fold_left (fun ss (x, y) ->\n    let k = UF.find x uf in\n    try M.add k (S.add y (M.find k ss)) ss\n    with Not_found -> M.add k (S.singleton y) ss\n  ) M.empty xy in\n  let t = M.fold (fun k v s -> UF.size k uf * S.cardinal v + s) ss 0 in\n  Printf.printf \"%d\\n\" (t - n)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "sample_input": "3\n1 1\n5 1\n5 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02998", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1431, "cpu_time_ms": 94, "memory_kb": 6784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s856652712", "group_id": "codeNet:p02999", "input_text": "let rounding x a = if x < a then 0 else 10\n\nlet x,a = Scanf.sscanf (read_line ()) \"%d %d\" (fun x a -> (x, a))\nlet () = Printf.printf \"%d\\n\" (rounding x a)", "language": "OCaml", "metadata": {"date": 1595767823, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s856652712.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856652712", "user_id": "u272377260"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let rounding x a = if x < a then 0 else 10\n\nlet x,a = Scanf.sscanf (read_line ()) \"%d %d\" (fun x a -> (x, a))\nlet () = Printf.printf \"%d\\n\" (rounding x a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 154, "cpu_time_ms": 9, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s693010366", "group_id": "codeNet:p02999", "input_text": "let f x a = match a-x with\ny when y > 0 -> 10\n| y when y <= 0 -> 0;;\nlet () = Scanf.scanf \"%d %d\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561411406, "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/s693010366.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s693010366", "user_id": "u635974378"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let f x a = match a-x with\ny when y > 0 -> 10\n| y when y <= 0 -> 0;;\nlet () = Scanf.scanf \"%d %d\" f\n|> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s039033201", "group_id": "codeNet:p03003", "input_text": "let () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then (\n                if flag then cur :: acc else acc\n            ) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) 0 false (cur :: acc)\n                | false, ' ' -> loop (i + 1) 0 false acc\n                | true,  v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n                | false, v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n            )\n        in\n        List.rev (loop 0 0 false [])\n    in\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let arrs = Array.of_list (split (read_line ())) in\n        let arrt = Array.of_list (split (read_line ())) in\n        let mat = Array.make_matrix (n + 1) (m + 1) 1 in\n        let mm = 1000000000 + 7 in\n        for y = 1 to n do\n            for x = 1 to m do\n                mat.(y).(x) <- (mat.(y - 1).(x) + mat.(y).(x - 1) +\n                    if arrs.(y - 1) = arrt.(x - 1) then 0 else -mat.(y - 1).(x - 1) + mm) mod mm\n            done\n        done;\n        Printf.printf \"%d\\n\" mat.(n).(m)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1560740101, "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/s039033201.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s039033201", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then (\n                if flag then cur :: acc else acc\n            ) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) 0 false (cur :: acc)\n                | false, ' ' -> loop (i + 1) 0 false acc\n                | true,  v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n                | false, v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n            )\n        in\n        List.rev (loop 0 0 false [])\n    in\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let arrs = Array.of_list (split (read_line ())) in\n        let arrt = Array.of_list (split (read_line ())) in\n        let mat = Array.make_matrix (n + 1) (m + 1) 1 in\n        let mm = 1000000000 + 7 in\n        for y = 1 to n do\n            for x = 1 to m do\n                mat.(y).(x) <- (mat.(y - 1).(x) + mat.(y).(x - 1) +\n                    if arrs.(y - 1) = arrt.(x - 1) then 0 else -mat.(y - 1).(x - 1) + mm) mod mm\n            done\n        done;\n        Printf.printf \"%d\\n\" mat.(n).(m)\n    in\n    main ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1195, "cpu_time_ms": 62, "memory_kb": 34684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s697460820", "group_id": "codeNet:p03004", "input_text": "module Array = ArrayLabels\nmodule List = ListLabels\n\nlet inf = 1000000000.\nlet (>>=) x f = List.map f x |> List.concat\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let xyds = Array.init n (fun _ -> Scanf.scanf \" %f %f %s\" (fun x y d -> x, y, d)) in\n  let find_edges axis dir =\n    Array.fold_left xyds ~init:(inf, -.inf) ~f:(fun (minv, maxv) (x, y, d) ->\n      let v = match axis with `X -> x | `Y -> y in\n      if d = dir then (min minv v, max maxv v) else (minv, maxv))\n  in\n  let dirs = [\"R\"; \"L\"; \"U\"; \"D\"] in\n  let exs = List.map dirs ~f:(fun d ->\n    let x1, x2 = find_edges `X d in\n    (x1, x2, match d with \"R\" -> 1. | \"L\" -> -1. | _ -> 0.))\n  and eys = List.map dirs ~f:(fun d ->\n    let y1, y2 = find_edges `Y d in\n    (y1, y2, match d with \"U\" -> 1. | \"D\" -> -1. | _ -> 0.))\n  in\n\n  let area_of_time (t : float) =\n    let (+), (-), ( * ) = (+.), (-.), ( *.) in\n    let xm, xM = List.fold_left exs ~init:(inf, -.inf) ~f:(fun (xm, xM) (x1, x2, mul) ->\n      (min xm (x1 + mul * t), max xM (x2 + mul * t)))\n    in\n    let ym, yM = List.fold_left eys ~init:(inf, -.inf) ~f:(fun (ym, yM) (y1, y2, mul) ->\n      (min ym (y1 + mul * t), max yM (y2 + mul * t)))\n    in\n    (xM - xm) * (yM - ym)\n  in\n\n  let txs =\n    exs >>= fun (xa1, xa2, da) ->\n    exs >>= fun (xb1, xb2, db) ->\n      if da = db then [] else\n        [xa1; xa2] >>= fun xa ->\n        [xb1; xb2] >>= fun xb -> [abs_float @@ (xa -. xb) /. (da -. db)]\n  and tys =\n    eys >>= fun (ya1, ya2, da) ->\n    eys >>= fun (yb1, yb2, db) ->\n      if da = db then [] else\n        [ya1; ya2] >>= fun ya ->\n        [yb1; yb2] >>= fun yb -> [abs_float @@ (ya -. yb) /. (da -. db)]\n  in\n  List.map area_of_time ([0.] @ txs @ tys) |> List.fold_left ~f:min ~init:inf\n  |> Printf.printf \"%.11f\\n\"\n", "language": "OCaml", "metadata": {"date": 1578094308, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03004.html", "problem_id": "p03004", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03004/input.txt", "sample_output_relpath": "derived/input_output/data/p03004/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03004/OCaml/s697460820.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s697460820", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "module Array = ArrayLabels\nmodule List = ListLabels\n\nlet inf = 1000000000.\nlet (>>=) x f = List.map f x |> List.concat\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let xyds = Array.init n (fun _ -> Scanf.scanf \" %f %f %s\" (fun x y d -> x, y, d)) in\n  let find_edges axis dir =\n    Array.fold_left xyds ~init:(inf, -.inf) ~f:(fun (minv, maxv) (x, y, d) ->\n      let v = match axis with `X -> x | `Y -> y in\n      if d = dir then (min minv v, max maxv v) else (minv, maxv))\n  in\n  let dirs = [\"R\"; \"L\"; \"U\"; \"D\"] in\n  let exs = List.map dirs ~f:(fun d ->\n    let x1, x2 = find_edges `X d in\n    (x1, x2, match d with \"R\" -> 1. | \"L\" -> -1. | _ -> 0.))\n  and eys = List.map dirs ~f:(fun d ->\n    let y1, y2 = find_edges `Y d in\n    (y1, y2, match d with \"U\" -> 1. | \"D\" -> -1. | _ -> 0.))\n  in\n\n  let area_of_time (t : float) =\n    let (+), (-), ( * ) = (+.), (-.), ( *.) in\n    let xm, xM = List.fold_left exs ~init:(inf, -.inf) ~f:(fun (xm, xM) (x1, x2, mul) ->\n      (min xm (x1 + mul * t), max xM (x2 + mul * t)))\n    in\n    let ym, yM = List.fold_left eys ~init:(inf, -.inf) ~f:(fun (ym, yM) (y1, y2, mul) ->\n      (min ym (y1 + mul * t), max yM (y2 + mul * t)))\n    in\n    (xM - xm) * (yM - ym)\n  in\n\n  let txs =\n    exs >>= fun (xa1, xa2, da) ->\n    exs >>= fun (xb1, xb2, db) ->\n      if da = db then [] else\n        [xa1; xa2] >>= fun xa ->\n        [xb1; xb2] >>= fun xb -> [abs_float @@ (xa -. xb) /. (da -. db)]\n  and tys =\n    eys >>= fun (ya1, ya2, da) ->\n    eys >>= fun (yb1, yb2, db) ->\n      if da = db then [] else\n        [ya1; ya2] >>= fun ya ->\n        [yb1; yb2] >>= fun yb -> [abs_float @@ (ya -. yb) /. (da -. db)]\n  in\n  List.map area_of_time ([0.] @ txs @ tys) |> List.fold_left ~f:min ~init:inf\n  |> Printf.printf \"%.11f\\n\"\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:\n\nIf d_i = R, the i-th point moves in the positive x direction;\n\nIf d_i = L, the i-th point moves in the negative x direction;\n\nIf d_i = U, the i-th point moves in the positive y direction;\n\nIf d_i = D, the i-th point moves in the negative y direction.\n\nYou can stop all the points at some moment of your choice after they start moving (including the moment they start moving).\nThen, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.\n\nFind the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}) and print it.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n-10^8 \\leq x_i,\\ y_i \\leq 10^8\n\nx_i and y_i are integers.\n\nd_i is R, L, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 d_1\nx_2 y_2 d_2\n.\n.\n.\nx_N y_N d_N\n\nOutput\n\nPrint the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}).\n\nThe output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.\n\nSample Input 1\n\n2\n0 3 D\n3 0 L\n\nSample Output 1\n\n0\n\nAfter three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.\n\nSample Input 2\n\n5\n-7 -10 U\n7 -6 U\n-8 7 D\n-3 3 D\n0 -6 R\n\nSample Output 2\n\n97.5\n\nThe answer may not be an integer.\n\nSample Input 3\n\n20\n6 -10 R\n-4 -9 U\n9 6 D\n-3 -2 R\n0 7 D\n4 5 D\n10 -10 U\n-1 -8 U\n10 -6 D\n8 -5 U\n6 4 D\n0 3 D\n7 9 R\n9 -4 R\n3 10 D\n1 9 U\n1 -6 U\n9 -8 R\n6 7 D\n7 -3 D\n\nSample Output 3\n\n273", "sample_input": "2\n0 3 D\n3 0 L\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03004", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:\n\nIf d_i = R, the i-th point moves in the positive x direction;\n\nIf d_i = L, the i-th point moves in the negative x direction;\n\nIf d_i = U, the i-th point moves in the positive y direction;\n\nIf d_i = D, the i-th point moves in the negative y direction.\n\nYou can stop all the points at some moment of your choice after they start moving (including the moment they start moving).\nThen, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.\n\nFind the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}) and print it.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n-10^8 \\leq x_i,\\ y_i \\leq 10^8\n\nx_i and y_i are integers.\n\nd_i is R, L, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 d_1\nx_2 y_2 d_2\n.\n.\n.\nx_N y_N d_N\n\nOutput\n\nPrint the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}).\n\nThe output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.\n\nSample Input 1\n\n2\n0 3 D\n3 0 L\n\nSample Output 1\n\n0\n\nAfter three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.\n\nSample Input 2\n\n5\n-7 -10 U\n7 -6 U\n-8 7 D\n-3 3 D\n0 -6 R\n\nSample Output 2\n\n97.5\n\nThe answer may not be an integer.\n\nSample Input 3\n\n20\n6 -10 R\n-4 -9 U\n9 6 D\n-3 -2 R\n0 7 D\n4 5 D\n10 -10 U\n-1 -8 U\n10 -6 D\n8 -5 U\n6 4 D\n0 3 D\n7 9 R\n9 -4 R\n3 10 D\n1 9 U\n1 -6 U\n9 -8 R\n6 7 D\n7 -3 D\n\nSample Output 3\n\n273", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1746, "cpu_time_ms": 123, "memory_kb": 12160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s987201313", "group_id": "codeNet:p03004", "input_text": "let dir = function \"R\" -> 0 | \"U\" -> 1 | \"L\" -> 2 | _ -> 3\nlet foi = float_of_int\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let xyd = Array.init n (fun _ -> Scanf.scanf \" %d %d %s\" @@ fun x y d -> x, y, dir d) in\n  let calc1 d =\n    let fld, v0, g =\n      if d < 2 then max, min_int, (fun x -> x)\n      else          min, max_int, (fun x -> -x)\n    in\n    let c = Array.fold_left (fun v (x,y,d') ->\n      if (d-d'+4) mod 2 = 1 then fld v (if d mod 2 = 0 then y else x) else v\n    ) v0 xyd\n    in\n    let i = Array.fold_left (fun v (x,y,d') ->\n      if d = d' then fld v (if d mod 2 = 0 then x else y) else v\n    ) v0 xyd in\n    let r = Array.fold_left (fun v (x,y,d') ->\n      if (d-d'+4) mod 4 = 2 then fld v (if d mod 2 = 0 then x else y) else v\n    ) v0 xyd\n    in\n    [ 2 * g (r - c);\n      2 * g (c - i);\n      g (r - i); ]\n  in\n  let calc2 t =\n    let xmin, xmax, ymin, ymax =\n      Array.fold_left (fun (xmin, xmax, ymin, ymax) (x,y,d) ->\n        let x, y = foi x, foi y in\n        let x, y = match d with\n          | 0 -> x +. t, y\n          | 1 -> x,      y +. t\n          | 2 -> x -. t, y\n          | _ -> x,      y -. t\n        in\n        min xmin x, max xmax x, min ymin y, max ymax y) (1e30, -.1e30, 1e30, -.1e30) xyd\n    in\n    (xmax -. xmin) *. (ymax -. ymin)\n  in\n  List.concat [calc1 0; calc1 1; calc1 2; calc1 3; ]\n  |> List.filter (fun x -> 0 <= x && x <= 100000)\n  |> List.sort_uniq (-)\n  |> List.fold_left (fun v t -> min v (calc2 (foi t /. 2.0))) max_float\n  |> Printf.printf \"%.10f\\n\"", "language": "OCaml", "metadata": {"date": 1560746290, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03004.html", "problem_id": "p03004", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03004/input.txt", "sample_output_relpath": "derived/input_output/data/p03004/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03004/OCaml/s987201313.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s987201313", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let dir = function \"R\" -> 0 | \"U\" -> 1 | \"L\" -> 2 | _ -> 3\nlet foi = float_of_int\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let xyd = Array.init n (fun _ -> Scanf.scanf \" %d %d %s\" @@ fun x y d -> x, y, dir d) in\n  let calc1 d =\n    let fld, v0, g =\n      if d < 2 then max, min_int, (fun x -> x)\n      else          min, max_int, (fun x -> -x)\n    in\n    let c = Array.fold_left (fun v (x,y,d') ->\n      if (d-d'+4) mod 2 = 1 then fld v (if d mod 2 = 0 then y else x) else v\n    ) v0 xyd\n    in\n    let i = Array.fold_left (fun v (x,y,d') ->\n      if d = d' then fld v (if d mod 2 = 0 then x else y) else v\n    ) v0 xyd in\n    let r = Array.fold_left (fun v (x,y,d') ->\n      if (d-d'+4) mod 4 = 2 then fld v (if d mod 2 = 0 then x else y) else v\n    ) v0 xyd\n    in\n    [ 2 * g (r - c);\n      2 * g (c - i);\n      g (r - i); ]\n  in\n  let calc2 t =\n    let xmin, xmax, ymin, ymax =\n      Array.fold_left (fun (xmin, xmax, ymin, ymax) (x,y,d) ->\n        let x, y = foi x, foi y in\n        let x, y = match d with\n          | 0 -> x +. t, y\n          | 1 -> x,      y +. t\n          | 2 -> x -. t, y\n          | _ -> x,      y -. t\n        in\n        min xmin x, max xmax x, min ymin y, max ymax y) (1e30, -.1e30, 1e30, -.1e30) xyd\n    in\n    (xmax -. xmin) *. (ymax -. ymin)\n  in\n  List.concat [calc1 0; calc1 1; calc1 2; calc1 3; ]\n  |> List.filter (fun x -> 0 <= x && x <= 100000)\n  |> List.sort_uniq (-)\n  |> List.fold_left (fun v t -> min v (calc2 (foi t /. 2.0))) max_float\n  |> Printf.printf \"%.10f\\n\"", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:\n\nIf d_i = R, the i-th point moves in the positive x direction;\n\nIf d_i = L, the i-th point moves in the negative x direction;\n\nIf d_i = U, the i-th point moves in the positive y direction;\n\nIf d_i = D, the i-th point moves in the negative y direction.\n\nYou can stop all the points at some moment of your choice after they start moving (including the moment they start moving).\nThen, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.\n\nFind the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}) and print it.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n-10^8 \\leq x_i,\\ y_i \\leq 10^8\n\nx_i and y_i are integers.\n\nd_i is R, L, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 d_1\nx_2 y_2 d_2\n.\n.\n.\nx_N y_N d_N\n\nOutput\n\nPrint the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}).\n\nThe output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.\n\nSample Input 1\n\n2\n0 3 D\n3 0 L\n\nSample Output 1\n\n0\n\nAfter three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.\n\nSample Input 2\n\n5\n-7 -10 U\n7 -6 U\n-8 7 D\n-3 3 D\n0 -6 R\n\nSample Output 2\n\n97.5\n\nThe answer may not be an integer.\n\nSample Input 3\n\n20\n6 -10 R\n-4 -9 U\n9 6 D\n-3 -2 R\n0 7 D\n4 5 D\n10 -10 U\n-1 -8 U\n10 -6 D\n8 -5 U\n6 4 D\n0 3 D\n7 9 R\n9 -4 R\n3 10 D\n1 9 U\n1 -6 U\n9 -8 R\n6 7 D\n7 -3 D\n\nSample Output 3\n\n273", "sample_input": "2\n0 3 D\n3 0 L\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03004", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:\n\nIf d_i = R, the i-th point moves in the positive x direction;\n\nIf d_i = L, the i-th point moves in the negative x direction;\n\nIf d_i = U, the i-th point moves in the positive y direction;\n\nIf d_i = D, the i-th point moves in the negative y direction.\n\nYou can stop all the points at some moment of your choice after they start moving (including the moment they start moving).\nThen, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.\n\nFind the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}) and print it.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n-10^8 \\leq x_i,\\ y_i \\leq 10^8\n\nx_i and y_i are integers.\n\nd_i is R, L, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 d_1\nx_2 y_2 d_2\n.\n.\n.\nx_N y_N d_N\n\nOutput\n\nPrint the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}).\n\nThe output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.\n\nSample Input 1\n\n2\n0 3 D\n3 0 L\n\nSample Output 1\n\n0\n\nAfter three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.\n\nSample Input 2\n\n5\n-7 -10 U\n7 -6 U\n-8 7 D\n-3 3 D\n0 -6 R\n\nSample Output 2\n\n97.5\n\nThe answer may not be an integer.\n\nSample Input 3\n\n20\n6 -10 R\n-4 -9 U\n9 6 D\n-3 -2 R\n0 7 D\n4 5 D\n10 -10 U\n-1 -8 U\n10 -6 D\n8 -5 U\n6 4 D\n0 3 D\n7 9 R\n9 -4 R\n3 10 D\n1 9 U\n1 -6 U\n9 -8 R\n6 7 D\n7 -3 D\n\nSample Output 3\n\n273", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1507, "cpu_time_ms": 174, "memory_kb": 6912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s997899759", "group_id": "codeNet:p03006", "input_text": "(* O(n^4) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet xys = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ans = ref max_int\nlet _ =\n  if n = 1 then (print_endline \"1\"; exit 0);\n  (xys |> Array.iteri @@ fun i (x0, y0) ->\n    xys |> Array.iteri @@ fun j (x, y) ->\n      if i <> j then\n        let p, q = x - x0, y - y0 in\n        let e = ref 0 in\n        xys |> Array.iter @@ fun (x1, y1) ->\n          (xys |> Array.iter @@ fun (x2, y2) ->\n            if x2 - x1 = p && y2 - y1 = q then incr e);\n          ans := min !ans @@ n - !e);\n  Printf.printf \"%d\\n\" @@ !ans", "language": "OCaml", "metadata": {"date": 1560789402, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03006.html", "problem_id": "p03006", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03006/input.txt", "sample_output_relpath": "derived/input_output/data/p03006/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03006/OCaml/s997899759.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s997899759", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* O(n^4) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet xys = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ans = ref max_int\nlet _ =\n  if n = 1 then (print_endline \"1\"; exit 0);\n  (xys |> Array.iteri @@ fun i (x0, y0) ->\n    xys |> Array.iteri @@ fun j (x, y) ->\n      if i <> j then\n        let p, q = x - x0, y - y0 in\n        let e = ref 0 in\n        xys |> Array.iter @@ fun (x1, y1) ->\n          (xys |> Array.iter @@ fun (x2, y2) ->\n            if x2 - x1 = p && y2 - y1 = q then incr e);\n          ans := min !ans @@ n - !e);\n  Printf.printf \"%d\\n\" @@ !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).\n\nWe will collect all of these balls, by choosing two integers p and q such that p \\neq 0 or q \\neq 0 and then repeating the following operation:\n\nChoose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.\n\nFind the minimum total cost required to collect all the balls when we optimally choose p and q.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n|x_i|, |y_i| \\leq 10^9\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum total cost required to collect all the balls.\n\nSample Input 1\n\n2\n1 1\n2 2\n\nSample Output 1\n\n1\n\nIf we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).\n\nSample Input 2\n\n3\n1 4\n4 6\n7 8\n\nSample Output 2\n\n1\n\nIf we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).\n\nSample Input 3\n\n4\n1 1\n1 2\n2 1\n2 2\n\nSample Output 3\n\n2", "sample_input": "2\n1 1\n2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03006", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).\n\nWe will collect all of these balls, by choosing two integers p and q such that p \\neq 0 or q \\neq 0 and then repeating the following operation:\n\nChoose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.\n\nFind the minimum total cost required to collect all the balls when we optimally choose p and q.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n|x_i|, |y_i| \\leq 10^9\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum total cost required to collect all the balls.\n\nSample Input 1\n\n2\n1 1\n2 2\n\nSample Output 1\n\n1\n\nIf we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).\n\nSample Input 2\n\n3\n1 4\n4 6\n7 8\n\nSample Output 2\n\n1\n\nIf we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).\n\nSample Input 3\n\n4\n1 1\n1 2\n2 1\n2 2\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 583, "cpu_time_ms": 36, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s662316991", "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 p = ref @@ -1\nlet xys = ref []\nlet _ =\n  Array.sort (-) a_s;\n  let i = ref 0 in while !p < 0 && !i < n do if a_s.(!i) >= 0 then p := !i; incr i done;\n  if !p = -1 then p := n - 1\n  else if !p = 0 then p := 1;\n  for i = !p to n - 2 do\n    xys := (a_s.(0), a_s.(i)) :: !xys;\n    a_s.(0) <- a_s.(0) - a_s.(i)\n  done;\n  for i = 0 to !p - 1 do\n    xys := (a_s.(n - 1), a_s.(i)) :: !xys;\n    a_s.(n - 1) <- a_s.(n - 1) - a_s.(i)\n  done;\n  Printf.printf \"%d\\n\" a_s.(n - 1);\n  List.rev !xys |> List.iter @@ fun (x, y) -> Printf.printf \"%d %d\\n\" x y", "language": "OCaml", "metadata": {"date": 1560805583, "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/s662316991.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s662316991", "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 p = ref @@ -1\nlet xys = ref []\nlet _ =\n  Array.sort (-) a_s;\n  let i = ref 0 in while !p < 0 && !i < n do if a_s.(!i) >= 0 then p := !i; incr i done;\n  if !p = -1 then p := n - 1\n  else if !p = 0 then p := 1;\n  for i = !p to n - 2 do\n    xys := (a_s.(0), a_s.(i)) :: !xys;\n    a_s.(0) <- a_s.(0) - a_s.(i)\n  done;\n  for i = 0 to !p - 1 do\n    xys := (a_s.(n - 1), a_s.(i)) :: !xys;\n    a_s.(n - 1) <- a_s.(n - 1) - a_s.(i)\n  done;\n  Printf.printf \"%d\\n\" a_s.(n - 1);\n  List.rev !xys |> List.iter @@ fun (x, y) -> Printf.printf \"%d %d\\n\" x y", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 652, "cpu_time_ms": 116, "memory_kb": 13056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s061056875", "group_id": "codeNet:p03011", "input_text": "let () =\n    let main () =\n        let p, q, r = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> a, b, c) in\n        Printf.printf \"%d\\n\" (min (min (p+q) (q+r)) (r+p))\n    in\n    main ()\n", "language": "OCaml", "metadata": {"date": 1560128561, "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/s061056875.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061056875", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () =\n    let main () =\n        let p, q, r = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> a, b, c) in\n        Printf.printf \"%d\\n\" (min (min (p+q) (q+r)) (r+p))\n    in\n    main ()\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 192, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s620987282", "group_id": "codeNet:p03013", "input_text": "let () =\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n m -> n, m) in\n        let a = Array.init m (fun _ -> int_of_string (read_line ())) in\n        let f = Array.make (n + 1) true in\n        let () = Array.iter (fun v -> f.(v) <- false) a in\n        let c = Array.make (n + 1) 0 in\n        let () = c.(0) <- 1 in\n        let mm = 1_000_000_007 in\n        for i = 0 to n - 1 do\n            if               f.(i + 1) then c.(i + 1) <- (c.(i + 1) + c.(i)) mod mm;\n            if i + 2 <= n && f.(i + 2) then c.(i + 2) <- (c.(i + 2) + c.(i)) mod mm\n        done;\n        Printf.printf \"%d\\n\" c.(n)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1560129627, "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/s620987282.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s620987282", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () =\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n m -> n, m) in\n        let a = Array.init m (fun _ -> int_of_string (read_line ())) in\n        let f = Array.make (n + 1) true in\n        let () = Array.iter (fun v -> f.(v) <- false) a in\n        let c = Array.make (n + 1) 0 in\n        let () = c.(0) <- 1 in\n        let mm = 1_000_000_007 in\n        for i = 0 to n - 1 do\n            if               f.(i + 1) then c.(i + 1) <- (c.(i + 1) + c.(i)) mod mm;\n            if i + 2 <= n && f.(i + 2) then c.(i + 2) <- (c.(i + 2) + c.(i)) mod mm\n        done;\n        Printf.printf \"%d\\n\" c.(n)\n    in\n    main ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "sample_input": "6 1\n3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03013", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 648, "cpu_time_ms": 15, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s520899380", "group_id": "codeNet:p03016", "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\n\nlet rec pow ( * ) z a n =\n  if n = 0 then z\n  else if n mod 2 = 1 then a * (pow ( * ) z a (n-1))\n  else let h = pow ( * ) z a (n/2) in h * h\n\nlet rec intpow = pow ( * ) 1\n\nlet i3 = [| [|1; 0; 0|]; [|0; 1; 0|]; [|0; 0; 1|] |]\n\nlet () =\n  Scanf.scanf \"%d %d %d %d\" @@ fun l a b modulo ->\n  \n  let (+@) a b = (a + b + modulo) mod modulo in\n  let modmul a b = (a * b) mod modulo in\n  let modpow = pow modmul 1 in\n\n  let matmul a b =\n    let m = Array.length b in\n    Array.init (Array.length a) (fun i ->\n    Array.init (Array.length b.(0)) (fun j ->\n      fold_for 0 m 0 (fun k s -> s +@ modmul a.(i).(k) b.(k).(j))))\n  in\n\n  let rec loop d z =\n    if d > 18 then z else\n    let i = (intpow 10 (d-1) - a + b - 1) / b |> max 0 in\n    let j = (intpow 10 d - a + b - 1) / b |> min l in\n    let r = [| [| z; a +@ modmul b i; 1 |] |] in\n    let m = [| [| modpow 10 d; 0; 0 |]; [| 1; 1; 0 |]; [| 0; b mod modulo; 1 |]; |] in\n    let mc = pow matmul i3 m (j-i) in\n    let r' = matmul r mc in\n    loop (d+1) r'.(0).(0)\n  in\n  loop 1 0 |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1560143925, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03016.html", "problem_id": "p03016", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03016/input.txt", "sample_output_relpath": "derived/input_output/data/p03016/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03016/OCaml/s520899380.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s520899380", "user_id": "u798181098"}, "prompt_components": {"gold_output": "5563\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\n\nlet rec pow ( * ) z a n =\n  if n = 0 then z\n  else if n mod 2 = 1 then a * (pow ( * ) z a (n-1))\n  else let h = pow ( * ) z a (n/2) in h * h\n\nlet rec intpow = pow ( * ) 1\n\nlet i3 = [| [|1; 0; 0|]; [|0; 1; 0|]; [|0; 0; 1|] |]\n\nlet () =\n  Scanf.scanf \"%d %d %d %d\" @@ fun l a b modulo ->\n  \n  let (+@) a b = (a + b + modulo) mod modulo in\n  let modmul a b = (a * b) mod modulo in\n  let modpow = pow modmul 1 in\n\n  let matmul a b =\n    let m = Array.length b in\n    Array.init (Array.length a) (fun i ->\n    Array.init (Array.length b.(0)) (fun j ->\n      fold_for 0 m 0 (fun k s -> s +@ modmul a.(i).(k) b.(k).(j))))\n  in\n\n  let rec loop d z =\n    if d > 18 then z else\n    let i = (intpow 10 (d-1) - a + b - 1) / b |> max 0 in\n    let j = (intpow 10 d - a + b - 1) / b |> min l in\n    let r = [| [| z; a +@ modmul b i; 1 |] |] in\n    let m = [| [| modpow 10 d; 0; 0 |]; [| 1; 1; 0 |]; [| 0; b mod modulo; 1 |]; |] in\n    let mc = pow matmul i3 m (j-i) in\n    let r' = matmul r mc in\n    loop (d+1) r'.(0).(0)\n  in\n  loop 1 0 |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is an arithmetic progression with L terms: s_0, s_1, s_2, ... , s_{L-1}.\n\nThe initial term is A, and the common difference is B. That is, s_i = A + B \\times i holds.\n\nConsider the integer obtained by concatenating the terms written in base ten without leading zeros. For example, the sequence 3, 7, 11, 15, 19 would be concatenated into 37111519. What is the remainder when that integer is divided by M?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L, A, B < 10^{18}\n\n2 \\leq M \\leq 10^9\n\nAll terms in the arithmetic progression are less than 10^{18}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL A B M\n\nOutput\n\nPrint the remainder when the integer obtained by concatenating the terms is divided by M.\n\nSample Input 1\n\n5 3 4 10007\n\nSample Output 1\n\n5563\n\nOur arithmetic progression is 3, 7, 11, 15, 19, so the answer is 37111519 mod 10007, that is, 5563.\n\nSample Input 2\n\n4 8 1 1000000\n\nSample Output 2\n\n891011\n\nSample Input 3\n\n107 10000000000007 1000000000000007 998244353\n\nSample Output 3\n\n39122908", "sample_input": "5 3 4 10007\n"}, "reference_outputs": ["5563\n"], "source_document_id": "p03016", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is an arithmetic progression with L terms: s_0, s_1, s_2, ... , s_{L-1}.\n\nThe initial term is A, and the common difference is B. That is, s_i = A + B \\times i holds.\n\nConsider the integer obtained by concatenating the terms written in base ten without leading zeros. For example, the sequence 3, 7, 11, 15, 19 would be concatenated into 37111519. What is the remainder when that integer is divided by M?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L, A, B < 10^{18}\n\n2 \\leq M \\leq 10^9\n\nAll terms in the arithmetic progression are less than 10^{18}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL A B M\n\nOutput\n\nPrint the remainder when the integer obtained by concatenating the terms is divided by M.\n\nSample Input 1\n\n5 3 4 10007\n\nSample Output 1\n\n5563\n\nOur arithmetic progression is 3, 7, 11, 15, 19, so the answer is 37111519 mod 10007, that is, 5563.\n\nSample Input 2\n\n4 8 1 1000000\n\nSample Output 2\n\n891011\n\nSample Input 3\n\n107 10000000000007 1000000000000007 998244353\n\nSample Output 3\n\n39122908", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1125, "cpu_time_ms": 2, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s681931372", "group_id": "codeNet:p03026", "input_text": "let split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\n\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)\nlet c = List.sort (fun a b -> b - a) @@ List.map int_of_string @@ split_string @@ read_line ()\n\nlet rec sum = function | ([] | _ :: []) -> 0 | x :: xs -> x + sum xs\nlet sum = sum c\n\nlet rec find_index i arr f = \n  if Array.length arr = i then -1\n  else if f arr.(i) then i\n  else find_index (i + 1) arr f\nlet find_index = find_index 0 ab\n\nlet s = Array.make n false\nlet ans = Array.make n 0\n\nlet rec loop = function\n  | [] -> ()\n  | x :: xs ->\n    let idx = find_index (fun (a, b) -> a + b > 0 && (s.(a) || s.(b))) in\n    let (a, b) = ab.(idx) in\n    ab.(idx) <- (-1, -1);\n    if s.(a) then begin\n      s.(b) <- true; ans.(b) <- x\n    end\n    else begin\n      s.(a) <- true; ans.(a) <- x\n    end;\n    loop xs\n\nlet () =\n  match c with\n    | x :: [] -> print_endline \"0\"\n    | x :: y :: xs ->\n      let (a, b) = ab.(0) in\n      Printf.printf \"%d %d\\n\" a b;\n      ab.(0) <- (-1, -1);\n      ans.(a) <- x; s.(a) <- true;\n      ans.(b) <- y; s.(b) <- true;\n      loop xs;\n      print_endline @@ String.concat \" \" @@ Array.to_list @@ Array.map string_of_int ans;\n    | _ -> failwith \"\"", "language": "OCaml", "metadata": {"date": 1589416330, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03026.html", "problem_id": "p03026", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03026/input.txt", "sample_output_relpath": "derived/input_output/data/p03026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03026/OCaml/s681931372.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s681931372", "user_id": "u811309788"}, "prompt_components": {"gold_output": "10\n1 2 3 4 5\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 ab = Array.init (n - 1) @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a - 1, b - 1)\nlet c = List.sort (fun a b -> b - a) @@ List.map int_of_string @@ split_string @@ read_line ()\n\nlet rec sum = function | ([] | _ :: []) -> 0 | x :: xs -> x + sum xs\nlet sum = sum c\n\nlet rec find_index i arr f = \n  if Array.length arr = i then -1\n  else if f arr.(i) then i\n  else find_index (i + 1) arr f\nlet find_index = find_index 0 ab\n\nlet s = Array.make n false\nlet ans = Array.make n 0\n\nlet rec loop = function\n  | [] -> ()\n  | x :: xs ->\n    let idx = find_index (fun (a, b) -> a + b > 0 && (s.(a) || s.(b))) in\n    let (a, b) = ab.(idx) in\n    ab.(idx) <- (-1, -1);\n    if s.(a) then begin\n      s.(b) <- true; ans.(b) <- x\n    end\n    else begin\n      s.(a) <- true; ans.(a) <- x\n    end;\n    loop xs\n\nlet () =\n  match c with\n    | x :: [] -> print_endline \"0\"\n    | x :: y :: xs ->\n      let (a, b) = ab.(0) in\n      Printf.printf \"%d %d\\n\" a b;\n      ab.(0) <- (-1, -1);\n      ans.(a) <- x; s.(a) <- true;\n      ans.(b) <- y; s.(b) <- true;\n      loop xs;\n      print_endline @@ String.concat \" \" @@ Array.to_list @@ Array.map string_of_int ans;\n    | _ -> failwith \"\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "sample_input": "5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n"}, "reference_outputs": ["10\n1 2 3 4 5\n"], "source_document_id": "p03026", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1305, "cpu_time_ms": 463, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s592907888", "group_id": "codeNet:p03029", "input_text": "let applepie a p = (a * 3 + p) / 2\n\nlet a, p = Scanf.sscanf (read_line ()) \"%d %d\" (fun a p -> (a, p))\nlet () = Printf.printf \"%d\\n\" (applepie a p)", "language": "OCaml", "metadata": {"date": 1595789966, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/OCaml/s592907888.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s592907888", "user_id": "u272377260"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let applepie a p = (a * 3 + p) / 2\n\nlet a, p = Scanf.sscanf (read_line ()) \"%d %d\" (fun a p -> (a, p))\nlet () = Printf.printf \"%d\\n\" (applepie a p)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 7, "memory_kb": 3780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s395941904", "group_id": "codeNet:p03029", "input_text": "open Printf\nopen Scanf\n\nlet solve a p = (3 * a + p) / 2\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582589808, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/OCaml/s395941904.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s395941904", "user_id": "u388783188"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a p = (3 * a + p) / 2\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s760112735", "group_id": "codeNet:p03029", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun a p ->\n  Printf.printf \"%d\\n\" @@ (3 * a + p) / 2", "language": "OCaml", "metadata": {"date": 1558919207, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/OCaml/s760112735.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s760112735", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun a p ->\n  Printf.printf \"%d\\n\" @@ (3 * a + p) / 2", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 84, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s186514451", "group_id": "codeNet:p03031", "input_text": "let () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then (\n                if flag then cur :: acc else acc\n            ) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) 0 false (cur :: acc)\n                | false, ' ' -> loop (i + 1) 0 false acc\n                | true,  v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n                | false, v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n            )\n        in\n        List.rev (loop 0 0 false [])\n    in\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n m -> n, m) in\n        let arr = Array.init m (fun _ -> List.tl (split (read_line ()))) in\n        let p = Array.of_list (split (read_line ())) in\n        let sw = Array.make m 0 in\n        for i = 0 to m - 1 do\n            sw.(i) <- List.fold_left (fun acc v -> acc lor (1 lsl (v - 1))) 0 arr.(i)\n        done;\n        let count bits =\n            let rec loop i acc =\n                if i = 0 then acc else loop (i / 2) (acc + i land 1)\n            in\n            loop bits 0\n        in\n        let forall bits switch p =\n            let rec loop i =\n                if i < 0 then true else\n                if count (switch.(i) land bits) mod 2 = p.(i) then loop (i - 1) else false\n            in\n            loop (m - 1)\n        in\n        let rec loop i acc =\n            if i < 0 then acc else\n                let acc = if forall i sw p then acc + 1 else acc in\n                loop (i - 1) acc\n        in\n        let ans = loop ((1 lsl n) - 1) 0 in\n        Printf.printf \"%d\\n\" ans\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1558920600, "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/s186514451.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186514451", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then (\n                if flag then cur :: acc else acc\n            ) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) 0 false (cur :: acc)\n                | false, ' ' -> loop (i + 1) 0 false acc\n                | true,  v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n                | false, v   -> loop (i + 1) (cur * 10 + int_of_char v - 48) true acc\n            )\n        in\n        List.rev (loop 0 0 false [])\n    in\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n m -> n, m) in\n        let arr = Array.init m (fun _ -> List.tl (split (read_line ()))) in\n        let p = Array.of_list (split (read_line ())) in\n        let sw = Array.make m 0 in\n        for i = 0 to m - 1 do\n            sw.(i) <- List.fold_left (fun acc v -> acc lor (1 lsl (v - 1))) 0 arr.(i)\n        done;\n        let count bits =\n            let rec loop i acc =\n                if i = 0 then acc else loop (i / 2) (acc + i land 1)\n            in\n            loop bits 0\n        in\n        let forall bits switch p =\n            let rec loop i =\n                if i < 0 then true else\n                if count (switch.(i) land bits) mod 2 = p.(i) then loop (i - 1) else false\n            in\n            loop (m - 1)\n        in\n        let rec loop i acc =\n            if i < 0 then acc else\n                let acc = if forall i sw p then acc + 1 else acc in\n                loop (i - 1) acc\n        in\n        let ans = loop ((1 lsl n) - 1) 0 in\n        Printf.printf \"%d\\n\" ans\n    in\n    main ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "sample_input": "2 2\n2 1 2\n1 2\n0 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03031", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1665, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s886422826", "group_id": "codeNet:p03035", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a with\n  | a when a >= 13 -> print_endline (string_of_int b)\n  | a when a >= 6 -> print_endline (string_of_int (b/2))\n  | a -> print_endline \"0\"\n)", "language": "OCaml", "metadata": {"date": 1583934061, "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/s886422826.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s886422826", "user_id": "u511870776"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a with\n  | a when a >= 13 -> print_endline (string_of_int b)\n  | a when a >= 6 -> print_endline (string_of_int (b/2))\n  | a -> print_endline \"0\"\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s024791328", "group_id": "codeNet:p03035", "input_text": "let () =\n    let main () =\n        let a, b = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> a, b) in\n        Printf.printf \"%d\\n\" (if a >= 13 then b else if a >= 6 then b / 2 else 0)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1558832708, "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/s024791328.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s024791328", "user_id": "u342443598"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "let () =\n    let main () =\n        let a, b = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> a, b) in\n        Printf.printf \"%d\\n\" (if a >= 13 then b else if a >= 6 then b / 2 else 0)\n    in\n    main ()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 203, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s325860977", "group_id": "codeNet:p03036", "input_text": "Scanf.scanf \"%d %d %d\" @@ fun r d x2000 ->\n  let ans = ref x2000 in\n  for i = 1 to 10 do\n    ans := !ans * r - d;\n    Printf.printf \"%d\\n\" !ans \n  done", "language": "OCaml", "metadata": {"date": 1558832970, "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/s325860977.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s325860977", "user_id": "u732304692"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" @@ fun r d x2000 ->\n  let ans = ref x2000 in\n  for i = 1 to 10 do\n    ans := !ans * r - d;\n    Printf.printf \"%d\\n\" !ans \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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s834322736", "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": 1558832696, "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/s834322736.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834322736", "user_id": "u504158101"}, "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s743700576", "group_id": "codeNet:p03037", "input_text": "let make_gate_list l r =\n  let rec hoge l r =\n    if l > r then\n      []\n    else\n      l :: hoge (l + 1) r\n  in\n    hoge l r\n\n\nlet hikaku_lst lst1 lst2 =\n  let hikaku n =\n    List.filter (fun m -> n = m) lst2\n  in\n    List.map hikaku lst1 |> List.concat\n\n\nlet () = Scanf.scanf \"%d %d\\n\" (fun n m ->\n    let card_lst = make_gate_list 1 n in\n    let rec loop i lst =\n      if i = m then (*iは回数制限（最初のnに達したら終了）*)\n      card_lst else\n        let i = i + 1 in\n        Scanf.scanf \"%d %d\\n\" (fun l r ->\n          let gate_list = make_gate_list l r in\n          let ok_list = hikaku_lst gate_list lst in\n          hikaku_lst ok_list (loop i ok_list)\n        )\n      in\n    let lst = loop 0 card_lst in\n     Printf.printf \"%d\" (List.length lst)\n)\n", "language": "OCaml", "metadata": {"date": 1558836467, "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/s743700576.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s743700576", "user_id": "u950428333"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let make_gate_list l r =\n  let rec hoge l r =\n    if l > r then\n      []\n    else\n      l :: hoge (l + 1) r\n  in\n    hoge l r\n\n\nlet hikaku_lst lst1 lst2 =\n  let hikaku n =\n    List.filter (fun m -> n = m) lst2\n  in\n    List.map hikaku lst1 |> List.concat\n\n\nlet () = Scanf.scanf \"%d %d\\n\" (fun n m ->\n    let card_lst = make_gate_list 1 n in\n    let rec loop i lst =\n      if i = m then (*iは回数制限（最初のnに達したら終了）*)\n      card_lst else\n        let i = i + 1 in\n        Scanf.scanf \"%d %d\\n\" (fun l r ->\n          let gate_list = make_gate_list l r in\n          let ok_list = hikaku_lst gate_list lst in\n          hikaku_lst ok_list (loop i ok_list)\n        )\n      in\n    let lst = loop 0 card_lst in\n     Printf.printf \"%d\" (List.length lst)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 773, "cpu_time_ms": 2104, "memory_kb": 12672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s841953703", "group_id": "codeNet:p03037", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let count = Array.make (n + 1) 0 in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun l r ->\n      count.(l - 1) <- count.(l - 1) + 1;\n      count.(r) <- count.(r) - 1;\n  done;\n  for i = 1 to n do\n    count.(i) <- count.(i - 1) + count.(i)\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_right (fun c -> ( + ) @@ if c < m then 0 else 1) count 0", "language": "OCaml", "metadata": {"date": 1558832961, "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/s841953703.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s841953703", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let count = Array.make (n + 1) 0 in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun l r ->\n      count.(l - 1) <- count.(l - 1) + 1;\n      count.(r) <- count.(r) - 1;\n  done;\n  for i = 1 to n do\n    count.(i) <- count.(i - 1) + count.(i)\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_right (fun c -> ( + ) @@ if c < m then 0 else 1) count 0", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "sample_input": "4 2\n1 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03037", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 44, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s478541656", "group_id": "codeNet:p03038", "input_text": "(* O((n+m)log(n+m)) *)\nopen Array\nlet n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet a_s = init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a, 1\nlet cbs = init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> b, a\nlet cards = make (n + m) (0, 0)\nlet rec f acc i r =\n  if r <= 0 then acc\n  else\n    let x, c = cards.(i) in\n    f (acc + x * min c r) (i + 1) @@ r - min c r\nlet _ =\n  iteri (fun i a -> cards.(i) <- a) a_s;\n  iteri (fun i cb -> cards.(n + i) <- cb) cbs;\n  sort (fun x y -> compare y x) cards;\n  f 0 0 n |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561947502, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03038.html", "problem_id": "p03038", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03038/input.txt", "sample_output_relpath": "derived/input_output/data/p03038/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03038/OCaml/s478541656.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s478541656", "user_id": "u732304692"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "(* O((n+m)log(n+m)) *)\nopen Array\nlet n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet a_s = init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a, 1\nlet cbs = init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> b, a\nlet cards = make (n + m) (0, 0)\nlet rec f acc i r =\n  if r <= 0 then acc\n  else\n    let x, c = cards.(i) in\n    f (acc + x * min c r) (i + 1) @@ r - min c r\nlet _ =\n  iteri (fun i a -> cards.(i) <- a) a_s;\n  iteri (fun i cb -> cards.(n + i) <- cb) cbs;\n  sort (fun x y -> compare y x) cards;\n  f 0 0 n |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3 2\n5 1 4\n2 3\n1 5\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03038", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 543, "cpu_time_ms": 286, "memory_kb": 12672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s816167231", "group_id": "codeNet:p03038", "input_text": "module MultiSet = struct\n(* 多重集合 *)\n\nmodule type OrderedType =\n  sig\n    type t\n    val compare: t -> t -> int\n  end\n\nmodule 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\nmodule 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 () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let bcs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun b c -> b, c in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( + ) 0 @@\n  IntMultiSet.take_dec n @@\n  Array.fold_right (fun a -> IntMultiSet.add a 1) as_ @@\n  Array.fold_left (fun s (b, c) -> IntMultiSet.add c b s) IntMultiSet.empty bcs", "language": "OCaml", "metadata": {"date": 1558840929, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03038.html", "problem_id": "p03038", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03038/input.txt", "sample_output_relpath": "derived/input_output/data/p03038/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03038/OCaml/s816167231.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816167231", "user_id": "u504158101"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "module MultiSet = struct\n(* 多重集合 *)\n\nmodule type OrderedType =\n  sig\n    type t\n    val compare: t -> t -> int\n  end\n\nmodule 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\nmodule 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 () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let bcs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun b c -> b, c in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left ( + ) 0 @@\n  IntMultiSet.take_dec n @@\n  Array.fold_right (fun a -> IntMultiSet.add a 1) as_ @@\n  Array.fold_left (fun s (b, c) -> IntMultiSet.add c b s) IntMultiSet.empty bcs", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3 2\n5 1 4\n2 3\n1 5\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03038", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9692, "cpu_time_ms": 590, "memory_kb": 33276}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s607414280", "group_id": "codeNet:p03042", "input_text": "let is_month n = 0 < n && n <= 12;;\n\nlet () = Scanf.scanf \"%2d%2d\" (fun s t -> \n  (if (is_month s) && (is_month t) then \"AMBIGUOUS\"\n  else if (is_month s) && (not (is_month t)) then \"MMYY\"\n  else if (not (is_month s)) && (is_month t) then \"YYMM\"\n  else \"NA\") |> print_string\n);;", "language": "OCaml", "metadata": {"date": 1587446721, "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/s607414280.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s607414280", "user_id": "u541055501"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "let is_month n = 0 < n && n <= 12;;\n\nlet () = Scanf.scanf \"%2d%2d\" (fun s t -> \n  (if (is_month s) && (is_month t) then \"AMBIGUOUS\"\n  else if (is_month s) && (not (is_month t)) then \"MMYY\"\n  else if (not (is_month s)) && (is_month t) then \"YYMM\"\n  else \"NA\") |> print_string\n);;", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s858801892", "group_id": "codeNet:p03043", "input_text": "(* O(n * log(k)) *)\nScanf.scanf \"%d %d\" @@ fun n k ->\n  let rec find acc x =\n    if x >= k then acc\n    else find (acc *. 0.5) (x * 2) in\n  let sum = ref 0. in\n  for i = 1 to n do\n    let p = find 1. i in\n    sum := !sum +. p /. float n\n  done;\n  Printf.printf \"%.12f\\n\" !sum", "language": "OCaml", "metadata": {"date": 1558325728, "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/s858801892.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s858801892", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "(* O(n * log(k)) *)\nScanf.scanf \"%d %d\" @@ fun n k ->\n  let rec find acc x =\n    if x >= k then acc\n    else find (acc *. 0.5) (x * 2) in\n  let sum = ref 0. in\n  for i = 1 to n do\n    let p = find 1. i in\n    sum := !sum +. p /. float n\n  done;\n  Printf.printf \"%.12f\\n\" !sum", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 2, "memory_kb": 1920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s949335702", "group_id": "codeNet:p03043", "input_text": "let () =\n    let main () =\n        let n, k = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let log2 j k =\n            let rec loop c i =\n                if c >= k then i else loop (c * 2) (i + 1)\n            in\n            loop j 0\n        in\n        let rec loop i acc =\n            if i = 0 then acc else loop (i - 1) (acc +. 0.5 ** float (log2 i k))\n        in\n        let ans = loop n 0.0 /. float n in\n        Printf.printf \"%.10f\\n\" ans\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1558315548, "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/s949335702.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s949335702", "user_id": "u342443598"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "let () =\n    let main () =\n        let n, k = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let log2 j k =\n            let rec loop c i =\n                if c >= k then i else loop (c * 2) (i + 1)\n            in\n            loop j 0\n        in\n        let rec loop i acc =\n            if i = 0 then acc else loop (i - 1) (acc +. 0.5 ** float (log2 i k))\n        in\n        let ans = loop n 0.0 /. float n in\n        Printf.printf \"%.10f\\n\" ans\n    in\n    main ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 4, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s806127735", "group_id": "codeNet:p03045", "input_text": "let rec find x uf =\n  if uf.(x) < 0 then\n    x\n  else\n    let x' = find uf.(x) uf in\n    uf.(x) <- x';\n    x'\n\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 begin\n      uf.(x) <- uf.(x) + uf.(y);\n      uf.(y) <- x\n    end else begin\n      uf.(y) <- uf.(x) + uf.(y);\n      uf.(x) <- y\n    end\n\nmodule S = Set.Make(struct type t = int let compare = (-) end)\n  \nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let uf = Array.make n (-1) in\n  for i = 1 to m do Scanf.scanf \" %d %d %d\" @@ fun x y _ -> unite (x-1) (y-1) uf done;\n  Array.init n (fun i -> find i uf)\n  |> Array.fold_left (fun s x -> S.add x s) S.empty\n  |> S.cardinal |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1558316093, "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/s806127735.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s806127735", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec find x uf =\n  if uf.(x) < 0 then\n    x\n  else\n    let x' = find uf.(x) uf in\n    uf.(x) <- x';\n    x'\n\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 begin\n      uf.(x) <- uf.(x) + uf.(y);\n      uf.(y) <- x\n    end else begin\n      uf.(y) <- uf.(x) + uf.(y);\n      uf.(x) <- y\n    end\n\nmodule S = Set.Make(struct type t = int let compare = (-) end)\n  \nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let uf = Array.make n (-1) in\n  for i = 1 to m do Scanf.scanf \" %d %d %d\" @@ fun x y _ -> unite (x-1) (y-1) uf done;\n  Array.init n (fun i -> find i uf)\n  |> Array.fold_left (fun s x -> S.add x s) S.empty\n  |> S.cardinal |> Printf.printf \"%d\\n\"\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "sample_input": "3 1\n1 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03045", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 707, "cpu_time_ms": 97, "memory_kb": 7296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s924542580", "group_id": "codeNet:p03047", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n k ->\n    Printf.printf \"%d\" @@ n - k + 1\n", "language": "OCaml", "metadata": {"date": 1557624050, "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/s924542580.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924542580", "user_id": "u604818425"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n k ->\n    Printf.printf \"%d\" @@ n - k + 1\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s520920684", "group_id": "codeNet:p03049", "input_text": "let acc_ab n s =\n  snd @@ Array.fold_left (fun (c, n) c' ->\n    (c', n + if c = 'A' && c' = 'B' then 1 else 0)) ('_', n) @@\n  Array.init (String.length s) (String.get s)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let (a, b, ba) =\n    Array.fold_left (fun (a, b, ba) s ->\n      if s.[0] = 'B' && s.[String.length s - 1] = 'A' then (a, b, ba + 1)\n      else if s.[0] = 'B' then (a, b + 1, ba)\n      else if s.[String.length s - 1] = 'A' then (a + 1, b, ba)\n      else (a, b, ba)) (0, 0, 0) ss in\n  let n = min a @@ min b ba in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left acc_ab 0 ss +\n  if a <= 0 && b <= 0 then max 0 (ba - 1) else ba + min a b", "language": "OCaml", "metadata": {"date": 1557863536, "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/s520920684.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s520920684", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let acc_ab n s =\n  snd @@ Array.fold_left (fun (c, n) c' ->\n    (c', n + if c = 'A' && c' = 'B' then 1 else 0)) ('_', n) @@\n  Array.init (String.length s) (String.get s)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let (a, b, ba) =\n    Array.fold_left (fun (a, b, ba) s ->\n      if s.[0] = 'B' && s.[String.length s - 1] = 'A' then (a, b, ba + 1)\n      else if s.[0] = 'B' then (a, b + 1, ba)\n      else if s.[String.length s - 1] = 'A' then (a + 1, b, ba)\n      else (a, b, ba)) (0, 0, 0) ss in\n  let n = min a @@ min b ba in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left acc_ab 0 ss +\n  if a <= 0 && b <= 0 then max 0 (ba - 1) else ba + min a b", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 714, "cpu_time_ms": 6, "memory_kb": 4864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s376404720", "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 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      (* 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": 1557692794, "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/s376404720.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s376404720", "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 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      (* 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s957609236", "group_id": "codeNet:p03049", "input_text": "open Printf open Scanf\nopen Array\n\nlet print_list f ls = List.iter (fun v -> printf \"%s \" @@ f v) ls; print_newline ()\n\n(* rosetta code *)\nlet count_substring str sub =\n  let sub_len = String.length sub in\n  let len_diff = (String.length str) - sub_len\n  and reg = Str.regexp_string sub in\n  let rec aux i n =\n    if i > len_diff then n else\n      try\n        let pos = Str.search_forward reg str i in\n        aux (pos + sub_len) (succ n)\n      with Not_found -> n\n  in\n  aux 0 0\n\nlet () = scanf \" %d\" @@ fun n ->\n  let arr = init n (fun _ -> scanf \" %s\" @@ fun s -> s)\n  in\n  let kab,kbx,kxa,krest = fold_left (fun (kab,kbx,kxa,krest) 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    let kab = if ab then kab + 1 else kab in\n    let kbx = if not ab then (\n      if bx then kbx+1 else kbx\n    ) else kbx in\n    let kxa = if not ab then (\n      if xa then kxa+1 else kxa\n    ) else kxa in\n    let krest = krest + count_substring s \"AB\"\n    in\n    (kab,kbx,kxa,krest)\n  ) (0,0,0,0) arr in\n  (* printf \"%d %d %d %d\\n\" kab kbx kxa krest; *)\n  let pair_ab = min kxa kbx in\n  let kxa,kbx = kxa - pair_ab, kbx - pair_ab in\n  print_int @@ krest + pair_ab +\n    if kxa > 0 || kbx > 0 then 1 + max (kab - 1) 0\n    else max (kab - 1) 0\n\n\n\n", "language": "OCaml", "metadata": {"date": 1557688574, "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/s957609236.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s957609236", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf open Scanf\nopen Array\n\nlet print_list f ls = List.iter (fun v -> printf \"%s \" @@ f v) ls; print_newline ()\n\n(* rosetta code *)\nlet count_substring str sub =\n  let sub_len = String.length sub in\n  let len_diff = (String.length str) - sub_len\n  and reg = Str.regexp_string sub in\n  let rec aux i n =\n    if i > len_diff then n else\n      try\n        let pos = Str.search_forward reg str i in\n        aux (pos + sub_len) (succ n)\n      with Not_found -> n\n  in\n  aux 0 0\n\nlet () = scanf \" %d\" @@ fun n ->\n  let arr = init n (fun _ -> scanf \" %s\" @@ fun s -> s)\n  in\n  let kab,kbx,kxa,krest = fold_left (fun (kab,kbx,kxa,krest) 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    let kab = if ab then kab + 1 else kab in\n    let kbx = if not ab then (\n      if bx then kbx+1 else kbx\n    ) else kbx in\n    let kxa = if not ab then (\n      if xa then kxa+1 else kxa\n    ) else kxa in\n    let krest = krest + count_substring s \"AB\"\n    in\n    (kab,kbx,kxa,krest)\n  ) (0,0,0,0) arr in\n  (* printf \"%d %d %d %d\\n\" kab kbx kxa krest; *)\n  let pair_ab = min kxa kbx in\n  let kxa,kbx = kxa - pair_ab, kbx - pair_ab in\n  print_int @@ krest + pair_ab +\n    if kxa > 0 || kbx > 0 then 1 + max (kab - 1) 0\n    else max (kab - 1) 0\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1285, "cpu_time_ms": 11, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s979965404", "group_id": "codeNet:p03049", "input_text": "(* O(|s|) *)\nlet string_count s sub =\n  let n = String.length s in\n  let sub_len = String.length sub in\n  let reg = Str.regexp sub in\n  let rec loop acc i =\n    try\n      if i >= n then\n        acc\n      else\n        let j = Str.search_forward reg s i + sub_len in\n        loop (acc + 1) j\n    with\n    | _ -> acc\n  in\n    loop 0 0\n\n(* O(n^2) *)\nlet solve n ss =\n  let b_start, a_end, both, ab = List.fold_left\n    (fun (b_start, a_end, both, ab) s ->\n      let count = string_count s \"AB\" in\n      let new_ab = ab + count in\n      let starts_b = s.[0] = 'B' and ends_a = s.[String.length s - 1] = 'A' in\n      let new_b_start = if starts_b then b_start + 1 else b_start in\n      let new_a_end = if ends_a then a_end + 1 else a_end in\n      if starts_b && ends_a then\n        new_b_start - 1, new_a_end - 1, both + 1, new_ab\n      else\n      new_b_start, new_a_end, both, new_ab)\n    (0, 0, 0, 0)\n    ss\n  in\n    let pair = min b_start a_end in\n    let need = max b_start a_end - pair in\n    let addition = if both <= need then\n        pair + both\n      else\n        (* pair + need + (both - need + 1) / 2 in *)\n        pair + need + (both - need) in\n    addition + ab\n\n(* 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\nlet _ =\n  let n = read_int () in\n  fold_int\n    (fun acc _ -> read_line () :: acc)\n    []\n    n |> solve n |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1557630899, "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/s979965404.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s979965404", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(|s|) *)\nlet string_count s sub =\n  let n = String.length s in\n  let sub_len = String.length sub in\n  let reg = Str.regexp sub in\n  let rec loop acc i =\n    try\n      if i >= n then\n        acc\n      else\n        let j = Str.search_forward reg s i + sub_len in\n        loop (acc + 1) j\n    with\n    | _ -> acc\n  in\n    loop 0 0\n\n(* O(n^2) *)\nlet solve n ss =\n  let b_start, a_end, both, ab = List.fold_left\n    (fun (b_start, a_end, both, ab) s ->\n      let count = string_count s \"AB\" in\n      let new_ab = ab + count in\n      let starts_b = s.[0] = 'B' and ends_a = s.[String.length s - 1] = 'A' in\n      let new_b_start = if starts_b then b_start + 1 else b_start in\n      let new_a_end = if ends_a then a_end + 1 else a_end in\n      if starts_b && ends_a then\n        new_b_start - 1, new_a_end - 1, both + 1, new_ab\n      else\n      new_b_start, new_a_end, both, new_ab)\n    (0, 0, 0, 0)\n    ss\n  in\n    let pair = min b_start a_end in\n    let need = max b_start a_end - pair in\n    let addition = if both <= need then\n        pair + both\n      else\n        (* pair + need + (both - need + 1) / 2 in *)\n        pair + need + (both - need) in\n    addition + ab\n\n(* 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\nlet _ =\n  let n = read_int () in\n  fold_int\n    (fun acc _ -> read_line () :: acc)\n    []\n    n |> solve n |> string_of_int |> print_endline", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1438, "cpu_time_ms": 12, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s612811559", "group_id": "codeNet:p03050", "input_text": "let n = read_int ()\nlet i, ans = ref 1, ref 0\nlet f m = if m > 0 && n / m = n mod m then ans := !ans + m\nlet _ =\n  while !i * !i <= n do if n mod !i = 0 then (f @@ !i - 1; f @@ n / !i - 1); incr i done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562403615, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03050.html", "problem_id": "p03050", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03050/input.txt", "sample_output_relpath": "derived/input_output/data/p03050/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03050/OCaml/s612811559.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612811559", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let n = read_int ()\nlet i, ans = ref 1, ref 0\nlet f m = if m > 0 && n / m = n mod m then ans := !ans + m\nlet _ =\n  while !i * !i <= n do if n mod !i = 0 then (f @@ !i - 1; f @@ n / !i - 1); incr i done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "sample_input": "8\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03050", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 13, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s438454703", "group_id": "codeNet:p03059", "input_text": "open Scanf\nopen Printf\n\nlet (a, b, t) = sscanf (read_line ()) \"%d %d %d\" (fun x y z -> (x, y, z));;\n\nprintf \"%d\\n\" (b * (t / a))", "language": "OCaml", "metadata": {"date": 1556414983, "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/s438454703.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s438454703", "user_id": "u321043950"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet (a, b, t) = sscanf (read_line ()) \"%d %d %d\" (fun x y z -> (x, y, z));;\n\nprintf \"%d\\n\" (b * (t / a))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s059816259", "group_id": "codeNet:p03059", "input_text": "let _ =\n  let a, b, t = Scanf.scanf \"%f %d %f\\n\" (fun a b t -> a, b, t) in\n  ((t +. 0.5) /. a)\n  |> int_of_float\n  |> ( * ) b\n  |> print_int\n", "language": "OCaml", "metadata": {"date": 1556413490, "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/s059816259.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s059816259", "user_id": "u387591304"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let _ =\n  let a, b, t = Scanf.scanf \"%f %d %f\\n\" (fun a b t -> a, b, t) in\n  ((t +. 0.5) /. a)\n  |> int_of_float\n  |> ( * ) b\n  |> print_int\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s498245449", "group_id": "codeNet:p03059", "input_text": "let () =\n\tScanf.scanf \"%d %d %d\\n\"\n\t(fun a b t ->\n\t\tlet tt = (float_of_int t) +. 0.5 in\n\t\tlet aa = (float_of_int a) in\n\t\t(int_of_float (tt /. aa)) * b) |> print_int\n", "language": "OCaml", "metadata": {"date": 1556413460, "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/s498245449.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s498245449", "user_id": "u307426615"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n\tScanf.scanf \"%d %d %d\\n\"\n\t(fun a b t ->\n\t\tlet tt = (float_of_int t) +. 0.5 in\n\t\tlet aa = (float_of_int a) in\n\t\t(int_of_float (tt /. aa)) * b) |> print_int\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s539207568", "group_id": "codeNet:p03060", "input_text": "open Printf open Scanf\nopen Array\n\nlet () = scanf \" %d\" @@ fun n ->\n  init n (fun _ -> scanf \" %d\" @@ fun v -> v)\n  |> map (fun v -> scanf \" %d\" @@ fun c -> max (v-c) 0)\n  |> fold_left (+) 0\n  |> print_int\n", "language": "OCaml", "metadata": {"date": 1556460714, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03060.html", "problem_id": "p03060", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03060/input.txt", "sample_output_relpath": "derived/input_output/data/p03060/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03060/OCaml/s539207568.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539207568", "user_id": "u481480055"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Printf open Scanf\nopen Array\n\nlet () = scanf \" %d\" @@ fun n ->\n  init n (fun _ -> scanf \" %d\" @@ fun v -> v)\n  |> map (fun v -> scanf \" %d\" @@ fun c -> max (v-c) 0)\n  |> fold_left (+) 0\n  |> print_int\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "sample_input": "3\n10 2 5\n6 3 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03060", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 206, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s580109520", "group_id": "codeNet:p03060", "input_text": "let () =\n\tlet n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n\tlet v = Array.to_list (Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n\tlet  c = Array.to_list (Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n\tlet sabun = List.map2 (fun a b -> a -b) v c in\n\tList.fold_left (fun a b -> if b > 0 then a + b else a) 0 sabun\n\t|> print_int\n", "language": "OCaml", "metadata": {"date": 1556413892, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03060.html", "problem_id": "p03060", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03060/input.txt", "sample_output_relpath": "derived/input_output/data/p03060/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03060/OCaml/s580109520.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s580109520", "user_id": "u307426615"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () =\n\tlet n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n\tlet v = Array.to_list (Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n\tlet  c = Array.to_list (Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n\tlet sabun = List.map2 (fun a b -> a -b) v c in\n\tList.fold_left (fun a b -> if b > 0 then a + b else a) 0 sabun\n\t|> print_int\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "sample_input": "3\n10 2 5\n6 3 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03060", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s161210196", "group_id": "codeNet:p03062", "input_text": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (fun x y -> abs x - abs y) a;\n\n  let s = Array.fold_left (fun x y -> x + abs y) 0 a in\n  let c = Array.fold_left (fun x y -> if y < 0 then x+1 else x) 0 a in\n  Printf.printf \"%d\\n\" (if c mod 2 = 0 then s else s - 2 * abs a.(0))", "language": "OCaml", "metadata": {"date": 1556414560, "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/s161210196.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s161210196", "user_id": "u798181098"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (fun x y -> abs x - abs y) a;\n\n  let s = Array.fold_left (fun x y -> x + abs y) 0 a in\n  let c = Array.fold_left (fun x y -> if y < 0 then x+1 else x) 0 a in\n  Printf.printf \"%d\\n\" (if c mod 2 = 0 then s else s - 2 * abs a.(0))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 80, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751225662", "group_id": "codeNet:p03067", "input_text": "let () =\n\tScanf.scanf \"%d %d %d\\n\"\n\t(fun a b c -> if a < c && c < b then \"Yes \" else \"No \")\n\t|> print_string", "language": "OCaml", "metadata": {"date": 1555809942, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03067.html", "problem_id": "p03067", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03067/input.txt", "sample_output_relpath": "derived/input_output/data/p03067/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03067/OCaml/s751225662.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s751225662", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n\tScanf.scanf \"%d %d %d\\n\"\n\t(fun a b c -> if a < c && c < b then \"Yes \" else \"No \")\n\t|> print_string", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "sample_input": "3 8 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03067", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751921209", "group_id": "codeNet:p03067", "input_text": "let _ =\n  let a, b, c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\n  print_string @@ if a <= c && c <= b then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1555808519, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03067.html", "problem_id": "p03067", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03067/input.txt", "sample_output_relpath": "derived/input_output/data/p03067/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03067/OCaml/s751921209.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s751921209", "user_id": "u387591304"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let _ =\n  let a, b, c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\n  print_string @@ if a <= c && c <= b then \"Yes\" else \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "sample_input": "3 8 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03067", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 133, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s895305626", "group_id": "codeNet:p03069", "input_text": "open Printf open Scanf\nopen Array\n\nlet print_array f a = Array.iter (fun v -> printf \"%s \" @@ f v) a; print_newline ()\n\nlet () = scanf \" %d %s\" @@ fun n s ->\n  let a = init n (fun i -> s.[i]) in\n  let res = ref 0 in\n  let rec lp i black =\n    let rec lp2 i =\n      if i<n && a.(i) = '.' then lp2 (i+1)\n      else i\n    in\n    if i=n then ()\n    else if a.(i-1) = '#' && black > 0\n      && a.(i) = '.' then (\n      let j = lp2 @@ i+1 in\n      let white = j - i in\n      if black >= white then (\n        res := !res + white;\n        lp j (black + white);\n      ) else (\n        res := !res + black;\n        lp j 0;\n      );\n    ) else lp (i+1) (black + if a.(i) = '#' then 1 else 0)\n  in\n  lp 1 (if a.(0) = '#' then 1 else 0);\n  print_int !res;", "language": "OCaml", "metadata": {"date": 1556472703, "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/s895305626.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s895305626", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf open Scanf\nopen Array\n\nlet print_array f a = Array.iter (fun v -> printf \"%s \" @@ f v) a; print_newline ()\n\nlet () = scanf \" %d %s\" @@ fun n s ->\n  let a = init n (fun i -> s.[i]) in\n  let res = ref 0 in\n  let rec lp i black =\n    let rec lp2 i =\n      if i<n && a.(i) = '.' then lp2 (i+1)\n      else i\n    in\n    if i=n then ()\n    else if a.(i-1) = '#' && black > 0\n      && a.(i) = '.' then (\n      let j = lp2 @@ i+1 in\n      let white = j - i in\n      if black >= white then (\n        res := !res + white;\n        lp j (black + white);\n      ) else (\n        res := !res + black;\n        lp j 0;\n      );\n    ) else lp (i+1) (black + if a.(i) = '#' then 1 else 0)\n  in\n  lp 1 (if a.(0) = '#' then 1 else 0);\n  print_int !res;", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 742, "cpu_time_ms": 9, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s030610141", "group_id": "codeNet:p03071", "input_text": "let button a b =\n  if a = b then a + b else (max a b) * 2 - 1\n\nlet () = Scanf.scanf \"%d %d\" button |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595786669, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s030610141.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s030610141", "user_id": "u272377260"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let button a b =\n  if a = b then a + b else (max a b) * 2 - 1\n\nlet () = Scanf.scanf \"%d %d\" button |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 8, "memory_kb": 3772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s796844864", "group_id": "codeNet:p03071", "input_text": "let () = Scanf.scanf \"%d %d\" (fun a b -> (\n  (if a = b then a + b\n  else if a > b then 2 * a - 1\n  else 2 * b - 1)\n  |> print_int;\n));;", "language": "OCaml", "metadata": {"date": 1587423623, "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/s796844864.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796844864", "user_id": "u541055501"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" (fun a b -> (\n  (if a = b then a + b\n  else if a > b then 2 * a - 1\n  else 2 * b - 1)\n  |> print_int;\n));;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s823873414", "group_id": "codeNet:p03071", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a with\n  | a when a = b -> print_endline (string_of_int (a * 2))\n  | a when a > b -> print_endline (string_of_int (a + (a-1)))\n  | _ -> print_endline (string_of_int (b + (b-1)))\n)", "language": "OCaml", "metadata": {"date": 1584018387, "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/s823873414.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s823873414", "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 -> print_endline (string_of_int (a * 2))\n  | a when a > b -> print_endline (string_of_int (a + (a-1)))\n  | _ -> print_endline (string_of_int (b + (b-1)))\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 243, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s226898968", "group_id": "codeNet:p03073", "input_text": "let solve = Array.fold_left (fun ((c, c'), n) d ->\n  (c', c), n + if c = d then 1 else 0)\n\nlet () =\n  let s = read_line () in\n  let s = Array.init (String.length s) (String.get s) in\n  Printf.printf \"%d\\n\" @@ min\n    (snd @@ solve (('0', '1'), 0) s)\n    (snd @@ solve (('1', '0'), 0) s)", "language": "OCaml", "metadata": {"date": 1555182618, "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/s226898968.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s226898968", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let solve = Array.fold_left (fun ((c, c'), n) d ->\n  (c', c), n + if c = d then 1 else 0)\n\nlet () =\n  let s = read_line () in\n  let s = Array.init (String.length s) (String.get s) in\n  Printf.printf \"%d\\n\" @@ min\n    (snd @@ solve (('0', '1'), 0) s)\n    (snd @@ solve (('1', '0'), 0) s)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 286, "cpu_time_ms": 6, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s179036452", "group_id": "codeNet:p03074", "input_text": "open Scanf\nopen Printf\n\nlet (n,k) = sscanf (read_line ()) \"%d %d\" (fun x y -> (x,y));;\nlet str = sscanf (read_line ()) \"%s\" (fun x -> x);;\n\nlet string2cnt_array s =\n  let len = String.length s in\n  let array = Array.make len (0,'0') in\n  let rec loop i c num cnt =\n    if (i = len) then\n      let () = array.(num) <- (cnt,c) in\n      let ret = Array.make (num+1) (0,'0') in\n      let () = Array.blit array 0 ret 0 (num+1) in\n      ret\n    else if (s.[i] = c) then\n      loop (i+1) c num (cnt+1)\n    else\n      let () = array.(num) <- (cnt,c) in\n      loop (i+1) (s.[i]) (num+1) 1\n    in loop 0 s.[0] 0 0;;\n\n\nlet cnt_array = string2cnt_array str;;\nlet len = Array.length cnt_array;;\nlet ruiseki = Array.make len 0;;\nlet () = ruiseki.(0) <- fst cnt_array.(0) in\nfor i = 1 to len - 1 do\n  ruiseki.(i) <- ruiseki.(i-1) + (fst cnt_array.(i))\ndone\n\nlet rec solve i ans =\n  if i = len then ans\n  else\n    let num = if snd cnt_array.(i) = '0' then 0 else 1 in\n    let target = 2 * k - (1 - num) + i in\n    let si = min (len - 1) target in\n    let ruiseki_minus = if i = 0 then 0 else ruiseki.(i-1) in\n    let next_ans = max ans (ruiseki.(si) - ruiseki_minus) in\n    solve (i+1) next_ans;;\n\nprintf (\"%d\\n\") (solve 0 0);;", "language": "OCaml", "metadata": {"date": 1555714952, "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/s179036452.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179036452", "user_id": "u947517859"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet (n,k) = sscanf (read_line ()) \"%d %d\" (fun x y -> (x,y));;\nlet str = sscanf (read_line ()) \"%s\" (fun x -> x);;\n\nlet string2cnt_array s =\n  let len = String.length s in\n  let array = Array.make len (0,'0') in\n  let rec loop i c num cnt =\n    if (i = len) then\n      let () = array.(num) <- (cnt,c) in\n      let ret = Array.make (num+1) (0,'0') in\n      let () = Array.blit array 0 ret 0 (num+1) in\n      ret\n    else if (s.[i] = c) then\n      loop (i+1) c num (cnt+1)\n    else\n      let () = array.(num) <- (cnt,c) in\n      loop (i+1) (s.[i]) (num+1) 1\n    in loop 0 s.[0] 0 0;;\n\n\nlet cnt_array = string2cnt_array str;;\nlet len = Array.length cnt_array;;\nlet ruiseki = Array.make len 0;;\nlet () = ruiseki.(0) <- fst cnt_array.(0) in\nfor i = 1 to len - 1 do\n  ruiseki.(i) <- ruiseki.(i-1) + (fst cnt_array.(i))\ndone\n\nlet rec solve i ans =\n  if i = len then ans\n  else\n    let num = if snd cnt_array.(i) = '0' then 0 else 1 in\n    let target = 2 * k - (1 - num) + i in\n    let si = min (len - 1) target in\n    let ruiseki_minus = if i = 0 then 0 else ruiseki.(i-1) in\n    let next_ans = max ans (ruiseki.(si) - ruiseki_minus) in\n    solve (i+1) next_ans;;\n\nprintf (\"%d\\n\") (solve 0 0);;", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1211, "cpu_time_ms": 17, "memory_kb": 7168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s041563113", "group_id": "codeNet:p03075", "input_text": "let () = Scanf.scanf \"%d\\n%d\\n%d\\n%d\\n%d\\n%d\" (fun a b c d e k -> (\n  (if e > a + k then \":(\"\n  else \"Yay!\") |> print_string\n));;", "language": "OCaml", "metadata": {"date": 1587425443, "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/s041563113.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s041563113", "user_id": "u541055501"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n%d\\n%d\\n%d\\n%d\\n%d\" (fun a b c d e k -> (\n  (if e > a + k then \":(\"\n  else \"Yay!\") |> print_string\n));;", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676110574", "group_id": "codeNet:p03076", "input_text": "let () =\n  let ts = Array.init 5 @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let sum = Array.fold_left (fun acc elt -> acc + (elt + 9) / 10 * 10) 0 ts in\n  let ans = ( - ) sum @@ Array.fold_left (fun acc elt -> max acc @@ ((elt + 9) / 10 * 10) - elt) 0 ts in\n  Printf.printf \"%d\\n\" ans\n\n  ", "language": "OCaml", "metadata": {"date": 1598455665, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s676110574.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676110574", "user_id": "u052332717"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "let () =\n  let ts = Array.init 5 @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let sum = Array.fold_left (fun acc elt -> acc + (elt + 9) / 10 * 10) 0 ts in\n  let ans = ( - ) sum @@ Array.fold_left (fun acc elt -> max acc @@ ((elt + 9) / 10 * 10) - elt) 0 ts in\n  Printf.printf \"%d\\n\" ans\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s825721589", "group_id": "codeNet:p03076", "input_text": "(* O(1) *)\nlet get_wait_time cook_time = let m = cook_time mod 10 in if m = 0 then 0 else 10 - m\nlet get_next_time cook_time = cook_time + get_wait_time cook_time\n\n(* O(|dishes|) *)\nlet solve dishes =\n  let max_wait = List.map get_wait_time dishes |> List.fold_left max 0 in\n  let sum = List.map get_next_time dishes |> List.fold_left (+) 0 in\n  sum - max_wait\n\nlet read_int_array n = Array.init n (fun _ -> read_int ())\nlet read_ints n = read_int_array n |> Array.to_list\n\nlet _ = read_ints 5 |> solve |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1557763509, "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/s825721589.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s825721589", "user_id": "u732304692"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "(* O(1) *)\nlet get_wait_time cook_time = let m = cook_time mod 10 in if m = 0 then 0 else 10 - m\nlet get_next_time cook_time = cook_time + get_wait_time cook_time\n\n(* O(|dishes|) *)\nlet solve dishes =\n  let max_wait = List.map get_wait_time dishes |> List.fold_left max 0 in\n  let sum = List.map get_next_time dishes |> List.fold_left (+) 0 in\n  sum - max_wait\n\nlet read_int_array n = Array.init n (fun _ -> read_int ())\nlet read_ints n = read_int_array n |> Array.to_list\n\nlet _ = read_ints 5 |> solve |> string_of_int |> print_endline", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "sample_input": "29\n20\n7\n35\n120\n"}, "reference_outputs": ["215\n"], "source_document_id": "p03076", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s111860213", "group_id": "codeNet:p03076", "input_text": "let () = Scanf.scanf \"%d %d %d %d %d\" @@ fun a b c d e ->\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun acc a -> acc + a + 9 - (a + 9) mod 10) 0 [a; b; c; d; e]\n  - List.fold_left (fun acc a -> max acc (9 - (a + 9) mod 10)) 0 [a; b; c; d; e]\n", "language": "OCaml", "metadata": {"date": 1554586963, "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/s111860213.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111860213", "user_id": "u504158101"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d %d\" @@ fun a b c d e ->\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun acc a -> acc + a + 9 - (a + 9) mod 10) 0 [a; b; c; d; e]\n  - List.fold_left (fun acc a -> max acc (9 - (a + 9) mod 10)) 0 [a; b; c; d; e]\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s271925600", "group_id": "codeNet:p03077", "input_text": "let () = Printf.printf \"%d\\n\" @@\n  Scanf.scanf \"%d %d %d %d %d %d\" @@ fun n a b c d e ->\n  let w = List.fold_left min a [a;b;c;d;e] in\n  4 + (n + w - 1) / w", "language": "OCaml", "metadata": {"date": 1554599558, "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/s271925600.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271925600", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let () = Printf.printf \"%d\\n\" @@\n  Scanf.scanf \"%d %d %d %d %d %d\" @@ fun n a b c d e ->\n  let w = List.fold_left min a [a;b;c;d;e] in\n  4 + (n + w - 1) / w", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "5\n3\n2\n4\n3\n5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03077", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s585500396", "group_id": "codeNet:p03078", "input_text": "let kABCMax = 3000\nlet x, y, z, k = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet a_s = Array.init x @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet bs = Array.init y @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet cs = Array.init z @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ab_s = Array.make kABCMax 0\nlet ans = Array.make (kABCMax * z) 0\nlet _ =\n  for i = 0 to x - 1 do\n    for j = 0 to y - 1 do\n      if i * y + j < kABCMax then\n        ab_s.(i * y + j) <- a_s.(i) + bs.(j) done done;\n  for i = 0 to kABCMax - 1 do\n    for j = 0 to z - 1 do\n      ans.(i * z + j) <- ab_s.(i) + cs.(j) done done;\n  Array.sort (fun x y -> y - x) ans;\n  for i = 0 to k - 1 do\n    Printf.printf \"%d\\n\" ans.(i) done", "language": "OCaml", "metadata": {"date": 1561251934, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/OCaml/s585500396.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s585500396", "user_id": "u732304692"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "let kABCMax = 3000\nlet x, y, z, k = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet a_s = Array.init x @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet bs = Array.init y @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet cs = Array.init z @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ab_s = Array.make kABCMax 0\nlet ans = Array.make (kABCMax * z) 0\nlet _ =\n  for i = 0 to x - 1 do\n    for j = 0 to y - 1 do\n      if i * y + j < kABCMax then\n        ab_s.(i * y + j) <- a_s.(i) + bs.(j) done done;\n  for i = 0 to kABCMax - 1 do\n    for j = 0 to z - 1 do\n      ans.(i * z + j) <- ab_s.(i) + cs.(j) done done;\n  Array.sort (fun x y -> y - x) ans;\n  for i = 0 to k - 1 do\n    Printf.printf \"%d\\n\" ans.(i) done", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 701, "cpu_time_ms": 1359, "memory_kb": 28412}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s450444381", "group_id": "codeNet:p03078", "input_text": "open Batteries\n\nlet xyzk = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet (x, y, z, k) = match xyzk with\n   [x; y; z; k] -> (x, y, z, k)\n | _ -> (1, 1, 1, 1)\nlet a = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet b = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet c = List.map int_of_string (String.split_on_char ' ' (read_line()))\n         \nlet sumlist lst1 lst2 lst3 =\n  let rec hojo p q r n =\n  if n < 3000 then\n    if p < x then\n      if q < y then\n        if r < z then\n          let ap = List.nth lst1 p in\n          let bq = List.nth lst2 q in\n          let cr = List.nth lst3 r in\n          let sumall = ap + bq + cr in\n          sumall :: hojo p q (r+1) (n+1)\n        else hojo p (q+1) 0 (n+1)\n      else hojo (p+1) 0 0 (n+1)\n    else [] \n  else [] in\n  hojo 0 0 0 0\n\nlet rec ins_sort lst = match lst with\n    [] -> []\n  | first :: rest ->\n     let rec insert n lst = match lst with\n         [] -> [n]\n       | first :: rest -> if n >= first then n :: insert first rest\n                          else first :: insert n rest in\n     insert first (ins_sort rest)\n\nlet last = ins_sort (sumlist a b c)\nlet rec answer i = if i < k then (print_int (List.nth last i);\n                                  print_string \"\\n\";\n                                  answer (i+1))\n                   else ()\nlet () = answer 0", "language": "OCaml", "metadata": {"date": 1556909082, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/OCaml/s450444381.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s450444381", "user_id": "u769620184"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "open Batteries\n\nlet xyzk = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet (x, y, z, k) = match xyzk with\n   [x; y; z; k] -> (x, y, z, k)\n | _ -> (1, 1, 1, 1)\nlet a = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet b = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet c = List.map int_of_string (String.split_on_char ' ' (read_line()))\n         \nlet sumlist lst1 lst2 lst3 =\n  let rec hojo p q r n =\n  if n < 3000 then\n    if p < x then\n      if q < y then\n        if r < z then\n          let ap = List.nth lst1 p in\n          let bq = List.nth lst2 q in\n          let cr = List.nth lst3 r in\n          let sumall = ap + bq + cr in\n          sumall :: hojo p q (r+1) (n+1)\n        else hojo p (q+1) 0 (n+1)\n      else hojo (p+1) 0 0 (n+1)\n    else [] \n  else [] in\n  hojo 0 0 0 0\n\nlet rec ins_sort lst = match lst with\n    [] -> []\n  | first :: rest ->\n     let rec insert n lst = match lst with\n         [] -> [n]\n       | first :: rest -> if n >= first then n :: insert first rest\n                          else first :: insert n rest in\n     insert first (ins_sort rest)\n\nlet last = ins_sort (sumlist a b c)\nlet rec answer i = if i < k then (print_int (List.nth last i);\n                                  print_string \"\\n\";\n                                  answer (i+1))\n                   else ()\nlet () = answer 0", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1378, "cpu_time_ms": 90, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s021096267", "group_id": "codeNet:p03078", "input_text": "open Batteries\n\nlet xyzk = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet (x, y, z, k) = match xyzk with\n   [x; y; z; k] -> (x, y, z, k)\n | _ -> (1, 1, 1, 1)\nlet a = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet b = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet c = List.map int_of_string (String.split_on_char ' ' (read_line()))\n         \nlet sumlist lst1 lst2 lst3 =\n  let rec hojo p q r =    \n    if p < x then\n      if q < y then\n        if r < z then\n          let ap = List.nth lst1 p in\n          let bq = List.nth lst2 q in\n          let cr = List.nth lst3 r in\n          let sumall = ap + bq + cr in\n          sumall :: hojo p q (r+1)\n        else hojo p (q+1) 0\n      else hojo (p+1) 0 0\n    else [] in\n  hojo 0 0 0\n\nlet rec ins_sort lst = match lst with\n    [] -> []\n  | first :: rest ->\n     let rec insert n lst = match lst with\n         [] -> [n]\n       | first :: rest -> if n >= first then n :: insert first rest\n                          else first :: insert n rest in\n     insert first (ins_sort rest)\n\nlet last = ins_sort (sumlist a b c)\nlet rec answer i = if i < k then (print_int (List.nth last i);\n                                  print_string \"\\n\";\n                                  answer (i+1))\n                   else ()\nlet () = answer 0", "language": "OCaml", "metadata": {"date": 1556908128, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/OCaml/s021096267.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s021096267", "user_id": "u769620184"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "open Batteries\n\nlet xyzk = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet (x, y, z, k) = match xyzk with\n   [x; y; z; k] -> (x, y, z, k)\n | _ -> (1, 1, 1, 1)\nlet a = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet b = List.map int_of_string (String.split_on_char ' ' (read_line()))\nlet c = List.map int_of_string (String.split_on_char ' ' (read_line()))\n         \nlet sumlist lst1 lst2 lst3 =\n  let rec hojo p q r =    \n    if p < x then\n      if q < y then\n        if r < z then\n          let ap = List.nth lst1 p in\n          let bq = List.nth lst2 q in\n          let cr = List.nth lst3 r in\n          let sumall = ap + bq + cr in\n          sumall :: hojo p q (r+1)\n        else hojo p (q+1) 0\n      else hojo (p+1) 0 0\n    else [] in\n  hojo 0 0 0\n\nlet rec ins_sort lst = match lst with\n    [] -> []\n  | first :: rest ->\n     let rec insert n lst = match lst with\n         [] -> [n]\n       | first :: rest -> if n >= first then n :: insert first rest\n                          else first :: insert n rest in\n     insert first (ins_sort rest)\n\nlet last = ins_sort (sumlist a b c)\nlet rec answer i = if i < k then (print_int (List.nth last i);\n                                  print_string \"\\n\";\n                                  answer (i+1))\n                   else ()\nlet () = answer 0", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1330, "cpu_time_ms": 2114, "memory_kb": 105856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s305341196", "group_id": "codeNet:p03080", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet f x s = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet r = f 'R' s\nlet _ = print_endline @@ if r > n - r then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1563098855, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03080.html", "problem_id": "p03080", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03080/input.txt", "sample_output_relpath": "derived/input_output/data/p03080/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03080/OCaml/s305341196.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305341196", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet f x s = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet r = f 'R' s\nlet _ = print_endline @@ if r > n - r then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "sample_input": "4\nRRBR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03080", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s371405263", "group_id": "codeNet:p03081", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\nlet read_int _ = bscanf Scanning.stdin \" %d \" id\nlet read_str _ = bscanf Scanning.stdin \" %s \" id\nlet read_pair _ = bscanf Scanning.stdin \" %c %c \" (fun x y -> (x,y))\n\nlet check s m inst dir =\n  let n = String.length s in\n  let rec check' i = function\n    | _ when i = -1 || i = n -> true\n    | [] -> false\n    | (t,d)::rest ->\n      if t = s.[i]\n      then check' (if d = dir then i-1 else i+1) rest\n      else check' i rest\n  in check' m inst\n\nlet rec binary_search s l r inst d = match r - l = 1 with\n    | true -> l\n    | false ->\n      let m = (l + r) / 2 in\n      let (l',r') = if check s m inst d then (m, r) else (l, m) in\n      binary_search s l' r' inst d\n\nlet rev_str s =\n  let n = String.length s in\n  String.init n (fun i -> s.[n-i-1])\n\nlet () =\n  let n = read_int () in\n  let q = read_int () in\n  let s = read_str () in\n  let inst = Array.(init q read_pair |> to_list) in\n  let l = binary_search s (-1) n inst 'L' + 1 in\n  let r = binary_search (rev_str s) (-1) n inst 'R' + 1 in\n  printf \"%d\\n\" (max 0 (n - r - l))\n", "language": "OCaml", "metadata": {"date": 1554027970, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03081.html", "problem_id": "p03081", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03081/input.txt", "sample_output_relpath": "derived/input_output/data/p03081/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03081/OCaml/s371405263.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s371405263", "user_id": "u806601169"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\nlet read_int _ = bscanf Scanning.stdin \" %d \" id\nlet read_str _ = bscanf Scanning.stdin \" %s \" id\nlet read_pair _ = bscanf Scanning.stdin \" %c %c \" (fun x y -> (x,y))\n\nlet check s m inst dir =\n  let n = String.length s in\n  let rec check' i = function\n    | _ when i = -1 || i = n -> true\n    | [] -> false\n    | (t,d)::rest ->\n      if t = s.[i]\n      then check' (if d = dir then i-1 else i+1) rest\n      else check' i rest\n  in check' m inst\n\nlet rec binary_search s l r inst d = match r - l = 1 with\n    | true -> l\n    | false ->\n      let m = (l + r) / 2 in\n      let (l',r') = if check s m inst d then (m, r) else (l, m) in\n      binary_search s l' r' inst d\n\nlet rev_str s =\n  let n = String.length s in\n  String.init n (fun i -> s.[n-i-1])\n\nlet () =\n  let n = read_int () in\n  let q = read_int () in\n  let s = read_str () in\n  let inst = Array.(init q read_pair |> to_list) in\n  let l = binary_search s (-1) n inst 'L' + 1 in\n  let r = binary_search (rev_str s) (-1) n inst 'R' + 1 in\n  printf \"%d\\n\" (max 0 (n - r - l))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "sample_input": "3 4\nABC\nA L\nB L\nB R\nA R\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03081", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1067, "cpu_time_ms": 146, "memory_kb": 13184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s926313220", "group_id": "codeNet:p03086", "input_text": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet s = scan \"%s\" identity\n\nlet () =\n  let n = String.length s in\n  Enum.Labels.map (0 --^ n)\n    ~f:(fun i ->\n        Enum.Labels.map (1 -- n) ~f:(fun j ->\n            if i < j then\n              let sub = String.slice ~first:i ~last:j s  in\n              if Enum.for_all (String.contains \"AGTC\") @@ String.enum sub then\n                j - i\n              else 0\n            else\n              0))\n  |> Enum.concat\n  |> Enum.reduce max\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1586782986, "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/s926313220.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926313220", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet s = scan \"%s\" identity\n\nlet () =\n  let n = String.length s in\n  Enum.Labels.map (0 --^ n)\n    ~f:(fun i ->\n        Enum.Labels.map (1 -- n) ~f:(fun j ->\n            if i < j then\n              let sub = String.slice ~first:i ~last:j s  in\n              if Enum.for_all (String.contains \"AGTC\") @@ String.enum sub then\n                j - i\n              else 0\n            else\n              0))\n  |> Enum.concat\n  |> Enum.reduce max\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 947, "cpu_time_ms": 2, "memory_kb": 3200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s616866040", "group_id": "codeNet:p03086", "input_text": "let s = read_line ()\nlet rec f i m c = String.(if i >= length s then max m c else if contains \"ACGT\" s.[i] then f (i + 1) m (c + 1) else f (i + 1) (max m c) 0)\nlet _ = f 0 0 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1567666729, "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/s616866040.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s616866040", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let s = read_line ()\nlet rec f i m c = String.(if i >= length s then max m c else if contains \"ACGT\" s.[i] then f (i + 1) m (c + 1) else f (i + 1) (max m c) 0)\nlet _ = f 0 0 0 |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 199, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s741852529", "group_id": "codeNet:p03088", "input_text": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\n\nmodule StringMap = Map.Make (String)\n\nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  let dp = Array.make (n + 1) StringMap.empty in\n  dp.(3) <-\n    List.fold_left (List.fold_left (List.fold_left (List.fold_left (fun m s -> StringMap.add s 1 m)))) StringMap.empty @@\n    List.map (fun c1 ->\n      List.map (fun c2 ->\n        List.map (fun c3 ->\n          if\n            c1 = 'A' && c2 = 'G' && c3 = 'C' ||\n            c1 = 'A' && c3 = 'G' && c2 = 'C' ||\n            c2 = 'A' && c1 = 'G' && c3 = 'C'\n          then []\n          else [String.init 3 (function 0 -> c1 | 1 -> c2 | 2 -> c3)])\n      ['A'; 'C'; 'G'; 'T']) ['A'; 'C'; 'G'; 'T']) ['A'; 'C'; 'G'; 'T'];\n  for i = 4 to n do\n    dp.(i) <- StringMap.fold (fun s n ->\n      List.fold_right (fun c m ->\n        if \n          s.[1] = 'A' && s.[2] = 'G' && c = 'C' ||\n          s.[0] = 'A' && s.[2] = 'G' && c = 'C' ||\n          s.[2] = 'A' && s.[1] = 'G' && c = 'C' ||\n          s.[0] = 'A' && s.[1] = 'G' && c = 'C' ||\n          s.[1] = 'A' && c = 'G' && s.[2] = 'C'\n        then m\n        else\n          let s' = String.sub s 1 2 ^ String.make 1 c in\n          StringMap.add s' (n +^ try StringMap.find s' m with Not_found -> 0) m) ['A'; 'C'; 'G'; 'T']) dp.(i - 1) StringMap.empty\n  done;\n  Printf.printf \"%d\\n\" @@ StringMap.fold (fun _ -> ( +^ )) dp.(n) 0\n", "language": "OCaml", "metadata": {"date": 1553467787, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03088.html", "problem_id": "p03088", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03088/input.txt", "sample_output_relpath": "derived/input_output/data/p03088/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03088/OCaml/s741852529.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s741852529", "user_id": "u504158101"}, "prompt_components": {"gold_output": "61\n", "input_to_evaluate": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\n\nmodule StringMap = Map.Make (String)\n\nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  let dp = Array.make (n + 1) StringMap.empty in\n  dp.(3) <-\n    List.fold_left (List.fold_left (List.fold_left (List.fold_left (fun m s -> StringMap.add s 1 m)))) StringMap.empty @@\n    List.map (fun c1 ->\n      List.map (fun c2 ->\n        List.map (fun c3 ->\n          if\n            c1 = 'A' && c2 = 'G' && c3 = 'C' ||\n            c1 = 'A' && c3 = 'G' && c2 = 'C' ||\n            c2 = 'A' && c1 = 'G' && c3 = 'C'\n          then []\n          else [String.init 3 (function 0 -> c1 | 1 -> c2 | 2 -> c3)])\n      ['A'; 'C'; 'G'; 'T']) ['A'; 'C'; 'G'; 'T']) ['A'; 'C'; 'G'; 'T'];\n  for i = 4 to n do\n    dp.(i) <- StringMap.fold (fun s n ->\n      List.fold_right (fun c m ->\n        if \n          s.[1] = 'A' && s.[2] = 'G' && c = 'C' ||\n          s.[0] = 'A' && s.[2] = 'G' && c = 'C' ||\n          s.[2] = 'A' && s.[1] = 'G' && c = 'C' ||\n          s.[0] = 'A' && s.[1] = 'G' && c = 'C' ||\n          s.[1] = 'A' && c = 'G' && s.[2] = 'C'\n        then m\n        else\n          let s' = String.sub s 1 2 ^ String.make 1 c in\n          StringMap.add s' (n +^ try StringMap.find s' m with Not_found -> 0) m) ['A'; 'C'; 'G'; 'T']) dp.(i - 1) StringMap.empty\n  done;\n  Printf.printf \"%d\\n\" @@ StringMap.fold (fun _ -> ( +^ )) dp.(n) 0\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Find the number of strings of length N that satisfy the following conditions, modulo 10^9+7:\n\nThe string does not contain characters other than A, C, G and T.\n\nThe string does not contain AGC as a substring.\n\nThe condition above cannot be violated by swapping two adjacent characters once.\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\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of strings of length N that satisfy the following conditions, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n61\n\nThere are 4^3 = 64 strings of length 3 that do not contain characters other than A, C, G and T. Among them, only AGC, ACG and GAC violate the condition, so the answer is 64 - 3 = 61.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n230\n\nSample Input 3\n\n100\n\nSample Output 3\n\n388130742\n\nBe sure to print the number of strings modulo 10^9+7.", "sample_input": "3\n"}, "reference_outputs": ["61\n"], "source_document_id": "p03088", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Find the number of strings of length N that satisfy the following conditions, modulo 10^9+7:\n\nThe string does not contain characters other than A, C, G and T.\n\nThe string does not contain AGC as a substring.\n\nThe condition above cannot be violated by swapping two adjacent characters once.\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\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of strings of length N that satisfy the following conditions, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n61\n\nThere are 4^3 = 64 strings of length 3 that do not contain characters other than A, C, G and T. Among them, only AGC, ACG and GAC violate the condition, so the answer is 64 - 3 = 61.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n230\n\nSample Input 3\n\n100\n\nSample Output 3\n\n388130742\n\nBe sure to print the number of strings modulo 10^9+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1353, "cpu_time_ms": 10, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s988259902", "group_id": "codeNet:p03089", "input_text": "let (>>=) x f = match x with None -> None | Some x -> f x\n\nlet rec rm_rightest temp i = function\n  | [] -> None\n  | b::bs -> \n     if i = b then Some (b, List.fold_left (fun acc b -> b::acc) bs temp) \n     else rm_rightest (b::temp) (i - 1) bs\n\nlet solve bs n =\n  let rec inner ans n = function\n    | [] -> Some ans\n    | bs ->\n(*       print_string \"n: \"; print_endline @@ string_of_int n;\n       print_string \"bs: \"; List.iter (fun n -> print_int n; print_string \"; \") bs;\n       print_endline \"\"; *)\n       rm_rightest [] n bs >>= fun (b, bs) ->\n(*       print_string \"b, bs: \"; print_int b; print_string \" | \";\n       List.iter(fun n -> print_int n; print_string \"; \") bs;\n       print_endline \"\";*)\n       inner (b::ans) (n - 1) bs\n  in inner [] n bs\n\nlet print_result = function\n  | None -> print_int (-1)\n  | Some ans -> List.iter (fun n -> print_int n; print_endline \"\") ans\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let bs = ref [] in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun b -> bs := b::!bs)\n  done;\n  solve !bs n\n  |> print_result", "language": "OCaml", "metadata": {"date": 1553414865, "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/s988259902.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988259902", "user_id": "u387591304"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "let (>>=) x f = match x with None -> None | Some x -> f x\n\nlet rec rm_rightest temp i = function\n  | [] -> None\n  | b::bs -> \n     if i = b then Some (b, List.fold_left (fun acc b -> b::acc) bs temp) \n     else rm_rightest (b::temp) (i - 1) bs\n\nlet solve bs n =\n  let rec inner ans n = function\n    | [] -> Some ans\n    | bs ->\n(*       print_string \"n: \"; print_endline @@ string_of_int n;\n       print_string \"bs: \"; List.iter (fun n -> print_int n; print_string \"; \") bs;\n       print_endline \"\"; *)\n       rm_rightest [] n bs >>= fun (b, bs) ->\n(*       print_string \"b, bs: \"; print_int b; print_string \" | \";\n       List.iter(fun n -> print_int n; print_string \"; \") bs;\n       print_endline \"\";*)\n       inner (b::ans) (n - 1) bs\n  in inner [] n bs\n\nlet print_result = function\n  | None -> print_int (-1)\n  | Some ans -> List.iter (fun n -> print_int n; print_endline \"\") ans\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let bs = ref [] in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun b -> bs := b::!bs)\n  done;\n  solve !bs n\n  |> print_result", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1100, "cpu_time_ms": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s541365847", "group_id": "codeNet:p03090", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    Printf.printf \"%d\\n\" @@ n * (n - 1) / 2 - n / 2;\n    let m = n + 1 - n mod 2 in\n    for i = 1 to n - 1 do\n        for j = i + 1 to n do\n            if i + j <> m then Printf.printf \"%d %d\\n\" i j\n        done\n    done\n)", "language": "OCaml", "metadata": {"date": 1595286957, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03090.html", "problem_id": "p03090", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03090/input.txt", "sample_output_relpath": "derived/input_output/data/p03090/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03090/OCaml/s541365847.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s541365847", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n1 3\n2 3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    Printf.printf \"%d\\n\" @@ n * (n - 1) / 2 - n / 2;\n    let m = n + 1 - n mod 2 in\n    for i = 1 to n - 1 do\n        for j = i + 1 to n do\n            if i + j <> m then Printf.printf \"%d %d\\n\" i j\n        done\n    done\n)", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "sample_input": "3\n"}, "reference_outputs": ["2\n1 3\n2 3\n"], "source_document_id": "p03090", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 10, "memory_kb": 5272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s654534830", "group_id": "codeNet:p03090", "input_text": "let () = Scanf.scanf \"%d\" @@ fun s ->\n  if s mod 2 = 0 then begin\n    Printf.printf \"%d\\n\" (s * (s - 2) / 2);\n    for i = 1 to s do\n      for j = i + 1 to s do\n        if i + j <> s + 1 then\n          Printf.printf \"%d %d\\n\" i j\n      done\n    done\n  end else begin\n    Printf.printf \"%d\\n\" (s * (s - 1) / 2 - s / 2);\n    for i = 1 to s do\n      for j = i + 1 to s do\n        if i + j <> s then\n          Printf.printf \"%d %d\\n\" i j\n      done\n    done\n  end\n\n", "language": "OCaml", "metadata": {"date": 1553378116, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03090.html", "problem_id": "p03090", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03090/input.txt", "sample_output_relpath": "derived/input_output/data/p03090/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03090/OCaml/s654534830.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s654534830", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n1 3\n2 3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun s ->\n  if s mod 2 = 0 then begin\n    Printf.printf \"%d\\n\" (s * (s - 2) / 2);\n    for i = 1 to s do\n      for j = i + 1 to s do\n        if i + j <> s + 1 then\n          Printf.printf \"%d %d\\n\" i j\n      done\n    done\n  end else begin\n    Printf.printf \"%d\\n\" (s * (s - 1) / 2 - s / 2);\n    for i = 1 to s do\n      for j = i + 1 to s do\n        if i + j <> s then\n          Printf.printf \"%d %d\\n\" i j\n      done\n    done\n  end\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "sample_input": "3\n"}, "reference_outputs": ["2\n1 3\n2 3\n"], "source_document_id": "p03090", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 460, "cpu_time_ms": 4, "memory_kb": 2048}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s163594674", "group_id": "codeNet:p03097", "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\nlet rec gray_of_binary g = g lxor (g lsr 1)\n\nlet rec binary_of_gray b = function\n  | 0 -> b\n  | g -> binary_of_gray (b lxor g) (g lsr 1)\nlet binary_of_gray = binary_of_gray 0\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  let a' = binary_of_gray a in\n  let b' = binary_of_gray b in\n  let n' = 1 lsl n in\n  if popcnt (a lxor b) <> 1\n  then print_endline \"NO\"\n  else begin\n    print_endline \"YES\";\n    for i = 0 to n' - 1 do\n      Printf.printf \"%d \" @@\n      if (a' < b') = (abs (a' - b') = 1)\n      then gray_of_binary ((a' + n' - i) mod n')\n      else gray_of_binary ((a' + i) mod n')\n    done;\n    print_newline ()\n  end\n\n", "language": "OCaml", "metadata": {"date": 1552771938, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03097.html", "problem_id": "p03097", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03097/input.txt", "sample_output_relpath": "derived/input_output/data/p03097/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03097/OCaml/s163594674.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s163594674", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n1 0 2 3\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\nlet rec gray_of_binary g = g lxor (g lsr 1)\n\nlet rec binary_of_gray b = function\n  | 0 -> b\n  | g -> binary_of_gray (b lxor g) (g lsr 1)\nlet binary_of_gray = binary_of_gray 0\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  let a' = binary_of_gray a in\n  let b' = binary_of_gray b in\n  let n' = 1 lsl n in\n  if popcnt (a lxor b) <> 1\n  then print_endline \"NO\"\n  else begin\n    print_endline \"YES\";\n    for i = 0 to n' - 1 do\n      Printf.printf \"%d \" @@\n      if (a' < b') = (abs (a' - b') = 1)\n      then gray_of_binary ((a' + n' - i) mod n')\n      else gray_of_binary ((a' + i) mod n')\n    done;\n    print_newline ()\n  end\n\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nYou are given integers N,\\ A and B.\nDetermine if there exists a permutation (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) of (0,\\ 1,\\ ...\\ 2^N-1) that satisfies all of the following conditions, and create one such permutation if it exists.\n\nP_0=A\n\nP_{2^N-1}=B\n\nFor all 0 \\leq i < 2^N-1, the binary representations of P_i and P_{i+1} differ by exactly one bit.\n\nConstraints\n\n1 \\leq N \\leq 17\n\n0 \\leq A \\leq 2^N-1\n\n0 \\leq B \\leq 2^N-1\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nIf there is no permutation that satisfies the conditions, print NO.\n\nIf there is such a permutation, print YES in the first line.\nThen, print (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) in the second line, with spaces in between.\nIf there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n2 1 3\n\nSample Output 1\n\nYES\n1 0 2 3\n\nThe binary representation of P=(1,0,2,3) is (01,00,10,11), where any two adjacent elements differ by exactly one bit.\n\nSample Input 2\n\n3 2 1\n\nSample Output 2\n\nNO", "sample_input": "2 1 3\n"}, "reference_outputs": ["YES\n1 0 2 3\n"], "source_document_id": "p03097", "source_text": "Score : 800 points\n\nProblem Statement\n\nYou are given integers N,\\ A and B.\nDetermine if there exists a permutation (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) of (0,\\ 1,\\ ...\\ 2^N-1) that satisfies all of the following conditions, and create one such permutation if it exists.\n\nP_0=A\n\nP_{2^N-1}=B\n\nFor all 0 \\leq i < 2^N-1, the binary representations of P_i and P_{i+1} differ by exactly one bit.\n\nConstraints\n\n1 \\leq N \\leq 17\n\n0 \\leq A \\leq 2^N-1\n\n0 \\leq B \\leq 2^N-1\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nIf there is no permutation that satisfies the conditions, print NO.\n\nIf there is such a permutation, print YES in the first line.\nThen, print (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) in the second line, with spaces in between.\nIf there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n2 1 3\n\nSample Output 1\n\nYES\n1 0 2 3\n\nThe binary representation of P=(1,0,2,3) is (01,00,10,11), where any two adjacent elements differ by exactly one bit.\n\nSample Input 2\n\n3 2 1\n\nSample Output 2\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1109, "cpu_time_ms": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s607607118", "group_id": "codeNet:p03097", "input_text": "let rec gray_of_binary g = g lxor (g lsr 1)\nlet rec binary_of_gray b = function\n  | 0 -> b\n  | g -> binary_of_gray (b lxor g) (g lsr 1)\nlet binary_of_gray = binary_of_gray 0\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  let a' = binary_of_gray a in\n  let b' = binary_of_gray b in\n  let n' = 1 lsl n in\n  if abs (a' - b') <> 1 && abs (a' - b') <> n' - 1\n  then print_endline \"NO\"\n  else begin\n    print_endline \"YES\";\n    (* for i = 0 to n' - 1 do\n      Printf.printf \"%d \" @@\n      if (a' < b') = (abs (a' - b') = 1)\n      then gray_of_binary ((a' + n' - i) mod n')\n      else gray_of_binary ((a' + i) mod n')\n    done;\n    print_newline () *)\n  end\n", "language": "OCaml", "metadata": {"date": 1552768919, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03097.html", "problem_id": "p03097", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03097/input.txt", "sample_output_relpath": "derived/input_output/data/p03097/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03097/OCaml/s607607118.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s607607118", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n1 0 2 3\n", "input_to_evaluate": "let rec gray_of_binary g = g lxor (g lsr 1)\nlet rec binary_of_gray b = function\n  | 0 -> b\n  | g -> binary_of_gray (b lxor g) (g lsr 1)\nlet binary_of_gray = binary_of_gray 0\n\nlet () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  let a' = binary_of_gray a in\n  let b' = binary_of_gray b in\n  let n' = 1 lsl n in\n  if abs (a' - b') <> 1 && abs (a' - b') <> n' - 1\n  then print_endline \"NO\"\n  else begin\n    print_endline \"YES\";\n    (* for i = 0 to n' - 1 do\n      Printf.printf \"%d \" @@\n      if (a' < b') = (abs (a' - b') = 1)\n      then gray_of_binary ((a' + n' - i) mod n')\n      else gray_of_binary ((a' + i) mod n')\n    done;\n    print_newline () *)\n  end\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nYou are given integers N,\\ A and B.\nDetermine if there exists a permutation (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) of (0,\\ 1,\\ ...\\ 2^N-1) that satisfies all of the following conditions, and create one such permutation if it exists.\n\nP_0=A\n\nP_{2^N-1}=B\n\nFor all 0 \\leq i < 2^N-1, the binary representations of P_i and P_{i+1} differ by exactly one bit.\n\nConstraints\n\n1 \\leq N \\leq 17\n\n0 \\leq A \\leq 2^N-1\n\n0 \\leq B \\leq 2^N-1\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nIf there is no permutation that satisfies the conditions, print NO.\n\nIf there is such a permutation, print YES in the first line.\nThen, print (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) in the second line, with spaces in between.\nIf there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n2 1 3\n\nSample Output 1\n\nYES\n1 0 2 3\n\nThe binary representation of P=(1,0,2,3) is (01,00,10,11), where any two adjacent elements differ by exactly one bit.\n\nSample Input 2\n\n3 2 1\n\nSample Output 2\n\nNO", "sample_input": "2 1 3\n"}, "reference_outputs": ["YES\n1 0 2 3\n"], "source_document_id": "p03097", "source_text": "Score : 800 points\n\nProblem Statement\n\nYou are given integers N,\\ A and B.\nDetermine if there exists a permutation (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) of (0,\\ 1,\\ ...\\ 2^N-1) that satisfies all of the following conditions, and create one such permutation if it exists.\n\nP_0=A\n\nP_{2^N-1}=B\n\nFor all 0 \\leq i < 2^N-1, the binary representations of P_i and P_{i+1} differ by exactly one bit.\n\nConstraints\n\n1 \\leq N \\leq 17\n\n0 \\leq A \\leq 2^N-1\n\n0 \\leq B \\leq 2^N-1\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nIf there is no permutation that satisfies the conditions, print NO.\n\nIf there is such a permutation, print YES in the first line.\nThen, print (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) in the second line, with spaces in between.\nIf there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n2 1 3\n\nSample Output 1\n\nYES\n1 0 2 3\n\nThe binary representation of P=(1,0,2,3) is (01,00,10,11), where any two adjacent elements differ by exactly one bit.\n\nSample Input 2\n\n3 2 1\n\nSample Output 2\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 655, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s833382546", "group_id": "codeNet:p03101", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun h w ->\n    Scanf.sscanf (read_line ()) \"%d %d\" (fun h_ w_ ->\n      print_endline (string_of_int ((h - h_) * (w - w_)))\n    )\n)", "language": "OCaml", "metadata": {"date": 1583953844, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03101.html", "problem_id": "p03101", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03101/input.txt", "sample_output_relpath": "derived/input_output/data/p03101/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03101/OCaml/s833382546.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s833382546", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun h w ->\n    Scanf.sscanf (read_line ()) \"%d %d\" (fun h_ w_ ->\n      print_endline (string_of_int ((h - h_) * (w - w_)))\n    )\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "sample_input": "3 2\n2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03101", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 175, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s861903989", "group_id": "codeNet:p03102", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet n, m, c = Scanf.sscanf (read_line ()) \"%d %d %d\" (\n        fun n m c -> \n                n, m, c\n)\nlet blst = \n        Str.split (Str.regexp \" \") (read_line ())\n        |> List.map int_of_string\nlet alst =\n        List.init n (\n                fun _ -> \n                        Str.split (Str.regexp \" \") (read_line ())\n                        |> List.map int_of_string\n        )\n\nlet dot_product = List.fold_left2 (fun a b c -> a + b * c) 0\nlet rec f lst =\n        match lst with\n                [] -> 0\n                | first :: rest -> \n                        let fdot = c + dot_product first blst in\n                                if fdot > 0 then\n                                        1 + (f rest)\n                                else\n                                        f rest\n\nlet () =\n        f alst\n      |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1589916561, "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/s861903989.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861903989", "user_id": "u280335093"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet n, m, c = Scanf.sscanf (read_line ()) \"%d %d %d\" (\n        fun n m c -> \n                n, m, c\n)\nlet blst = \n        Str.split (Str.regexp \" \") (read_line ())\n        |> List.map int_of_string\nlet alst =\n        List.init n (\n                fun _ -> \n                        Str.split (Str.regexp \" \") (read_line ())\n                        |> List.map int_of_string\n        )\n\nlet dot_product = List.fold_left2 (fun a b c -> a + b * c) 0\nlet rec f lst =\n        match lst with\n                [] -> 0\n                | first :: rest -> \n                        let fdot = c + dot_product first blst in\n                                if fdot > 0 then\n                                        1 + (f rest)\n                                else\n                                        f rest\n\nlet () =\n        f alst\n      |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s992738979", "group_id": "codeNet:p03102", "input_text": "let calc a b c = List.fold_left2 (fun x y z -> x + y * z) c a b\nlet () =\n  try\n    let (n, m, c) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a, b, c)) in\n    let b = Array.to_list\n        (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n    let a = Array.to_list\n        (Array.init (n) (fun _ -> Array.to_list (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))))) in\n    List.length (List.filter (fun lst -> calc lst b c > 0) a) |> print_int\n  with\n    End_of_file -> ()", "language": "OCaml", "metadata": {"date": 1556275521, "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/s992738979.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992738979", "user_id": "u307426615"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let calc a b c = List.fold_left2 (fun x y z -> x + y * z) c a b\nlet () =\n  try\n    let (n, m, c) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a, b, c)) in\n    let b = Array.to_list\n        (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n    let a = Array.to_list\n        (Array.init (n) (fun _ -> Array.to_list (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))))) in\n    List.length (List.filter (fun lst -> calc lst b c > 0) a) |> print_int\n  with\n    End_of_file -> ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s106277119", "group_id": "codeNet:p03102", "input_text": "let calc a b c = List.fold_left2 (fun x y z -> x + y * z) c a b\nlet () =\n  try\n    let (n, m, c) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a, b, c)) in\n    let b = Array.to_list\n        (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n    let a = Array.to_list\n        (Array.init (n-1) (fun _ -> Array.to_list (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))))) in\n    List.length (List.filter (fun lst -> calc lst b c > 0) a) |> print_int\n  with\n    End_of_file -> ()\n", "language": "OCaml", "metadata": {"date": 1556275426, "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/s106277119.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s106277119", "user_id": "u307426615"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let calc a b c = List.fold_left2 (fun x y z -> x + y * z) c a b\nlet () =\n  try\n    let (n, m, c) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a, b, c)) in\n    let b = Array.to_list\n        (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n    let a = Array.to_list\n        (Array.init (n-1) (fun _ -> Array.to_list (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))))) in\n    List.length (List.filter (fun lst -> calc lst b c > 0) a) |> print_int\n  with\n    End_of_file -> ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 488, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s774866045", "group_id": "codeNet:p03102", "input_text": "(* 本当に辛い *)\nlet array_map2 f a b =\n    let l = Array.length a in\n    if l = 0 then [||] else begin\n        let r = Array.make l (f (Array.unsafe_get a 0) (Array.unsafe_get b 0)) in\n        for i = 0 to l - 1 do\n            Array.unsafe_set r i (f (Array.unsafe_get a i) (Array.unsafe_get b i))\n        done;\n        r\n    end\n\nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m c ->\n    let b = Array.init m (fun _ ->\n        Scanf.scanf \" %d\" (fun b -> b)) in\n    Array.init n (fun _ ->\n        Scanf.scanf \"\\n\" (fun _ -> ()) 0;\n        let a = Array.init m (fun _ ->\n            Scanf.scanf \" %d\" (fun a -> a)) in\n        let t = array_map2 (fun a b -> a * b) a b\n        |> Array.fold_left (+) 0 in\n        if t + c > 0\n        then 1\n        else 0)\n    |> Array.fold_left (+) 0\n    |> Printf.printf \"%d\"\n", "language": "OCaml", "metadata": {"date": 1552162830, "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/s774866045.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774866045", "user_id": "u604818425"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* 本当に辛い *)\nlet array_map2 f a b =\n    let l = Array.length a in\n    if l = 0 then [||] else begin\n        let r = Array.make l (f (Array.unsafe_get a 0) (Array.unsafe_get b 0)) in\n        for i = 0 to l - 1 do\n            Array.unsafe_set r i (f (Array.unsafe_get a i) (Array.unsafe_get b i))\n        done;\n        r\n    end\n\nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m c ->\n    let b = Array.init m (fun _ ->\n        Scanf.scanf \" %d\" (fun b -> b)) in\n    Array.init n (fun _ ->\n        Scanf.scanf \"\\n\" (fun _ -> ()) 0;\n        let a = Array.init m (fun _ ->\n            Scanf.scanf \" %d\" (fun a -> a)) in\n        let t = array_map2 (fun a b -> a * b) a b\n        |> Array.fold_left (+) 0 in\n        if t + c > 0\n        then 1\n        else 0)\n    |> Array.fold_left (+) 0\n    |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 813, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s284644065", "group_id": "codeNet:p03103", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let ab = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun a b -> a, b)) in\n    Array.sort compare ab;\n\n    let rec loop i acc hon =\n        let a, b = ab.(i) in\n        let d = min b (m - hon) in\n        let acc = acc + a * d in\n        let hon = hon + d in\n        if hon < m then loop (i + 1) acc hon\n            else acc\n    in\n    loop 0 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1592687738, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/OCaml/s284644065.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284644065", "user_id": "u342443598"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let ab = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun a b -> a, b)) in\n    Array.sort compare ab;\n\n    let rec loop i acc hon =\n        let a, b = ab.(i) in\n        let d = min b (m - hon) in\n        let acc = acc + a * d in\n        let hon = hon + d in\n        if hon < m then loop (i + 1) acc hon\n            else acc\n    in\n    loop 0 0 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 407, "cpu_time_ms": 139, "memory_kb": 9380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s246840200", "group_id": "codeNet:p03103", "input_text": "type drink = {price: int; stock: int};;\nlet compare_drink d1 d2 = d1.price - d2.price;; \n\nlet input_drink_array n = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> {price = a; stock = b};;\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n m -> \n  let drinks = input_drink_array n in (\n    Array.fast_sort compare_drink drinks;\n    let ans = ref 0 in\n    let cnt = ref 0 in (\n      for i = 0 to n - 1 do\n        if drinks.(i).stock + !cnt < m then (\n          ans := !ans + drinks.(i).price * drinks.(i).stock;\n          cnt := !cnt + drinks.(i).stock\n        ) else if !cnt < m then (\n          let rest = m - !cnt in (\n            ans := !ans + drinks.(i).price * rest;\n            cnt := m;\n          )\n        )\n      done;\n      Printf.printf \"%d\\n\" !ans\n    )\n  )\n;;", "language": "OCaml", "metadata": {"date": 1587460532, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/OCaml/s246840200.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s246840200", "user_id": "u541055501"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "type drink = {price: int; stock: int};;\nlet compare_drink d1 d2 = d1.price - d2.price;; \n\nlet input_drink_array n = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> {price = a; stock = b};;\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n m -> \n  let drinks = input_drink_array n in (\n    Array.fast_sort compare_drink drinks;\n    let ans = ref 0 in\n    let cnt = ref 0 in (\n      for i = 0 to n - 1 do\n        if drinks.(i).stock + !cnt < m then (\n          ans := !ans + drinks.(i).price * drinks.(i).stock;\n          cnt := !cnt + drinks.(i).stock\n        ) else if !cnt < m then (\n          let rest = m - !cnt in (\n            ans := !ans + drinks.(i).price * rest;\n            cnt := m;\n          )\n        )\n      done;\n      Printf.printf \"%d\\n\" !ans\n    )\n  )\n;;", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 772, "cpu_time_ms": 88, "memory_kb": 6912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s715261995", "group_id": "codeNet:p03103", "input_text": "let input () =\nlet (n,m) = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b)) in\nlet rec loop count list =\n  match count with\n    0 -> list\n  | x -> let (a,b) = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b)) in\n          loop (count - 1) ((a,b)::list)\nin (m,loop n []);;\n\nlet solve () =\n  let (m, list) = input() in\n  let sort_list = List.sort (fun (a,_) (b,_) -> if a > b then 1 else -1) list in\n  let rec loop ans m l =\n    let (a,b) = List.hd l in\n    if m > b then\n      loop (ans + (a*b)) (m-b) (List.tl l)\n    else print_int (ans + m*a)\n  in loop 0 m sort_list;;\n\nsolve();;", "language": "OCaml", "metadata": {"date": 1554671550, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/OCaml/s715261995.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s715261995", "user_id": "u947517859"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let input () =\nlet (n,m) = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b)) in\nlet rec loop count list =\n  match count with\n    0 -> list\n  | x -> let (a,b) = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b)) in\n          loop (count - 1) ((a,b)::list)\nin (m,loop n []);;\n\nlet solve () =\n  let (m, list) = input() in\n  let sort_list = List.sort (fun (a,_) (b,_) -> if a > b then 1 else -1) list in\n  let rec loop ans m l =\n    let (a,b) = List.hd l in\n    if m > b then\n      loop (ans + (a*b)) (m-b) (List.tl l)\n    else print_int (ans + m*a)\n  in loop 0 m sort_list;;\n\nsolve();;", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 591, "cpu_time_ms": 119, "memory_kb": 15488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s679124659", "group_id": "codeNet:p03103", "input_text": "let rec qsort compare ls =\n  if ls = [] then []\n  else\n    let p, tl = (List.hd ls), (List.tl ls) in\n    let left = List.filter (compare p) tl in\n    let right = List.filter (fun x -> not @@ compare p x) tl in\n    (qsort compare left) @ p::(qsort compare right)\n\nlet rec aux m cash drinks shops =\n  if drinks >= m then cash\n  else\n    let a, b = List.hd shops in\n    let shops = List.tl shops in\n    if m - drinks >= b then aux m (cash + a * b) (drinks + b) shops\n    else if m - drinks < b then aux m (cash + a * (m - drinks)) m shops\n    else assert false \n\nlet _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m)) in\n  let pairs = ref [] in\n  for i=1 to n do\n    Scanf.scanf \"%d %d\\n\" (fun a b -> pairs := (a, b)::!pairs)\n  done;\n  !pairs\n  |> qsort (fun (a, _) (a', _) -> a >= a')\n  |> aux m 0 0\n  |> print_int", "language": "OCaml", "metadata": {"date": 1552165171, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/OCaml/s679124659.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s679124659", "user_id": "u387591304"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let rec qsort compare ls =\n  if ls = [] then []\n  else\n    let p, tl = (List.hd ls), (List.tl ls) in\n    let left = List.filter (compare p) tl in\n    let right = List.filter (fun x -> not @@ compare p x) tl in\n    (qsort compare left) @ p::(qsort compare right)\n\nlet rec aux m cash drinks shops =\n  if drinks >= m then cash\n  else\n    let a, b = List.hd shops in\n    let shops = List.tl shops in\n    if m - drinks >= b then aux m (cash + a * b) (drinks + b) shops\n    else if m - drinks < b then aux m (cash + a * (m - drinks)) m shops\n    else assert false \n\nlet _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m)) in\n  let pairs = ref [] in\n  for i=1 to n do\n    Scanf.scanf \"%d %d\\n\" (fun a b -> pairs := (a, b)::!pairs)\n  done;\n  !pairs\n  |> qsort (fun (a, _) (a', _) -> a >= a')\n  |> aux m 0 0\n  |> print_int", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 820, "cpu_time_ms": 2105, "memory_kb": 24320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s852860520", "group_id": "codeNet:p03106", "input_text": "let a, b, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet c = ref 1\nlet _ = for i = min a b downto 1 do if a mod i = 0 && b mod i = 0 then (if !c >= k then (Printf.printf \"%d\\n\" i; exit 0); incr c) done", "language": "OCaml", "metadata": {"date": 1567933423, "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/s852860520.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s852860520", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let a, b, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet c = ref 1\nlet _ = for i = min a b downto 1 do if a mod i = 0 && b mod i = 0 then (if !c >= k then (Printf.printf \"%d\\n\" i; exit 0); incr c) done", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s599615713", "group_id": "codeNet:p03106", "input_text": "let calc a b =\n  let rec iter i =\n    if i == 0 then\n      []\n    else if a mod i == 0 && b mod i == 0 then\n      i :: iter (i - 1)\n    else iter (i - 1)\n  in iter 100\nlet () =\n  let (a, b, k) = Scanf.scanf \"%d %d %d\" (fun a b k -> (a, b, k)) in\n  let l = calc a b in\n  (*List.iter (fun e -> e |> string_of_int |> print_endline) l*)\n  List.nth l (k - 1) |> string_of_int |> print_endline\n\n", "language": "OCaml", "metadata": {"date": 1552237369, "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/s599615713.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s599615713", "user_id": "u625631018"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let calc a b =\n  let rec iter i =\n    if i == 0 then\n      []\n    else if a mod i == 0 && b mod i == 0 then\n      i :: iter (i - 1)\n    else iter (i - 1)\n  in iter 100\nlet () =\n  let (a, b, k) = Scanf.scanf \"%d %d %d\" (fun a b k -> (a, b, k)) in\n  let l = calc a b in\n  (*List.iter (fun e -> e |> string_of_int |> print_endline) l*)\n  List.nth l (k - 1) |> string_of_int |> print_endline\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s179771933", "group_id": "codeNet:p03107", "input_text": "let a=ref 0 in let b=ref 0 in Scanf.scanf\"%s\"@@fun s->String.iter(fun c->if c='0'then a:=!a+2 else b:=!b+2)s;min !a!b|>print_int", "language": "OCaml", "metadata": {"date": 1587463668, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03107/input.txt", "sample_output_relpath": "derived/input_output/data/p03107/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03107/OCaml/s179771933.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179771933", "user_id": "u541055501"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let a=ref 0 in let b=ref 0 in Scanf.scanf\"%s\"@@fun s->String.iter(fun c->if c='0'then a:=!a+2 else b:=!b+2)s;min !a!b|>print_int", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 3, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s900207977", "group_id": "codeNet:p03109", "input_text": "let m = Scanf.scanf \"2019/%d\" @@ fun a -> a\nlet _ = print_endline @@ if m >= 5 then \"TBD\" else \"Heisei\"", "language": "OCaml", "metadata": {"date": 1563717170, "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/s900207977.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900207977", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "let m = Scanf.scanf \"2019/%d\" @@ fun a -> a\nlet _ = print_endline @@ if m >= 5 then \"TBD\" 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s190848088", "group_id": "codeNet:p03110", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let rec loop i acc =\n        if i = n then acc else\n            let acc = Scanf.scanf \" %f %s\" (fun x u ->\n                if u = \"JPY\" then acc +. x else acc +. x *. 380000.\n            )\n            in\n            loop (i + 1) acc\n    in\n    loop 0 0. |> Printf.printf \"%f\\n\"\n)", "language": "OCaml", "metadata": {"date": 1591734018, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/OCaml/s190848088.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s190848088", "user_id": "u342443598"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let rec loop i acc =\n        if i = n then acc else\n            let acc = Scanf.scanf \" %f %s\" (fun x u ->\n                if u = \"JPY\" then acc +. x else acc +. x *. 380000.\n            )\n            in\n            loop (i + 1) acc\n    in\n    loop 0 0. |> Printf.printf \"%f\\n\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s919833597", "group_id": "codeNet:p03110", "input_text": "open Printf open Scanf\nopen Array\n\nlet () = scanf \" %d\" @@ fun n ->\n  printf \"%.120f\" (\n    init n (fun _ -> scanf \" %f %s\" @@ fun x -> function\n    | \"BTC\" -> x *. 380000.\n    | \"JPY\" -> x\n    ) |> fold_left (+.) 0.\n  )", "language": "OCaml", "metadata": {"date": 1551047006, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/OCaml/s919833597.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s919833597", "user_id": "u481480055"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "open Printf open Scanf\nopen Array\n\nlet () = scanf \" %d\" @@ fun n ->\n  printf \"%.120f\" (\n    init n (fun _ -> scanf \" %f %s\" @@ fun x -> function\n    | \"BTC\" -> x *. 380000.\n    | \"JPY\" -> x\n    ) |> fold_left (+.) 0.\n  )", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s882594110", "group_id": "codeNet:p03111", "input_text": "let (>>=) xs f = List.map f xs |> List.concat\nlet rec choice s c acc = function\n  | [] -> if s = 0 then [] else [(s, c-10, acc)]\n  | x::xs -> choice s c (x::acc) xs @ choice (s+x) (c+10) acc xs\nlet () =\n  Scanf.scanf \"%d %d %d %d\" @@ fun n a b c ->\n  let l = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) |> Array.to_list in\n  (choice 0 0 [] l >>= fun (a', wa, l) ->\n   choice 0 0 [] l >>= fun (b', wb, l) ->\n   choice 0 0 [] l >>= fun (c', wc, l) ->\n     [wa + wb + wc + abs (a - a') + abs (b - b') + abs (c - c')])\n  |> List.fold_left min 1010101010\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1551049702, "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/s882594110.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s882594110", "user_id": "u798181098"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "let (>>=) xs f = List.map f xs |> List.concat\nlet rec choice s c acc = function\n  | [] -> if s = 0 then [] else [(s, c-10, acc)]\n  | x::xs -> choice s c (x::acc) xs @ choice (s+x) (c+10) acc xs\nlet () =\n  Scanf.scanf \"%d %d %d %d\" @@ fun n a b c ->\n  let l = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) |> Array.to_list in\n  (choice 0 0 [] l >>= fun (a', wa, l) ->\n   choice 0 0 [] l >>= fun (b', wb, l) ->\n   choice 0 0 [] l >>= fun (c', wc, l) ->\n     [wa + wb + wc + abs (a - a') + abs (b - b') + abs (c - c')])\n  |> List.fold_left min 1010101010\n  |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s602229825", "group_id": "codeNet:p03112", "input_text": "(* q log(max a b) *)\nlet kInf = 20202020202\nlet a, b, q = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ns = [|a; b|]\nlet sts = Array.init 2 @@ fun i ->\n  let ds = Array.make (ns.(i) + 2) 0 in\n  ds.(0) <- -kInf + i; ds.(ns.(i) + 1) <- kInf + i;\n  for j = 1 to ns.(i) do ds.(j) <- Scanf.scanf \" %d\" @@ (+) 0 done;\n  ds\nlet xs = Array.init q @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet is_ok i key a = a.(i) >= key\nlet binary_search key a =\n  let left, right = ref @@ -1, ref @@ Array.length a in\n  while !right - !left > 1 do\n    let mid = !left + (!right - !left) / 2 in\n    if is_ok mid key a then right := mid\n    else left := mid done;\n  !right\nlet f x =\n  let si1, ti1 = binary_search x sts.(0), binary_search x sts.(1) in\n  let s0, s1, t0, t1 = sts.(0).(si1 - 1), sts.(0).(si1), sts.(1).(ti1 - 1), sts.(1).(ti1) in\n  let ans = ref kInf in\n  ([s0; s1] |> List.iter @@ fun s ->\n    [t0; t1] |> List.iter @@ fun t ->\n      ans := min !ans @@ min (abs (x - s)) (abs (x - t)) + abs (t - s));\n  Printf.printf \"%d\\n\" !ans\nlet _ = Array.iter f xs", "language": "OCaml", "metadata": {"date": 1561395452, "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/s602229825.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602229825", "user_id": "u732304692"}, "prompt_components": {"gold_output": "350\n1400\n301\n399\n", "input_to_evaluate": "(* q log(max a b) *)\nlet kInf = 20202020202\nlet a, b, q = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ns = [|a; b|]\nlet sts = Array.init 2 @@ fun i ->\n  let ds = Array.make (ns.(i) + 2) 0 in\n  ds.(0) <- -kInf + i; ds.(ns.(i) + 1) <- kInf + i;\n  for j = 1 to ns.(i) do ds.(j) <- Scanf.scanf \" %d\" @@ (+) 0 done;\n  ds\nlet xs = Array.init q @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet is_ok i key a = a.(i) >= key\nlet binary_search key a =\n  let left, right = ref @@ -1, ref @@ Array.length a in\n  while !right - !left > 1 do\n    let mid = !left + (!right - !left) / 2 in\n    if is_ok mid key a then right := mid\n    else left := mid done;\n  !right\nlet f x =\n  let si1, ti1 = binary_search x sts.(0), binary_search x sts.(1) in\n  let s0, s1, t0, t1 = sts.(0).(si1 - 1), sts.(0).(si1), sts.(1).(ti1 - 1), sts.(1).(ti1) in\n  let ans = ref kInf in\n  ([s0; s1] |> List.iter @@ fun s ->\n    [t0; t1] |> List.iter @@ fun t ->\n      ans := min !ans @@ min (abs (x - s)) (abs (x - t)) + abs (t - s));\n  Printf.printf \"%d\\n\" !ans\nlet _ = Array.iter f xs", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "sample_input": "2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n"}, "reference_outputs": ["350\n1400\n301\n399\n"], "source_document_id": "p03112", "source_text": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1048, "cpu_time_ms": 193, "memory_kb": 6912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s708460586", "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        ss.(rs) - x + ss.(rs) - ts.(lt);\n        x - ss.(ls) + ts.(rt) - ss.(ls);\n        ts.(rt) - x + ts.(rt) - ss.(ls);\n        x - ts.(lt) + ss.(rs) - ts.(lt) ]\n  done", "language": "OCaml", "metadata": {"date": 1551041659, "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/s708460586.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s708460586", "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        ss.(rs) - x + ss.(rs) - ts.(lt);\n        x - ss.(ls) + ts.(rt) - ss.(ls);\n        ts.(rt) - x + ts.(rt) - ss.(ls);\n        x - ts.(lt) + ss.(rs) - ts.(lt) ]\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1725, "cpu_time_ms": 208, "memory_kb": 7296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s683567166", "group_id": "codeNet:p03125", "input_text": "let divisor a b = if b mod a = 0 then b + a else b - a\n\nlet () = Scanf.scanf \"%d %d\" divisor |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595852554, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s683567166.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683567166", "user_id": "u272377260"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "let divisor a b = if b mod a = 0 then b + a else b - a\n\nlet () = Scanf.scanf \"%d %d\" divisor |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s897074304", "group_id": "codeNet:p03126", "input_text": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet a_ss = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun k -> Array.init k @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a - 1\nlet cs = Array.make m 0\nlet f a_s = Array.iter (fun a -> cs.(a) <- cs.(a) + 1) a_s\nlet _ = Array.iter f a_ss; Array.fold_left (fun ans c -> ans + if c = n then 1 else 0) 0 cs |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1563683323, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03126.html", "problem_id": "p03126", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03126/input.txt", "sample_output_relpath": "derived/input_output/data/p03126/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03126/OCaml/s897074304.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s897074304", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet a_ss = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun k -> Array.init k @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a - 1\nlet cs = Array.make m 0\nlet f a_s = Array.iter (fun a -> cs.(a) <- cs.(a) + 1) a_s\nlet _ = Array.iter f a_ss; Array.fold_left (fun ans c -> ans + if c = n then 1 else 0) 0 cs |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "sample_input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03126", "source_text": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 376, "cpu_time_ms": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s799324220", "group_id": "codeNet:p03126", "input_text": "let _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let aa = Array.make n [] in\n  for i = 0 to n - 1 do\n    let k = Scanf.scanf \"%d \" (fun k -> k) in\n    for j = 1 to k do\n      Scanf.scanf (if j <> k then \"%d \" else \"%d\\n\") \n        (fun a -> aa.(i) <- a::aa.(i)) \n    done\n  done;\n  let reslist = ref aa.(0) in\n  for i = 1 to n - 1 do\n    reslist := List.filter (fun e -> List.mem e aa.(i)) !reslist\n  done;\n  List.length !reslist\n  |> print_int", "language": "OCaml", "metadata": {"date": 1552850313, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03126.html", "problem_id": "p03126", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03126/input.txt", "sample_output_relpath": "derived/input_output/data/p03126/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03126/OCaml/s799324220.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799324220", "user_id": "u387591304"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let aa = Array.make n [] in\n  for i = 0 to n - 1 do\n    let k = Scanf.scanf \"%d \" (fun k -> k) in\n    for j = 1 to k do\n      Scanf.scanf (if j <> k then \"%d \" else \"%d\\n\") \n        (fun a -> aa.(i) <- a::aa.(i)) \n    done\n  done;\n  let reslist = ref aa.(0) in\n  for i = 1 to n - 1 do\n    reslist := List.filter (fun e -> List.mem e aa.(i)) !reslist\n  done;\n  List.length !reslist\n  |> print_int", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "sample_input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03126", "source_text": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 461, "cpu_time_ms": 1, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s487285028", "group_id": "codeNet:p03127", "input_text": "let rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let lst = Array.to_list\n      (Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n  let head = List.hd lst in\n  let tail = List.tl lst in\n  Printf.printf \"%d\\n\" (List.fold_left gcd head tail)", "language": "OCaml", "metadata": {"date": 1557151658, "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/s487285028.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s487285028", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let lst = Array.to_list\n      (Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\n  let head = List.hd lst in\n  let tail = List.tl lst in\n  Printf.printf \"%d\\n\" (List.fold_left gcd head tail)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 36, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s250039256", "group_id": "codeNet:p03127", "input_text": "let solve monsters =\n  let min_hp = List.hd monsters in\n  let rec inner cur_min =\n    let ls = List.filter (fun e -> e mod cur_min <> 0) monsters in\n    match ls with\n    | [] -> cur_min\n    | ls -> \n       List.fold_left (fun me e -> min me (e mod cur_min)) max_int ls |> inner\n  in inner min_hp\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let monsters = ref [] in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") \n      (fun m -> monsters := m::!monsters)\n  done;\n  List.sort (compare) !monsters\n  |> solve |> print_int\n", "language": "OCaml", "metadata": {"date": 1552852549, "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/s250039256.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250039256", "user_id": "u387591304"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let solve monsters =\n  let min_hp = List.hd monsters in\n  let rec inner cur_min =\n    let ls = List.filter (fun e -> e mod cur_min <> 0) monsters in\n    match ls with\n    | [] -> cur_min\n    | ls -> \n       List.fold_left (fun me e -> min me (e mod cur_min)) max_int ls |> inner\n  in inner min_hp\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let monsters = ref [] in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") \n      (fun m -> monsters := m::!monsters)\n  done;\n  List.sort (compare) !monsters\n  |> solve |> print_int\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 102, "memory_kb": 11648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s305584908", "group_id": "codeNet:p03130", "input_text": "let rec fix f x = f (fix f) x;;\nScanf.(Array.(\n  let e = make 4 [] in\n  init 3 (fun i ->\n    scanf \" %d %d\" @@ fun u v -> (\n      let u,v = u-1,v-1 in\n      e.(u) <- (v,i) :: e.(u);\n      e.(v) <- (u,i) :: e.(v)\n    )\n  ) |> ignore;\n  init 3 (fun i ->\n    fix (fun f count v a ->\n      if count=3 then (\n        if fold_left (&&) true a then\n          (print_string \"YES\"; exit 0)\n      ) else (\n        List.iter (fun (w,i) ->\n          if not a.(i) then (\n            a.(i) <- true;\n            f (count+1) w a;\n            a.(i) <- false;\n          )\n        ) e.(v)\n      )\n    ) 0 i @@ make 3 false\n  ) |> ignore;\n  print_string \"NO\"\n))", "language": "OCaml", "metadata": {"date": 1549811900, "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/s305584908.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305584908", "user_id": "u481480055"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let rec fix f x = f (fix f) x;;\nScanf.(Array.(\n  let e = make 4 [] in\n  init 3 (fun i ->\n    scanf \" %d %d\" @@ fun u v -> (\n      let u,v = u-1,v-1 in\n      e.(u) <- (v,i) :: e.(u);\n      e.(v) <- (u,i) :: e.(v)\n    )\n  ) |> ignore;\n  init 3 (fun i ->\n    fix (fun f count v a ->\n      if count=3 then (\n        if fold_left (&&) true a then\n          (print_string \"YES\"; exit 0)\n      ) else (\n        List.iter (fun (w,i) ->\n          if not a.(i) then (\n            a.(i) <- true;\n            f (count+1) w a;\n            a.(i) <- false;\n          )\n        ) e.(v)\n      )\n    ) 0 i @@ make 3 false\n  ) |> ignore;\n  print_string \"NO\"\n))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s124186005", "group_id": "codeNet:p03132", "input_text": "Scanf.scanf \"%d\" (fun l ->\n    let a = Array.init l (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let sum = Array.fold_left (+) 0 a in\n\n    let m3 a b c = max a (max b c) in\n\n    let rec loop i e1 o2 e3 mx =\n        if i = l then sum - mx else\n            let ne1 =\n                if a.(i) = 0       then max 0 (e1 - 2) else\n                if a.(i) = 1       then max 0 (e1 - 1) else\n                if a.(i) mod 2 = 1 then a.(i) - 1 + e1 else\n                                        a.(i)     + e1\n            in\n            let no2 =\n                if a.(i) = 0       then max 0  (max o2 e1 - 1) else\n                if a.(i) mod 2 = 1 then a.(i) + max o2 e1      else\n                                        a.(i) + max o2 e1 - 1\n            in\n            let ne3 =\n                if a.(i) = 0       then max 0  (m3 e1 o2 e3 - 2) else\n                if a.(i) = 1       then max 0  (m3 e1 o2 e3 - 1) else\n                if a.(i) mod 2 = 1 then a.(i) + m3 e1 o2 e3 - 1  else\n                                        a.(i) + m3 e1 o2 e3\n            in\n            let nmx = max (max ne1 no2) (max ne3 mx) in\n            loop (i + 1) ne1 no2 ne3 nmx\n    in\n    loop 0 0 0 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1598840396, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s124186005.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s124186005", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun l ->\n    let a = Array.init l (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let sum = Array.fold_left (+) 0 a in\n\n    let m3 a b c = max a (max b c) in\n\n    let rec loop i e1 o2 e3 mx =\n        if i = l then sum - mx else\n            let ne1 =\n                if a.(i) = 0       then max 0 (e1 - 2) else\n                if a.(i) = 1       then max 0 (e1 - 1) else\n                if a.(i) mod 2 = 1 then a.(i) - 1 + e1 else\n                                        a.(i)     + e1\n            in\n            let no2 =\n                if a.(i) = 0       then max 0  (max o2 e1 - 1) else\n                if a.(i) mod 2 = 1 then a.(i) + max o2 e1      else\n                                        a.(i) + max o2 e1 - 1\n            in\n            let ne3 =\n                if a.(i) = 0       then max 0  (m3 e1 o2 e3 - 2) else\n                if a.(i) = 1       then max 0  (m3 e1 o2 e3 - 1) else\n                if a.(i) mod 2 = 1 then a.(i) + m3 e1 o2 e3 - 1  else\n                                        a.(i) + m3 e1 o2 e3\n            in\n            let nmx = max (max ne1 no2) (max ne3 mx) in\n            loop (i + 1) ne1 no2 ne3 nmx\n    in\n    loop 0 0 0 0 0 |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1209, "cpu_time_ms": 67, "memory_kb": 7552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s690280947", "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  for i = 1 to l do a.(i) <- a.(i) + a.(i-1) done;\n  let a x y = a.(y) - a.(x-1) in\n\n  let dpl1, dpl2 = Array.make (l+1) 0, Array.make (l+1) 0 in\n  let dpr1, dpr2 = Array.make (l+2) 0, Array.make (l+2) 0 in\n  for i = 1 to l do\n    dpl1.(i) <- min (a 1 i) @@\n      dpl1.(i-1) + if a i i = 0 then 2 else a i i mod 2;\n    dpl2.(i) <- min dpl1.(i-1) dpl2.(i-1) + (a i i + 1) mod 2;\n  done;\n  for i = l downto 1 do\n    dpr1.(i) <- min (a i l) @@\n      dpr1.(i+1) + if a i i = 0 then 2 else a i i mod 2;\n    dpr2.(i) <- min dpr1.(i+1) dpr2.(i+1) + (a i i + 1) mod 2;\n  done;\n\n  Array.init (l+1) (fun i ->\n    dpl1.(i) + dpr1.(i+1)\n    |> min (dpl1.(i) + dpr2.(i+1))\n    |> min (dpl2.(i) + dpr1.(i+1)))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1549791659, "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/s690280947.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690280947", "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  for i = 1 to l do a.(i) <- a.(i) + a.(i-1) done;\n  let a x y = a.(y) - a.(x-1) in\n\n  let dpl1, dpl2 = Array.make (l+1) 0, Array.make (l+1) 0 in\n  let dpr1, dpr2 = Array.make (l+2) 0, Array.make (l+2) 0 in\n  for i = 1 to l do\n    dpl1.(i) <- min (a 1 i) @@\n      dpl1.(i-1) + if a i i = 0 then 2 else a i i mod 2;\n    dpl2.(i) <- min dpl1.(i-1) dpl2.(i-1) + (a i i + 1) mod 2;\n  done;\n  for i = l downto 1 do\n    dpr1.(i) <- min (a i l) @@\n      dpr1.(i+1) + if a i i = 0 then 2 else a i i mod 2;\n    dpr2.(i) <- min dpr1.(i+1) dpr2.(i+1) + (a i i + 1) mod 2;\n  done;\n\n  Array.init (l+1) (fun i ->\n    dpl1.(i) + dpr1.(i+1)\n    |> min (dpl1.(i) + dpr2.(i+1))\n    |> min (dpl2.(i) + dpr1.(i+1)))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 893, "cpu_time_ms": 92, "memory_kb": 14464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s127814154", "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  for i = 1 to l do a.(i) <- a.(i) + a.(i-1) done;\n\n  let dp1 = Array.make (l+1) 0 in\n  let dp2 = Array.make (l+2) 0 in\n  for i = 1 to l do\n    dp1.(i) <- min a.(i) (dp1.(i-1) + (a.(i) - a.(i-1) + 1) mod 2)\n  done;\n  for i = l downto 1 do\n    dp2.(i) <- min (a.(l) - a.(i-1)) @@\n      dp2.(i+1) + if a.(i) - a.(i-1) = 0 then 2 else (a.(i) - a.(i-1)) mod 2\n  done;\n\n  Array.init (l+1) (fun i -> dp1.(i) + dp2.(i+1))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1549786295, "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/s127814154.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s127814154", "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  for i = 1 to l do a.(i) <- a.(i) + a.(i-1) done;\n\n  let dp1 = Array.make (l+1) 0 in\n  let dp2 = Array.make (l+2) 0 in\n  for i = 1 to l do\n    dp1.(i) <- min a.(i) (dp1.(i-1) + (a.(i) - a.(i-1) + 1) mod 2)\n  done;\n  for i = l downto 1 do\n    dp2.(i) <- min (a.(l) - a.(i-1)) @@\n      dp2.(i+1) + if a.(i) - a.(i-1) = 0 then 2 else (a.(i) - a.(i-1)) mod 2\n  done;\n\n  Array.init (l+1) (fun i -> dp1.(i) + dp2.(i+1))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 612, "cpu_time_ms": 77, "memory_kb": 10240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s840133912", "group_id": "codeNet:p03135", "input_text": "let _ =\n  let t, x = Scanf.scanf \"%f %f\\n\" (fun t x -> t, x) in\n  print_float @@ t /. x\n", "language": "OCaml", "metadata": {"date": 1552852831, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/OCaml/s840133912.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840133912", "user_id": "u387591304"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "let _ =\n  let t, x = Scanf.scanf \"%f %f\\n\" (fun t x -> t, x) in\n  print_float @@ t /. x\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s004611957", "group_id": "codeNet:p03135", "input_text": "Scanf.scanf \" %f %f\" @@ fun t x ->\n  print_float @@ t /. x", "language": "OCaml", "metadata": {"date": 1550317551, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/OCaml/s004611957.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s004611957", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "Scanf.scanf \" %f %f\" @@ fun t x ->\n  print_float @@ t /. x", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s924174151", "group_id": "codeNet:p03135", "input_text": "let () = Scanf.scanf \"%f %f\" @@ fun t x -> Printf.printf \"%f\" @@ t /. x\n", "language": "OCaml", "metadata": {"date": 1549252634, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/OCaml/s924174151.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924174151", "user_id": "u604818425"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "let () = Scanf.scanf \"%f %f\" @@ fun t x -> Printf.printf \"%f\" @@ t /. x\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s877253173", "group_id": "codeNet:p03136", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let l_ary = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  Printf.printf \"%s\\n\" @@\n  if 2 * (Array.fold_left max min_int l_ary) < Array.fold_left ( + ) 0 l_ary then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1599334079, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s877253173.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s877253173", "user_id": "u052332717"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let l_ary = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  Printf.printf \"%s\\n\" @@\n  if 2 * (Array.fold_left max min_int l_ary) < Array.fold_left ( + ) 0 l_ary then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 6, "memory_kb": 3700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s474088547", "group_id": "codeNet:p03137", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let x = Array.init m (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n    Array.sort compare x;\n    let xd = Array.init (m - 1) (fun i -> x.(i + 1) - x.(i)) in\n    Array.sort compare xd;\n    let rec loop i acc =\n        if i < max 0 (m - n) then acc else\n            loop (i - 1) (acc - xd.(i))\n    in\n    loop (m - 2) (x.(m - 1) - x.(0)) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1584755301, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03137.html", "problem_id": "p03137", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03137/input.txt", "sample_output_relpath": "derived/input_output/data/p03137/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03137/OCaml/s474088547.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474088547", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let x = Array.init m (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n    Array.sort compare x;\n    let xd = Array.init (m - 1) (fun i -> x.(i + 1) - x.(i)) in\n    Array.sort compare xd;\n    let rec loop i acc =\n        if i < max 0 (m - n) then acc else\n            loop (i - 1) (acc - xd.(i))\n    in\n    loop (m - 2) (x.(m - 1) - x.(0)) |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "sample_input": "2 5\n10 12 1 2 14\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03137", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 118, "memory_kb": 5632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s831400112", "group_id": "codeNet:p03137", "input_text": "Scanf.scanf \"%d %d\" @@ fun n m ->\nlet xs = Array.init m (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\nArray.sort (-) xs;\nlet ds = Array.init (m-1) (fun i -> xs.(i+1) - xs.(i)) in\nArray.sort (-) ds;\nArray.sub ds 0 (max 0 @@ m-n) |> Array.fold_left (+) 0\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1549276154, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03137.html", "problem_id": "p03137", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03137/input.txt", "sample_output_relpath": "derived/input_output/data/p03137/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03137/OCaml/s831400112.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s831400112", "user_id": "u798181098"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun n m ->\nlet xs = Array.init m (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\nArray.sort (-) xs;\nlet ds = Array.init (m-1) (fun i -> xs.(i+1) - xs.(i)) in\nArray.sort (-) ds;\nArray.sub ds 0 (max 0 @@ m-n) |> Array.fold_left (+) 0\n|> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "sample_input": "2 5\n10 12 1 2 14\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03137", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 87, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s993749522", "group_id": "codeNet:p03139", "input_text": "Scanf.scanf \" %d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d %d\" (min a b) (max (a+b-n) 0)", "language": "OCaml", "metadata": {"date": 1548668874, "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/s993749522.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s993749522", "user_id": "u481480055"}, "prompt_components": {"gold_output": "3 0\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d %d\" (min a b) (max (a+b-n) 0)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s609396939", "group_id": "codeNet:p03140", "input_text": "let n, a, b, c = Scanf.scanf \" %d %s %s %s\" @@ fun a b c d -> a, b, c, d\nlet _ = Array.(fold_left (+) 0 @@ init n (fun i -> List.(length @@ sort_uniq compare [a.[i]; b.[i]; c.[i]]) - 1)) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1568137593, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03140.html", "problem_id": "p03140", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03140/input.txt", "sample_output_relpath": "derived/input_output/data/p03140/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03140/OCaml/s609396939.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s609396939", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n, a, b, c = Scanf.scanf \" %d %s %s %s\" @@ fun a b c d -> a, b, c, d\nlet _ = Array.(fold_left (+) 0 @@ init n (fun i -> List.(length @@ sort_uniq compare [a.[i]; b.[i]; c.[i]]) - 1)) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\n\n13", "sample_input": "4\nwest\neast\nwait\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03140", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\n\n13", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s359929578", "group_id": "codeNet:p03141", "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 -> (a, b)\nlet ab = List.sort (fun (a, b) (c, d) -> (c + d) - (a + b)) ab\n\ntype next = T | A\n\nlet rec loop sum_t sum_a next rest = match (next, rest) with\n  | (_, []) -> sum_t - sum_a\n  | (T, (a, _) :: xs) -> loop (sum_t + a) sum_a A xs\n  | (A, (_, b) :: xs) -> loop sum_t (sum_a + b) T xs\n\nlet () = Printf.printf \"%d\\n\" @@ loop 0 0 T ab", "language": "OCaml", "metadata": {"date": 1593259466, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s359929578.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359929578", "user_id": "u811309788"}, "prompt_components": {"gold_output": "20\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 -> (a, b)\nlet ab = List.sort (fun (a, b) (c, d) -> (c + d) - (a + b)) ab\n\ntype next = T | A\n\nlet rec loop sum_t sum_a next rest = match (next, rest) with\n  | (_, []) -> sum_t - sum_a\n  | (T, (a, _) :: xs) -> loop (sum_t + a) sum_a A xs\n  | (A, (_, b) :: xs) -> loop sum_t (sum_a + b) T xs\n\nlet () = Printf.printf \"%d\\n\" @@ loop 0 0 T ab", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 125, "memory_kb": 18232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s170634511", "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 module S = Set.Make (struct type t = int let compare = compare end) in\n\n    let rec loop next = function\n        | [] -> if not (S.is_empty next) then loop S.empty (S.elements next)\n        | hd :: tl ->\n            let rec loop2 next = function\n                | [] -> loop next tl\n                | x :: xs ->\n                        let next = S.add x next in\n                        par.(x) <- hd + 1; loop2 next xs\n            in\n            loop2 next nei.(hd)\n    in\n    loop S.empty [ root ];\n    Array.iter (Printf.printf \"%d\\n\") par\n)", "language": "OCaml", "metadata": {"date": 1592027796, "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/s170634511.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s170634511", "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 module S = Set.Make (struct type t = int let compare = compare end) in\n\n    let rec loop next = function\n        | [] -> if not (S.is_empty next) then loop S.empty (S.elements next)\n        | hd :: tl ->\n            let rec loop2 next = function\n                | [] -> loop next tl\n                | x :: xs ->\n                        let next = S.add x next in\n                        par.(x) <- hd + 1; loop2 next xs\n            in\n            loop2 next nei.(hd)\n    in\n    loop S.empty [ 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1004, "cpu_time_ms": 2104, "memory_kb": 18176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s694287697", "group_id": "codeNet:p03145", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b c -> Printf.printf \"%d\\n\" @@ (a * b) / 2)", "language": "OCaml", "metadata": {"date": 1593486813, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s694287697.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s694287697", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b c -> Printf.printf \"%d\\n\" @@ (a * b) / 2)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "sample_input": "3 4 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03145", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 73, "cpu_time_ms": 4, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s258052056", "group_id": "codeNet:p03146", "input_text": "open Hashtbl\nlet h = create 1000000\nlet s = read_int ()\nlet f n = if n mod 2 = 0 then n / 2 else 3 * n + 1\nlet x, i = ref s, ref 1\nlet _ = while not @@ mem h !x do add h !x 1; x := f !x; incr i done; Printf.printf \"%d\\n\" !i", "language": "OCaml", "metadata": {"date": 1568409156, "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/s258052056.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s258052056", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Hashtbl\nlet h = create 1000000\nlet s = read_int ()\nlet f n = if n mod 2 = 0 then n / 2 else 3 * n + 1\nlet x, i = ref s, ref 1\nlet _ = while not @@ mem h !x do add h !x 1; x := f !x; incr i done; Printf.printf \"%d\\n\" !i", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 8, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s514656453", "group_id": "codeNet:p03146", "input_text": "let s = read_int ()\nlet f n = if n mod 2 = 0 then n / 2 else 3 * n + 1\nlet cs, p = Array.make 1000001 0, ref s\nlet _ = cs.(s) <- 1; for i = 2 to 1000000 do p := f !p; if cs.(!p) = 0 then cs.(!p) <- 1 else (Printf.printf \"%d\\n\" i; exit 0) done", "language": "OCaml", "metadata": {"date": 1563759221, "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/s514656453.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514656453", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let s = read_int ()\nlet f n = if n mod 2 = 0 then n / 2 else 3 * n + 1\nlet cs, p = Array.make 1000001 0, ref s\nlet _ = cs.(s) <- 1; for i = 2 to 1000000 do p := f !p; if cs.(!p) = 0 then cs.(!p) <- 1 else (Printf.printf \"%d\\n\" i; exit 0) done", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 7, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s801214482", "group_id": "codeNet:p03146", "input_text": "let kMax = 1000000\n\nlet _ =\n  let s = Scanf.scanf \"%d\" @@ (+) 0 in\n  let flags = Array.make (kMax + 10) false in\n  flags.(s) <- true;\n  let n = ref s in\n  for i = 2 to kMax do\n    n := if !n mod 2 = 0 then !n / 2 else 3 * !n + 1;\n    if flags.(!n) then (Printf.printf \"%d\\n\" i; exit 0);\n    flags.(!n) <- true\n  done", "language": "OCaml", "metadata": {"date": 1558200159, "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/s801214482.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s801214482", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let kMax = 1000000\n\nlet _ =\n  let s = Scanf.scanf \"%d\" @@ (+) 0 in\n  let flags = Array.make (kMax + 10) false in\n  flags.(s) <- true;\n  let n = ref s in\n  for i = 2 to kMax do\n    n := if !n mod 2 = 0 then !n / 2 else 3 * !n + 1;\n    if flags.(!n) then (Printf.printf \"%d\\n\" i; exit 0);\n    flags.(!n) <- true\n  done", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 7, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s568875789", "group_id": "codeNet:p03146", "input_text": "let f n = if n mod 2 = 0 then n/2 else 3 * n + 1\nlet rec g n lst cont =\n  let m = f n in\n  if List.mem m lst then cont+1 else g m (n :: lst) (cont+1)\nlet () =\n  Scanf.scanf \"%d\\n\" (fun s -> g s [] 1)\n  |> print_int", "language": "OCaml", "metadata": {"date": 1554563699, "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/s568875789.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568875789", "user_id": "u307426615"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let f n = if n mod 2 = 0 then n/2 else 3 * n + 1\nlet rec g n lst cont =\n  let m = f n in\n  if List.mem m lst then cont+1 else g m (n :: lst) (cont+1)\nlet () =\n  Scanf.scanf \"%d\\n\" (fun s -> g s [] 1)\n  |> print_int", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s207001840", "group_id": "codeNet:p03146", "input_text": "let rec fix f x = f (fix f) x;;\nScanf.(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  print_int @@ fix (fun f i x ->\n    if a.(x) then i\n    else (\n      a.(x) <- true;\n      f (i+1) (col x)\n    )\n  ) 1 n))", "language": "OCaml", "metadata": {"date": 1549282763, "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/s207001840.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s207001840", "user_id": "u481480055"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let rec fix f x = f (fix f) x;;\nScanf.(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  print_int @@ fix (fun f i x ->\n    if a.(x) then i\n    else (\n      a.(x) <- true;\n      f (i+1) (col x)\n    )\n  ) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 18300}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s887434895", "group_id": "codeNet:p03146", "input_text": "let rec f i = function\n    | 1 -> i+3\n    | 2 -> i+3\n    | 4 -> i+3\n    | n when n mod 2 = 0 ->\n        f (i+1) (n / 2)\n    | n ->\n        f (i+1) (n*3+1)\n\nlet () = Scanf.scanf \"%d\" @@ fun s -> Printf.printf \"%d\" (f 1 s)\n", "language": "OCaml", "metadata": {"date": 1548038232, "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/s887434895.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s887434895", "user_id": "u604818425"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let rec f i = function\n    | 1 -> i+3\n    | 2 -> i+3\n    | 4 -> i+3\n    | n when n mod 2 = 0 ->\n        f (i+1) (n / 2)\n    | n ->\n        f (i+1) (n*3+1)\n\nlet () = Scanf.scanf \"%d\" @@ fun s -> Printf.printf \"%d\" (f 1 s)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s314425754", "group_id": "codeNet:p03147", "input_text": "let sub hs b = List.map (fun a -> a - b) hs \n\nlet divide hs = \n  (*\n  Printf.printf \"hs@divide: %s\\n\" (List.fold_left (fun acc h -> (string_of_int h) ^ \"; \" ^ acc) \"\" hs);\n   *)\n  let rec inner left temp min_h = function\n  | [] -> temp::left, min_h\n  | h::hs when h = 0 -> inner (temp::left) [] 101 hs\n  | h::hs -> inner left (h::temp) (min min_h h) hs\n  in inner [] [] 101 hs\n\nlet rec solve = function\n  | [] -> 0\n  | hs -> \n     match divide hs with\n     | [], min_h -> 0\n     | hss, min_h when List.length hss = 1 -> min_h + (solve @@ sub hs min_h)\n     | hss, _ -> List.fold_left (fun acc hs -> acc + solve hs) 0 hss\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let hs = ref [] in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun h -> hs := h::!hs)\n  done;\n  solve !hs |> print_int\n", "language": "OCaml", "metadata": {"date": 1553851300, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s314425754.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314425754", "user_id": "u387591304"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let sub hs b = List.map (fun a -> a - b) hs \n\nlet divide hs = \n  (*\n  Printf.printf \"hs@divide: %s\\n\" (List.fold_left (fun acc h -> (string_of_int h) ^ \"; \" ^ acc) \"\" hs);\n   *)\n  let rec inner left temp min_h = function\n  | [] -> temp::left, min_h\n  | h::hs when h = 0 -> inner (temp::left) [] 101 hs\n  | h::hs -> inner left (h::temp) (min min_h h) hs\n  in inner [] [] 101 hs\n\nlet rec solve = function\n  | [] -> 0\n  | hs -> \n     match divide hs with\n     | [], min_h -> 0\n     | hss, min_h when List.length hss = 1 -> min_h + (solve @@ sub hs min_h)\n     | hss, _ -> List.fold_left (fun acc hs -> acc + solve hs) 0 hss\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let hs = ref [] in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun h -> hs := h::!hs)\n  done;\n  solve !hs |> print_int\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 832, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s711607416", "group_id": "codeNet:p03147", "input_text": "Scanf.(Array.(scanf \" %d\" @@ fun n ->\n  init n (fun i -> scanf \" %d\" @@ fun v -> v)\n  |> fold_left (fun (sum,prev) v ->\n    if prev < v then sum + v - prev,v\n    else sum,v\n  ) (0,0)\n  |> fst |> print_int))", "language": "OCaml", "metadata": {"date": 1549261672, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s711607416.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711607416", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.(Array.(scanf \" %d\" @@ fun n ->\n  init n (fun i -> scanf \" %d\" @@ fun v -> v)\n  |> fold_left (fun (sum,prev) v ->\n    if prev < v then sum + v - prev,v\n    else sum,v\n  ) (0,0)\n  |> fst |> print_int))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s516969734", "group_id": "codeNet:p03150", "input_text": "Scanf.scanf \" %s\" @@ fun s ->\n  let n = String.length s in\n  for i=0 to n-1 do\n    for j=i to n-1 do\n      let t = String.(sub s 0 i ^ sub s j (n-j)) in\n      print_endline t;\n      if t = \"keyence\" then (\n        print_endline \"YES\"; exit 0)\n    done\n  done;\n  print_endline \"NO\"", "language": "OCaml", "metadata": {"date": 1549155637, "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/s516969734.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s516969734", "user_id": "u481480055"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "Scanf.scanf \" %s\" @@ fun s ->\n  let n = String.length s in\n  for i=0 to n-1 do\n    for j=i to n-1 do\n      let t = String.(sub s 0 i ^ sub s j (n-j)) in\n      print_endline t;\n      if t = \"keyence\" then (\n        print_endline \"YES\"; exit 0)\n    done\n  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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 280, "cpu_time_ms": 8, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s817717067", "group_id": "codeNet:p03156", "input_text": "let n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet cs = Array.make 3 0\nlet f i = cs.(i) <- cs.(i) + 1\nlet _ = Array.iter (fun p -> if p <= a then f 0 else if p <= b then f 1 else f 2) ps;\n  Array.fold_left min 100 cs |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1563728544, "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/s817717067.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817717067", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet cs = Array.make 3 0\nlet f i = cs.(i) <- cs.(i) + 1\nlet _ = Array.iter (fun p -> if p <= a then f 0 else if p <= b then f 1 else f 2) ps;\n  Array.fold_left min 100 cs |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s168077683", "group_id": "codeNet:p03156", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  let c = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let x = Array.fold_left (fun s v -> if v <= a then s+1 else s) 0 c in\n  let y = Array.fold_left (fun s v -> if v <= b then s+1 else s) 0 c in\n  min x (y-x) |> min (n-y) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1547351843, "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/s168077683.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s168077683", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  let c = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let x = Array.fold_left (fun s v -> if v <= a then s+1 else s) 0 c in\n  let y = Array.fold_left (fun s v -> if v <= b then s+1 else s) 0 c in\n  min x (y-x) |> min (n-y) |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s138826318", "group_id": "codeNet:p03156", "input_text": "let () = Scanf.scanf \"%d\\n%d %d\\n\" @@ fun n a b ->\n  let ps =\n    Array.to_list @@\n    Array.init n @@ fun _ ->\n      Scanf.scanf \"%d \" @@ fun p -> p in\n  Printf.printf \"%d\\n\" @@\n    List.fold_left min max_int @@\n    List.map List.length\n    [ List.filter (fun p -> p <= a) ps;\n      List.filter (fun p -> a < p && p <= b) ps;\n      List.filter (fun p -> b < p) ps ]\n\n", "language": "OCaml", "metadata": {"date": 1547323584, "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/s138826318.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s138826318", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n%d %d\\n\" @@ fun n a b ->\n  let ps =\n    Array.to_list @@\n    Array.init n @@ fun _ ->\n      Scanf.scanf \"%d \" @@ fun p -> p in\n  Printf.printf \"%d\\n\" @@\n    List.fold_left min max_int @@\n    List.map List.length\n    [ List.filter (fun p -> p <= a) ps;\n      List.filter (fun p -> a < p && p <= b) ps;\n      List.filter (fun p -> b < p) ps ]\n\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s227994641", "group_id": "codeNet:p03166", "input_text": "let memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x =\n    try Hashtbl.find dp x with\n    | Not_found ->\n        let result = f get x in\n        Hashtbl.add dp x result;\n        result in\n  get\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  for i = 1 to m do\n    Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n      es.(x - 1) <- y - 1 :: es.(x - 1)\n  done;\n  let dp = memoize n @@ fun dp v ->\n    List.fold_right (fun u -> max @@ 1 + dp u) es.(v) 0 in\n  Printf.printf \"%d\\n\" @@ Array.fold_left max min_int @@ Array.init n dp\n", "language": "OCaml", "metadata": {"date": 1546815416, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03166.html", "problem_id": "p03166", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03166/input.txt", "sample_output_relpath": "derived/input_output/data/p03166/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03166/OCaml/s227994641.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s227994641", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x =\n    try Hashtbl.find dp x with\n    | Not_found ->\n        let result = f get x in\n        Hashtbl.add dp x result;\n        result in\n  get\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  for i = 1 to m do\n    Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n      es.(x - 1) <- y - 1 :: es.(x - 1)\n  done;\n  let dp = memoize n @@ fun dp v ->\n    List.fold_right (fun u -> max @@ 1 + dp u) es.(v) 0 in\n  Printf.printf \"%d\\n\" @@ Array.fold_left max min_int @@ Array.init n dp\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "sample_input": "4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03166", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 88, "memory_kb": 13568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s580378440", "group_id": "codeNet:p03169", "input_text": "open Printf\n\nlet n = int_of_string @@ read_line ()\nlet a =\n  Str.split (Str.regexp \" \") @@ read_line ()\n  |> List.map int_of_string\n\nlet cnt = Array.make 4 0\nlet dp = Array.make (n+1) @@ Array.make_matrix (0) (0) (-1.0)\n\nlet rec calc: int -> int -> int -> float = fun i1 i2 i3 ->\n  if dp.(i1).(i2).(i3) <> -1.0 then dp.(i1).(i2).(i3)\n  else\n    let numer =\n      (float n)\n      +. (if i1 = 0 then 0. else ((float i1) *. calc (i1-1) i2 i3))\n      +. (if i2 = 0 then 0. else ((float i2) *. calc (i1+1) (i2-1) i3))\n      +. (if i3 = 0 then 0. else ((float i3) *. calc i1 (i2+1) (i3-1))) in\n    let denom = float @@ i1 + i2 + i3 in\n\n    let res = numer /. denom in\n\n    dp.(i1).(i2).(i3) <- res ;\n    res\n\n\nlet () =\n  List.iter (fun x -> cnt.(x) <- cnt.(x) + 1) a ;\n  for z = 0 to n do\n        dp.(z) <- Array.make_matrix (n+1) (n+1) (-1.0)\n      done;\n  dp.(0).(0).(0) <- 0.0 ;\n  begin\n    calc cnt.(1) cnt.(2) cnt.(3)\n    |> string_of_float\n    |> print_endline\n  end\n", "language": "OCaml", "metadata": {"date": 1553059415, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03169.html", "problem_id": "p03169", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03169/input.txt", "sample_output_relpath": "derived/input_output/data/p03169/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03169/OCaml/s580378440.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s580378440", "user_id": "u098968285"}, "prompt_components": {"gold_output": "5.5\n", "input_to_evaluate": "open Printf\n\nlet n = int_of_string @@ read_line ()\nlet a =\n  Str.split (Str.regexp \" \") @@ read_line ()\n  |> List.map int_of_string\n\nlet cnt = Array.make 4 0\nlet dp = Array.make (n+1) @@ Array.make_matrix (0) (0) (-1.0)\n\nlet rec calc: int -> int -> int -> float = fun i1 i2 i3 ->\n  if dp.(i1).(i2).(i3) <> -1.0 then dp.(i1).(i2).(i3)\n  else\n    let numer =\n      (float n)\n      +. (if i1 = 0 then 0. else ((float i1) *. calc (i1-1) i2 i3))\n      +. (if i2 = 0 then 0. else ((float i2) *. calc (i1+1) (i2-1) i3))\n      +. (if i3 = 0 then 0. else ((float i3) *. calc i1 (i2+1) (i3-1))) in\n    let denom = float @@ i1 + i2 + i3 in\n\n    let res = numer /. denom in\n\n    dp.(i1).(i2).(i3) <- res ;\n    res\n\n\nlet () =\n  List.iter (fun x -> cnt.(x) <- cnt.(x) + 1) a ;\n  for z = 0 to n do\n        dp.(z) <- Array.make_matrix (n+1) (n+1) (-1.0)\n      done;\n  dp.(0).(0).(0) <- 0.0 ;\n  begin\n    calc cnt.(1) cnt.(2) cnt.(3)\n    |> string_of_float\n    |> print_endline\n  end\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N dishes, numbered 1, 2, \\ldots, N.\nInitially, for each i (1 \\leq i \\leq N), Dish i has a_i (1 \\leq a_i \\leq 3) pieces of sushi on it.\n\nTaro will perform the following operation repeatedly until all the pieces of sushi are eaten:\n\nRoll a die that shows the numbers 1, 2, \\ldots, N with equal probabilities, and let i be the outcome. If there are some pieces of sushi on Dish i, eat one of them; if there is none, do nothing.\n\nFind the expected number of times the operation is performed before all the pieces of sushi are eaten.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 3\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 expected number of times the operation is performed before all the pieces of sushi are eaten.\nThe output is considered correct when the relative difference is not greater than 10^{-9}.\n\nSample Input 1\n\n3\n1 1 1\n\nSample Output 1\n\n5.5\n\nThe expected number of operations before the first piece of sushi is eaten, is 1.\nAfter that, the expected number of operations before the second sushi is eaten, is 1.5.\nAfter that, the expected number of operations before the third sushi is eaten, is 3.\nThus, the expected total number of operations is 1 + 1.5 + 3 = 5.5.\n\nSample Input 2\n\n1\n3\n\nSample Output 2\n\n3\n\nOutputs such as 3.00, 3.000000003 and 2.999999997 will also be accepted.\n\nSample Input 3\n\n2\n1 2\n\nSample Output 3\n\n4.5\n\nSample Input 4\n\n10\n1 3 2 3 3 2 3 2 1 3\n\nSample Output 4\n\n54.48064457488221", "sample_input": "3\n1 1 1\n"}, "reference_outputs": ["5.5\n"], "source_document_id": "p03169", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N dishes, numbered 1, 2, \\ldots, N.\nInitially, for each i (1 \\leq i \\leq N), Dish i has a_i (1 \\leq a_i \\leq 3) pieces of sushi on it.\n\nTaro will perform the following operation repeatedly until all the pieces of sushi are eaten:\n\nRoll a die that shows the numbers 1, 2, \\ldots, N with equal probabilities, and let i be the outcome. If there are some pieces of sushi on Dish i, eat one of them; if there is none, do nothing.\n\nFind the expected number of times the operation is performed before all the pieces of sushi are eaten.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 300\n\n1 \\leq a_i \\leq 3\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 expected number of times the operation is performed before all the pieces of sushi are eaten.\nThe output is considered correct when the relative difference is not greater than 10^{-9}.\n\nSample Input 1\n\n3\n1 1 1\n\nSample Output 1\n\n5.5\n\nThe expected number of operations before the first piece of sushi is eaten, is 1.\nAfter that, the expected number of operations before the second sushi is eaten, is 1.5.\nAfter that, the expected number of operations before the third sushi is eaten, is 3.\nThus, the expected total number of operations is 1 + 1.5 + 3 = 5.5.\n\nSample Input 2\n\n1\n3\n\nSample Output 2\n\n3\n\nOutputs such as 3.00, 3.000000003 and 2.999999997 will also be accepted.\n\nSample Input 3\n\n2\n1 2\n\nSample Output 3\n\n4.5\n\nSample Input 4\n\n10\n1 3 2 3 3 2 3 2 1 3\n\nSample Output 4\n\n54.48064457488221", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 967, "cpu_time_ms": 322, "memory_kb": 220276}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s839805743", "group_id": "codeNet:p03170", "input_text": "let puts st = print_string st; print_string \"\\n\"\nlet puti num = print_int num; print_string \"\\n\"\nlet getSL () = Str.split (Str.regexp \" \") (read_line ())\nlet getAS () = Array.of_list @@ getSL ()\nlet getLI () = List.map int_of_string (getSL ())\nlet getAI () = Array.of_list (getLI ())\nlet geti () = int_of_string (read_line ())\nlet rep n f =\n    let rec repimpl i n = if i < n then (f i; repimpl (i+1) n) else () in repimpl 0 n\nlet rep_from from until f =\n    let rec repimpl i n = if i < n then (f i; repimpl (i+1) n) else () in repimpl from until\n\n\nlet () =\n    let n :: k :: _ = getLI() in\n    let inl = getAI() in\n    let dp = Array.make (k+1) false in\n    rep (k+1) (fun i ->\n        Array.iter (fun v ->\n            if v+i <= k then\n                dp.(v+i) <- dp.(v+i) || not dp.(i);\n        ) inl\n    );\n    puts @@ if dp.(k) then \"First\" else \"Second\"\n", "language": "OCaml", "metadata": {"date": 1562647624, "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/s839805743.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839805743", "user_id": "u895515293"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "let puts st = print_string st; print_string \"\\n\"\nlet puti num = print_int num; print_string \"\\n\"\nlet getSL () = Str.split (Str.regexp \" \") (read_line ())\nlet getAS () = Array.of_list @@ getSL ()\nlet getLI () = List.map int_of_string (getSL ())\nlet getAI () = Array.of_list (getLI ())\nlet geti () = int_of_string (read_line ())\nlet rep n f =\n    let rec repimpl i n = if i < n then (f i; repimpl (i+1) n) else () in repimpl 0 n\nlet rep_from from until f =\n    let rec repimpl i n = if i < n then (f i; repimpl (i+1) n) else () in repimpl from until\n\n\nlet () =\n    let n :: k :: _ = getLI() in\n    let inl = getAI() in\n    let dp = Array.make (k+1) false in\n    rep (k+1) (fun i ->\n        Array.iter (fun v ->\n            if v+i <= k then\n                dp.(v+i) <- dp.(v+i) || not dp.(i);\n        ) inl\n    );\n    puts @@ if dp.(k) then \"First\" else \"Second\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 a_2 \\ldots a_N\n\nOutput\n\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "sample_input": "2 4\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03170", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 a_2 \\ldots a_N\n\nOutput\n\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 860, "cpu_time_ms": 78, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s837214312", "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 rec solve i j t =\n  if t then\n    if i = j then arr.(i)\n    else\n      max (solve (succ i) j  false + arr.(i))\n        (solve i (pred j) false + arr.(j))\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": 1588710944, "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/s837214312.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s837214312", "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 rec solve i j t =\n  if t then\n    if i = j then arr.(i)\n    else\n      max (solve (succ i) j  false + arr.(i))\n        (solve i (pred j) false + arr.(j))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2263, "cpu_time_ms": 2103, "memory_kb": 3456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s088112978", "group_id": "codeNet:p03186", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    let bc = min b c in\n    let o = bc * 2 in\n    let c = c - bc in\n    let b = b - bc in\n\n    let ac = min a c in\n    let o = o + ac in\n    let c = c - ac in\n    let a = a - ac in\n    let o = if c > 0 then o + 1 else o in\n    let o = o + b in\n    Printf.printf \"%d\\n\" o\n)", "language": "OCaml", "metadata": {"date": 1596599564, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03186.html", "problem_id": "p03186", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03186/input.txt", "sample_output_relpath": "derived/input_output/data/p03186/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03186/OCaml/s088112978.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s088112978", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    let bc = min b c in\n    let o = bc * 2 in\n    let c = c - bc in\n    let b = b - bc in\n\n    let ac = min a c in\n    let o = o + ac in\n    let c = c - ac in\n    let a = a - ac in\n    let o = if c > 0 then o + 1 else o in\n    let o = o + b in\n    Printf.printf \"%d\\n\" o\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\n\nA,B and C are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "sample_input": "3 1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03186", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\n\nA,B and C are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s879083642", "group_id": "codeNet:p03192", "input_text": "let n = read_line ()\nlet f x s = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet _ = Printf.printf \"%d\\n\" @@ f '2' n", "language": "OCaml", "metadata": {"date": 1563577832, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03192.html", "problem_id": "p03192", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03192/input.txt", "sample_output_relpath": "derived/input_output/data/p03192/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03192/OCaml/s879083642.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s879083642", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n = read_line ()\nlet f x s = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet _ = Printf.printf \"%d\\n\" @@ f '2' n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N that has exactly four digits in base ten.\nHow many times does 2 occur in the base-ten representation of N?\n\nConstraints\n\n1000 \\leq N \\leq 9999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n3\n\n2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).\n\nSample Input 2\n\n3456\n\nSample Output 2\n\n0\n\nSample Input 3\n\n9592\n\nSample Output 3\n\n1", "sample_input": "1222\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03192", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N that has exactly four digits in base ten.\nHow many times does 2 occur in the base-ten representation of N?\n\nConstraints\n\n1000 \\leq N \\leq 9999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n3\n\n2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).\n\nSample Input 2\n\n3456\n\nSample Output 2\n\n0\n\nSample Input 3\n\n9592\n\nSample Output 3\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s460622059", "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 = if n <= 0 then 1 else b * pow b (n - 1)\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": 1561050100, "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/s460622059.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s460622059", "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 = if n <= 0 then 1 else b * pow b (n - 1)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 550, "cpu_time_ms": 13, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s562115014", "group_id": "codeNet:p03194", "input_text": "(* log(n) *)\nlet rec is_divisible n m c =\n  if c = 0 then\n    true\n  else\n    if n mod m = 0 then\n      is_divisible (n / m) m (c - 1)\n    else\n      false\n\n(* O(√p * log(p)) *)\nlet solve n p =\n  if n = 1 then\n    p\n  else (* n >= 2 *)\n    let m = int_of_float (floor (sqrt (float_of_int p))) in\n    let rec loop g =\n      if is_divisible p g n then\n        g\n      else\n        loop (g - 1)\n    in\n      loop m (* n >= 2 では g <= m (∵ 指数関数の単調増加性より) *)\n\nlet _ = Scanf.scanf \"%d %d\" (fun n p -> solve n p |> string_of_int |> print_endline)", "language": "OCaml", "metadata": {"date": 1557054588, "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/s562115014.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s562115014", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* log(n) *)\nlet rec is_divisible n m c =\n  if c = 0 then\n    true\n  else\n    if n mod m = 0 then\n      is_divisible (n / m) m (c - 1)\n    else\n      false\n\n(* O(√p * log(p)) *)\nlet solve n p =\n  if n = 1 then\n    p\n  else (* n >= 2 *)\n    let m = int_of_float (floor (sqrt (float_of_int p))) in\n    let rec loop g =\n      if is_divisible p g n then\n        g\n      else\n        loop (g - 1)\n    in\n      loop m (* n >= 2 では g <= m (∵ 指数関数の単調増加性より) *)\n\nlet _ = Scanf.scanf \"%d %d\" (fun n p -> solve n p |> string_of_int |> print_endline)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03194", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 569, "cpu_time_ms": 2103, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s962123070", "group_id": "codeNet:p03194", "input_text": "(* O(√n) *)\nlet lowest_prime_factor n =\n  let m = int_of_float (floor (sqrt (float_of_int n))) in\n  let rec loop i =\n    if i > m then\n      n\n    else\n      if n mod i = 0 then i else loop (i + 1)\n  in\n    loop 2\n\n(* O(√n * log(n)) *)\nlet factorize_primes n =\n  if n <= 1 then\n    []\n  else\n    let rec loop sofar (p, count) m =\n      if m = 1 then\n        List.tl (List.rev ((p, count) :: sofar))\n      else\n        let prime = lowest_prime_factor m in\n        if p = prime then\n          loop sofar (p, count + 1) (m / p)\n        else\n          loop ((p, count) :: sofar) (prime, 1) (m / prime)\n    in\n      loop [] (1, 0) n\n\nlet solve n p =\n  if p = 1 then\n    1\n  else\n    List.fold_left\n      (fun sofar (p, count) ->\n        let factor = int_of_float (float_of_int p ** float_of_int (count / n)) in\n        sofar * factor)\n      1\n      (factorize_primes p)\n\nlet _ = Scanf.scanf \"%d %d\" (fun n p -> solve n p |> string_of_int |> print_endline)", "language": "OCaml", "metadata": {"date": 1557053291, "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/s962123070.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962123070", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(√n) *)\nlet lowest_prime_factor n =\n  let m = int_of_float (floor (sqrt (float_of_int n))) in\n  let rec loop i =\n    if i > m then\n      n\n    else\n      if n mod i = 0 then i else loop (i + 1)\n  in\n    loop 2\n\n(* O(√n * log(n)) *)\nlet factorize_primes n =\n  if n <= 1 then\n    []\n  else\n    let rec loop sofar (p, count) m =\n      if m = 1 then\n        List.tl (List.rev ((p, count) :: sofar))\n      else\n        let prime = lowest_prime_factor m in\n        if p = prime then\n          loop sofar (p, count + 1) (m / p)\n        else\n          loop ((p, count) :: sofar) (prime, 1) (m / prime)\n    in\n      loop [] (1, 0) n\n\nlet solve n p =\n  if p = 1 then\n    1\n  else\n    List.fold_left\n      (fun sofar (p, count) ->\n        let factor = int_of_float (float_of_int p ** float_of_int (count / n)) in\n        sofar * factor)\n      1\n      (factorize_primes p)\n\nlet _ = Scanf.scanf \"%d %d\" (fun n p -> solve n p |> string_of_int |> print_endline)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03194", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 954, "cpu_time_ms": 6, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s504112132", "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\n        (as_.(0) - as_.(1)) mod 2 = 0 && as_.(0) <> as_.(1)\n      then \"second\"\n      else \"first\"\n", "language": "OCaml", "metadata": {"date": 1545533597, "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/s504112132.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504112132", "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\n        (as_.(0) - as_.(1)) mod 2 = 0 && as_.(0) <> as_.(1)\n      then \"second\"\n      else \"first\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 386, "cpu_time_ms": 67, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s882321005", "group_id": "codeNet:p03207", "input_text": "let rec f maxN others lst =\n  match lst with\n  | [] -> (maxN, others)\n  | x :: xs -> if x > maxN then f x (maxN :: others) xs else f maxN (x :: others) xs\nlet rec sum lst = match lst with\n  | [] -> 0\n  | x :: xs -> x + sum xs\nlet () =\n  Scanf.scanf \"%d\\n\"\n    (fun n -> Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x -> x)))\n  |> Array.to_list |> f 0 []\n  |> (fun (maxN, others) -> maxN/2 + sum others) |> print_int", "language": "OCaml", "metadata": {"date": 1554570521, "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/s882321005.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s882321005", "user_id": "u307426615"}, "prompt_components": {"gold_output": "15950\n", "input_to_evaluate": "let rec f maxN others lst =\n  match lst with\n  | [] -> (maxN, others)\n  | x :: xs -> if x > maxN then f x (maxN :: others) xs else f maxN (x :: others) xs\nlet rec sum lst = match lst with\n  | [] -> 0\n  | x :: xs -> x + sum xs\nlet () =\n  Scanf.scanf \"%d\\n\"\n    (fun n -> Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x -> x)))\n  |> Array.to_list |> f 0 []\n  |> (fun (maxN, others) -> maxN/2 + sum others) |> print_int", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "sample_input": "3\n4980\n7980\n6980\n"}, "reference_outputs": ["15950\n"], "source_document_id": "p03207", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s367401600", "group_id": "codeNet:p03207", "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))\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 let a = input_i64_array n in\n  let mx = fold_left max 0L a in\n  printf \"%Ld\\n\" @@\n    (fold_left (+) 0L a - mx/2L)\n\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1544321567, "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/s367401600.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s367401600", "user_id": "u481480055"}, "prompt_components": {"gold_output": "15950\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))\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 let a = input_i64_array n in\n  let mx = fold_left max 0L a in\n  printf \"%Ld\\n\" @@\n    (fold_left (+) 0L a - mx/2L)\n\n\n\n\n\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "sample_input": "3\n4980\n7980\n6980\n"}, "reference_outputs": ["15950\n"], "source_document_id": "p03207", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5747, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s417217937", "group_id": "codeNet:p03210", "input_text": "open Printf\nopen Scanf\n\nlet solve x =\n  if List.mem x [3;5;7] then \"YES\" else \"NO\"\n\nlet () =\n  scanf \"%d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582078562, "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/s417217937.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417217937", "user_id": "u388783188"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve x =\n  if List.mem x [3;5;7] then \"YES\" else \"NO\"\n\nlet () =\n  scanf \"%d \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 130, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s879024270", "group_id": "codeNet:p03210", "input_text": "print_endline @@ match read_int () with 3 | 5 | 7 -> \"YES\" | _ -> \"NO\"", "language": "OCaml", "metadata": {"date": 1565010449, "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/s879024270.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s879024270", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "print_endline @@ match read_int () with 3 | 5 | 7 -> \"YES\" | _ -> \"NO\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s432104294", "group_id": "codeNet:p03210", "input_text": "let () =\n  Scanf.scanf \"%d\\n\"\n    (fun x -> if x = 3 || x = 5 || x = 7 then \"Yes\" else \"No\") |> print_string", "language": "OCaml", "metadata": {"date": 1554570645, "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/s432104294.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s432104294", "user_id": "u307426615"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\"\n    (fun x -> if x = 3 || x = 5 || x = 7 then \"Yes\" else \"No\") |> print_string", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s896375849", "group_id": "codeNet:p03210", "input_text": "let n = read_int ();;\nlet yes = \"YES\";;\nlet no = \"NO\";;\nprint_endline ((function 3->yes|5->yes|7->yes|n->no) n)\n", "language": "OCaml", "metadata": {"date": 1544201881, "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/s896375849.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896375849", "user_id": "u981708764"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let n = read_int ();;\nlet yes = \"YES\";;\nlet no = \"NO\";;\nprint_endline ((function 3->yes|5->yes|7->yes|n->no) n)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s710362109", "group_id": "codeNet:p03211", "input_text": "let s = read_line ()\nlet ans = ref max_int\nlet f i = Char.code s.[i] - 48\nlet _ =\n  for i = 0 to String.length s - 3 do ans := min !ans @@ abs @@ f i * 100 + f (i + 1) * 10 + f (i + 2) - 753 done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1563127368, "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/s710362109.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710362109", "user_id": "u732304692"}, "prompt_components": {"gold_output": "34\n", "input_to_evaluate": "let s = read_line ()\nlet ans = ref max_int\nlet f i = Char.code s.[i] - 48\nlet _ =\n  for i = 0 to String.length s - 3 do ans := min !ans @@ abs @@ f i * 100 + f (i + 1) * 10 + f (i + 2) - 753 done;\n  Printf.printf \"%d\\n\" !ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s569959211", "group_id": "codeNet:p03214", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %f\" (+.) 0.\nlet avg = Array.fold_left (+.) 0. a_s /. float n\nlet ans, m = ref 0, ref max_float\nlet _ = Array.iteri (fun i a -> let d = abs_float (a -. avg) in if d < !m then (ans := i; m := d)) a_s; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1565360293, "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/s569959211.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s569959211", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %f\" (+.) 0.\nlet avg = Array.fold_left (+.) 0. a_s /. float n\nlet ans, m = ref 0, ref max_float\nlet _ = Array.iteri (fun i a -> let d = abs_float (a -. avg) in if d < !m then (ans := i; m := d)) a_s; Printf.printf \"%d\\n\" !ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s235095865", "group_id": "codeNet:p03214", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let sum = Array.fold_left ( + ) 0 as_ in\n  Printf.printf \"%d\\n\" @@ Array.fold_left (fun i j ->\n    if abs (sum - as_.(i) * n) <= abs (sum - as_.(j) * n) then i else j) 0 @@\n  Array.init n @@ fun i -> i\n\n", "language": "OCaml", "metadata": {"date": 1549230566, "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/s235095865.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s235095865", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\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  let sum = Array.fold_left ( + ) 0 as_ in\n  Printf.printf \"%d\\n\" @@ Array.fold_left (fun i j ->\n    if abs (sum - as_.(i) * n) <= abs (sum - as_.(j) * n) then i else j) 0 @@\n  Array.init n @@ fun i -> i\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 317, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s925463762", "group_id": "codeNet:p03220", "input_text": "let () = Scanf.scanf \"%d\\n%d %d\\n\" @@ fun n t a ->\n  let hs = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun h -> i, h in\n  Printf.printf \"%d\\n\" @@ succ @@ fst @@\n  Array.fold_left (fun (i, hi) (j, hj) ->\n    if abs (1000 * a - 1000 * t + hi * 6) <= abs (1000 * a - 1000 * t + hj * 6)\n    then (i, hi)\n    else (j, hj)) hs.(0) hs\n\n", "language": "OCaml", "metadata": {"date": 1541383542, "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/s925463762.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s925463762", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n%d %d\\n\" @@ fun n t a ->\n  let hs = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun h -> i, h in\n  Printf.printf \"%d\\n\" @@ succ @@ fst @@\n  Array.fold_left (fun (i, hi) (j, hj) ->\n    if abs (1000 * a - 1000 * t + hi * 6) <= abs (1000 * a - 1000 * t + hj * 6)\n    then (i, hi)\n    else (j, hj)) hs.(0) hs\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 334, "cpu_time_ms": 2, "memory_kb": 4608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s552788385", "group_id": "codeNet:p03221", "input_text": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let towns = Array.init m (fun i -> \n    Scanf.scanf \" %d %d\" @@ fun p y -> y, i, p) in\n  let l6 = Array.make n 1 in\n  let answers = Array.make m \"\" in\n  Array.sort compare towns;\n  towns |> Array.iter (fun (y,i,p) ->\n    answers.(i) <-\n      Printf.sprintf \"%06d%06d\" p l6.(p-1);\n    l6.(p-1) <- l6.(p-1) + 1);\n  answers |> Array.iter print_endline\n\n", "language": "OCaml", "metadata": {"date": 1541383885, "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/s552788385.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s552788385", "user_id": "u798181098"}, "prompt_components": {"gold_output": "000001000002\n000002000001\n000001000001\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let towns = Array.init m (fun i -> \n    Scanf.scanf \" %d %d\" @@ fun p y -> y, i, p) in\n  let l6 = Array.make n 1 in\n  let answers = Array.make m \"\" in\n  Array.sort compare towns;\n  towns |> Array.iter (fun (y,i,p) ->\n    answers.(i) <-\n      Printf.sprintf \"%06d%06d\" p l6.(p-1);\n    l6.(p-1) <- l6.(p-1) + 1);\n  answers |> Array.iter print_endline\n\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 348, "memory_kb": 12416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s628030673", "group_id": "codeNet:p03227", "input_text": "let s = read_line ()\nlet _ = if String.length s = 2 then print_endline s else Printf.printf \"%c%c%c\\n\" s.[2] s.[1] s.[0]", "language": "OCaml", "metadata": {"date": 1563834190, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03227.html", "problem_id": "p03227", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03227/input.txt", "sample_output_relpath": "derived/input_output/data/p03227/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03227/OCaml/s628030673.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s628030673", "user_id": "u732304692"}, "prompt_components": {"gold_output": "cba\n", "input_to_evaluate": "let s = read_line ()\nlet _ = if String.length s = 2 then print_endline s else Printf.printf \"%c%c%c\\n\" s.[2] s.[1] s.[0]", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 2 or 3 consisting of lowercase English letters. If the length of the string is 2, print it as is; if the length is 3, print the string after reversing it.\n\nConstraints\n\nThe length of S is 2 or 3.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the length of S is 2, print S as is; if the length is 3, print S after reversing it.\n\nSample Input 1\n\nabc\n\nSample Output 1\n\ncba\n\nAs the length of S is 3, we print it after reversing it.\n\nSample Input 2\n\nac\n\nSample Output 2\n\nac\n\nAs the length of S is 2, we print it as is.", "sample_input": "abc\n"}, "reference_outputs": ["cba\n"], "source_document_id": "p03227", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 2 or 3 consisting of lowercase English letters. If the length of the string is 2, print it as is; if the length is 3, print the string after reversing it.\n\nConstraints\n\nThe length of S is 2 or 3.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the length of S is 2, print S as is; if the length is 3, print S after reversing it.\n\nSample Input 1\n\nabc\n\nSample Output 1\n\ncba\n\nAs the length of S is 3, we print it after reversing it.\n\nSample Input 2\n\nac\n\nSample Output 2\n\nac\n\nAs the length of S is 2, we print it as is.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s455466720", "group_id": "codeNet:p03228", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b k ->\n    let rec loop a b r =\n        if r = 0 then (if k mod 2 = 0 then Printf.printf \"%d %d\\n\" a b\n                                      else Printf.printf \"%d %d\\n\" b a)\n        else\n            let c = a / 2 in\n            loop (b + c) (a / 2 * 2 - c) (r - 1)\n    in\n    loop a b k\n)", "language": "OCaml", "metadata": {"date": 1595476268, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s455466720.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455466720", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5 3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b k ->\n    let rec loop a b r =\n        if r = 0 then (if k mod 2 = 0 then Printf.printf \"%d %d\\n\" a b\n                                      else Printf.printf \"%d %d\\n\" b a)\n        else\n            let c = a / 2 in\n            loop (b + c) (a / 2 * 2 - c) (r - 1)\n    in\n    loop a b k\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "sample_input": "5 4 2\n"}, "reference_outputs": ["5 3\n"], "source_document_id": "p03228", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 319, "cpu_time_ms": 6, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s526421266", "group_id": "codeNet:p03228", "input_text": "let a, b, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ns = [|a; b|]\nlet _ =\n  for i = 0 to k - 1 do\n    let r = i mod 2 in\n    if ns.(r) mod 2 = 1 then ns.(r) <- ns.(r) - 1; ns.(1 - r) <- ns.(1 - r) + ns.(r) / 2; ns.(r) <- ns.(r) / 2 done;\n  Printf.printf \"%d %d\\n\" ns.(0) ns.(1)", "language": "OCaml", "metadata": {"date": 1563836135, "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/s526421266.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s526421266", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5 3\n", "input_to_evaluate": "let a, b, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ns = [|a; b|]\nlet _ =\n  for i = 0 to k - 1 do\n    let r = i mod 2 in\n    if ns.(r) mod 2 = 1 then ns.(r) <- ns.(r) - 1; ns.(1 - r) <- ns.(1 - r) + ns.(r) / 2; ns.(r) <- ns.(r) / 2 done;\n  Printf.printf \"%d %d\\n\" ns.(0) ns.(1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "sample_input": "5 4 2\n"}, "reference_outputs": ["5 3\n"], "source_document_id": "p03228", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s069244773", "group_id": "codeNet:p03230", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let dump k =\n        let a = Array.make k [] in\n        let rec loop_i i cur =\n            let rec loop_j j cur =\n                if j >= k then cur else (\n                    a.(i) <- cur :: a.(i);\n                    a.(j) <- cur :: a.(j);\n                    loop_j (j + 1) (cur + 1)\n                )\n            in\n            if i = k then () else\n                loop_i (i + 1) (loop_j (i + 1) cur)\n        in\n        loop_i 0 1;\n        Array.iter (fun l ->\n            let b = Array.of_list l in\n            Printf.printf \"%d\" (Array.length b);\n            Array.iter (Printf.printf \" %d\") b;\n            print_newline ()) a\n    in\n\n    let rec loop k =\n        let k2 = k * (k - 1) / 2 in\n        if k2 = n then k else\n            if k2 < n then loop (k + 1) else (-1)\n    in\n    let k = loop 2 in\n    if k < 0 then print_endline \"No\" else (\n        Printf.printf \"Yes\\n%d\\n\" k;\n        dump k\n    )\n)", "language": "OCaml", "metadata": {"date": 1597974401, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03230.html", "problem_id": "p03230", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03230/input.txt", "sample_output_relpath": "derived/input_output/data/p03230/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03230/OCaml/s069244773.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069244773", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n3\n2 1 2\n2 3 1\n2 2 3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let dump k =\n        let a = Array.make k [] in\n        let rec loop_i i cur =\n            let rec loop_j j cur =\n                if j >= k then cur else (\n                    a.(i) <- cur :: a.(i);\n                    a.(j) <- cur :: a.(j);\n                    loop_j (j + 1) (cur + 1)\n                )\n            in\n            if i = k then () else\n                loop_i (i + 1) (loop_j (i + 1) cur)\n        in\n        loop_i 0 1;\n        Array.iter (fun l ->\n            let b = Array.of_list l in\n            Printf.printf \"%d\" (Array.length b);\n            Array.iter (Printf.printf \" %d\") b;\n            print_newline ()) a\n    in\n\n    let rec loop k =\n        let k2 = k * (k - 1) / 2 in\n        if k2 = n then k else\n            if k2 < n then loop (k + 1) else (-1)\n    in\n    let k = loop 2 in\n    if k < 0 then print_endline \"No\" else (\n        Printf.printf \"Yes\\n%d\\n\" k;\n        dump k\n    )\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tuple of subsets of \\{1,2,...N\\}, (S_1,S_2,...,S_k), that satisfies the following conditions:\n\nEach of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.\n\nAny two of the sets S_1,S_2,...,S_k have exactly one element in common.\n\nIf such a tuple exists, construct one such tuple.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf a tuple of subsets of \\{1,2,...N\\} that satisfies the conditions does not exist, print No.\nIf such a tuple exists, print Yes first, then print such subsets in the following format:\n\nk\n|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}\n:\n|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}\n\nwhere S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.\n\nIf there are multiple such tuples, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n3\n2 1 2\n2 3 1\n2 2 3\n\nIt can be seen that (S_1,S_2,S_3)=(\\{1,2\\},\\{3,1\\},\\{2,3\\}) satisfies the conditions.\n\nSample Input 2\n\n4\n\nSample Output 2\n\nNo", "sample_input": "3\n"}, "reference_outputs": ["Yes\n3\n2 1 2\n2 3 1\n2 2 3\n"], "source_document_id": "p03230", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tuple of subsets of \\{1,2,...N\\}, (S_1,S_2,...,S_k), that satisfies the following conditions:\n\nEach of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.\n\nAny two of the sets S_1,S_2,...,S_k have exactly one element in common.\n\nIf such a tuple exists, construct one such tuple.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf a tuple of subsets of \\{1,2,...N\\} that satisfies the conditions does not exist, print No.\nIf such a tuple exists, print Yes first, then print such subsets in the following format:\n\nk\n|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}\n:\n|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}\n\nwhere S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.\n\nIf there are multiple such tuples, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n3\n2 1 2\n2 3 1\n2 2 3\n\nIt can be seen that (S_1,S_2,S_3)=(\\{1,2\\},\\{3,1\\},\\{2,3\\}) satisfies the conditions.\n\nSample Input 2\n\n4\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 942, "cpu_time_ms": 66, "memory_kb": 12184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s211517814", "group_id": "codeNet:p03231", "input_text": "let rec f a b = if b = 0 then a else f b (a mod b)\nlet rec g a b = a / f a b * b\nlet n, m, s, t, l = Scanf.scanf \"%d %d %s %s\" @@ fun n m s t -> n, m, s, t, g n m\nlet n', m' = l / n, l / m\nlet _ = for k = 0 to (n - 1) / m' do if k * n' < m && s.[k * m'] <> t.[k * n'] then (print_endline \"-1\"; exit 0) done; Printf.printf \"%d\\n\" l", "language": "OCaml", "metadata": {"date": 1580891040, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03231/input.txt", "sample_output_relpath": "derived/input_output/data/p03231/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03231/OCaml/s211517814.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s211517814", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let rec f a b = if b = 0 then a else f b (a mod b)\nlet rec g a b = a / f a b * b\nlet n, m, s, t, l = Scanf.scanf \"%d %d %s %s\" @@ fun n m s t -> n, m, s, t, g n m\nlet n', m' = l / n, l / m\nlet _ = for k = 0 to (n - 1) / m' do if k * n' < m && s.[k * m'] <> t.[k * n'] then (print_endline \"-1\"; exit 0) done; Printf.printf \"%d\\n\" l", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N and another string T of length M.\nThese strings consist of lowercase English letters.\n\nA string X is called a good string when the following conditions are all met:\n\nLet L be the length of X. L is divisible by both N and M.\n\nConcatenating the 1-st, (\\frac{L}{N}+1)-th, (2 \\times \\frac{L}{N}+1)-th, ..., ((N-1)\\times\\frac{L}{N}+1)-th characters of X, without changing the order, results in S.\n\nConcatenating the 1-st, (\\frac{L}{M}+1)-th, (2 \\times \\frac{L}{M}+1)-th, ..., ((M-1)\\times\\frac{L}{M}+1)-th characters of X, without changing the order, results in T.\n\nDetermine if there exists a good string. If it exists, find the length of the shortest such string.\n\nConstraints\n\n1 \\leq N,M \\leq 10^5\n\nS and T consist of lowercase English letters.\n\n|S|=N\n\n|T|=M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\nT\n\nOutput\n\nIf a good string does not exist, print -1; if it exists, print the length of the shortest such string.\n\nSample Input 1\n\n3 2\nacp\nae\n\nSample Output 1\n\n6\n\nFor example, the string accept is a good string.\nThere is no good string shorter than this, so the answer is 6.\n\nSample Input 2\n\n6 3\nabcdef\nabc\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n15 9\ndnsusrayukuaiia\ndujrunuma\n\nSample Output 3\n\n45", "sample_input": "3 2\nacp\nae\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03231", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N and another string T of length M.\nThese strings consist of lowercase English letters.\n\nA string X is called a good string when the following conditions are all met:\n\nLet L be the length of X. L is divisible by both N and M.\n\nConcatenating the 1-st, (\\frac{L}{N}+1)-th, (2 \\times \\frac{L}{N}+1)-th, ..., ((N-1)\\times\\frac{L}{N}+1)-th characters of X, without changing the order, results in S.\n\nConcatenating the 1-st, (\\frac{L}{M}+1)-th, (2 \\times \\frac{L}{M}+1)-th, ..., ((M-1)\\times\\frac{L}{M}+1)-th characters of X, without changing the order, results in T.\n\nDetermine if there exists a good string. If it exists, find the length of the shortest such string.\n\nConstraints\n\n1 \\leq N,M \\leq 10^5\n\nS and T consist of lowercase English letters.\n\n|S|=N\n\n|T|=M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\nT\n\nOutput\n\nIf a good string does not exist, print -1; if it exists, print the length of the shortest such string.\n\nSample Input 1\n\n3 2\nacp\nae\n\nSample Output 1\n\n6\n\nFor example, the string accept is a good string.\nThere is no good string shorter than this, so the answer is 6.\n\nSample Input 2\n\n6 3\nabcdef\nabc\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n15 9\ndnsusrayukuaiia\ndujrunuma\n\nSample Output 3\n\n45", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 3, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s779856361", "group_id": "codeNet:p03238", "input_text": "let n = read_int ()\nlet _ = if n = 1 then print_endline \"Hello World\" else Printf.printf \"%d\\n\" @@ read_int () + read_int ()", "language": "OCaml", "metadata": {"date": 1567046670, "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/s779856361.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779856361", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "let n = read_int ()\nlet _ = if n = 1 then print_endline \"Hello World\" else Printf.printf \"%d\\n\" @@ read_int () + read_int ()", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s170698258", "group_id": "codeNet:p03238", "input_text": "let f a = match a with\n1 -> \"Hello World\"\n| _ -> Scanf.scanf \"%d %d\" (fun a b -> string_of_int (a+b));;\nScanf.scanf \"%d\" f\n|> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1561512990, "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/s170698258.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s170698258", "user_id": "u635974378"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "let f a = match a with\n1 -> \"Hello World\"\n| _ -> Scanf.scanf \"%d %d\" (fun a b -> string_of_int (a+b));;\nScanf.scanf \"%d\" f\n|> Printf.printf \"%s\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s076535076", "group_id": "codeNet:p03238", "input_text": "let _ =\n\tlet n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n    (\n    match n with\n    | 1 -> \"Hello World\"\n    | 2 ->\n    \tlet a, b = Scanf.scanf \"%d\\n%d\\n\" (fun a b -> a, b) in\n        string_of_int @@ a + b\n    | _ -> failwith \"hoge\"\n    ) |> print_string", "language": "OCaml", "metadata": {"date": 1555221582, "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/s076535076.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076535076", "user_id": "u387591304"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "let _ =\n\tlet n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n    (\n    match n with\n    | 1 -> \"Hello World\"\n    | 2 ->\n    \tlet a, b = Scanf.scanf \"%d\\n%d\\n\" (fun a b -> a, b) in\n        string_of_int @@ a + b\n    | _ -> failwith \"hoge\"\n    ) |> print_string", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s673709529", "group_id": "codeNet:p03238", "input_text": "Scanf.scanf \"%d\\n\" (fun n ->\n  if n = 1 then Printf.printf \"Hello World\\n\" else\n  Scanf.scanf \"%d\\n%d\\n\" (fun a b ->\n    Printf.printf \"%d\\n\" (a+b)\n  )\n)\n\n", "language": "OCaml", "metadata": {"date": 1541348266, "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/s673709529.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673709529", "user_id": "u472975241"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "Scanf.scanf \"%d\\n\" (fun n ->\n  if n = 1 then Printf.printf \"Hello World\\n\" else\n  Scanf.scanf \"%d\\n%d\\n\" (fun a b ->\n    Printf.printf \"%d\\n\" (a+b)\n  )\n)\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s511768890", "group_id": "codeNet:p03241", "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\n\nlet divisors_all n = (* O(nloglogn) *)\nlet res = Array.make (n+$1) [] in\nfor i=1 to n do\n\tlet j = ref @@ i in\n\twhile !j <= n do res.(!j) <- i::res.(!j); j := !j +$ i; done;\n\tres.(i) <- List.rev res.(i)\ndone; res\nlet (%$) = Pervasives.(mod)\nlet () =\n\tlet n,m = get_2_i64 0 in\n\tlet d = m / n in\n\tfor i=i32 d downto 1 do\n\t\tif (i32 m) %$ i = 0 then (\n\t\t\tlet v = i *$ ((i32 n)-$1) in\n\t\t\tif ((i32 m) -$ v) %$ i = 0 then (\n\t\t\t\tprintf \"%d\\n\" i; exit 0;\n\t\t\t)\n\t\t)\n\tdone;", "language": "OCaml", "metadata": {"date": 1538878692, "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/s511768890.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511768890", "user_id": "u481480055"}, "prompt_components": {"gold_output": "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 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\n\nlet divisors_all n = (* O(nloglogn) *)\nlet res = Array.make (n+$1) [] in\nfor i=1 to n do\n\tlet j = ref @@ i in\n\twhile !j <= n do res.(!j) <- i::res.(!j); j := !j +$ i; done;\n\tres.(i) <- List.rev res.(i)\ndone; res\nlet (%$) = Pervasives.(mod)\nlet () =\n\tlet n,m = get_2_i64 0 in\n\tlet d = m / n in\n\tfor i=i32 d downto 1 do\n\t\tif (i32 m) %$ i = 0 then (\n\t\t\tlet v = i *$ ((i32 n)-$1) in\n\t\t\tif ((i32 m) -$ v) %$ i = 0 then (\n\t\t\t\tprintf \"%d\\n\" i; exit 0;\n\t\t\t)\n\t\t)\n\tdone;", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4175, "cpu_time_ms": 215, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s977846761", "group_id": "codeNet:p03241", "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\n\nlet binary_search ng ok f =\n\tlet rec f0 ng ok =\n\t\tif labs (ok - ng) <= 1L then ok\n\t\telse let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n\tin let d = if ng < ok then 1L else -1L\n\tin f0 ng ok\n\t(* in f0 (ng-1L*d) (ok+1L*d) *)\nlet () =\n\tlet n,m = get_2_i64 0 in\n\tlet d = m / n in\n\trepm 1L d 1L (fun u i ->\n\t\tlet v = i * (n - 1L) in\n\t\t(* printf \"%Ld - %Ld: mod %Ld = %Ld\\n\" m v i ((m-v) mod i); *)\n\t\tif (m-v) mod i = 0L then `Ok i else `Ok u\n\t)\n\t|> printf \"%Ld\\n\"\n\t(* binary_search d 0L (fun i -> \n\t\tlet v = i * (n - 1L) in\n\t\tprintf \"%Ld - %Ld: mod %Ld = %Ld\\n\" m v i ((m-v) mod i);\n\t\tif (m-v) mod i = 0L then true else false\n\t)\n\t|> printf \"%Ld\\n\" *)", "language": "OCaml", "metadata": {"date": 1538877141, "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/s977846761.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s977846761", "user_id": "u481480055"}, "prompt_components": {"gold_output": "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 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\n\nlet binary_search ng ok f =\n\tlet rec f0 ng ok =\n\t\tif labs (ok - ng) <= 1L then ok\n\t\telse let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n\tin let d = if ng < ok then 1L else -1L\n\tin f0 ng ok\n\t(* in f0 (ng-1L*d) (ok+1L*d) *)\nlet () =\n\tlet n,m = get_2_i64 0 in\n\tlet d = m / n in\n\trepm 1L d 1L (fun u i ->\n\t\tlet v = i * (n - 1L) in\n\t\t(* printf \"%Ld - %Ld: mod %Ld = %Ld\\n\" m v i ((m-v) mod i); *)\n\t\tif (m-v) mod i = 0L then `Ok i else `Ok u\n\t)\n\t|> printf \"%Ld\\n\"\n\t(* binary_search d 0L (fun i -> \n\t\tlet v = i * (n - 1L) in\n\t\tprintf \"%Ld - %Ld: mod %Ld = %Ld\\n\" m v i ((m-v) mod i);\n\t\tif (m-v) mod i = 0L then true else false\n\t)\n\t|> printf \"%Ld\\n\" *)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4384, "cpu_time_ms": 2103, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s429355346", "group_id": "codeNet:p03242", "input_text": "let () =\n  Scanf.scanf \"%1d%1d%1d\\n\"\n    (fun a b c ->\n       if a = 1 then if b = 1 then if c = 1 then 999 else 991\n         else if c = 1 then 919 else 911\n       else if b = 1 then if c = 1 then 199 else 191\n       else if c = 1 then 119 else 111\n    )\n  |> print_int\n", "language": "OCaml", "metadata": {"date": 1555283792, "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/s429355346.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s429355346", "user_id": "u307426615"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%1d%1d%1d\\n\"\n    (fun a b c ->\n       if a = 1 then if b = 1 then if c = 1 then 999 else 991\n         else if c = 1 then 919 else 911\n       else if b = 1 then if c = 1 then 199 else 191\n       else if c = 1 then 119 else 111\n    )\n  |> print_int\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s979774880", "group_id": "codeNet:p03242", "input_text": "print_endline @@ String.map (function '1' -> '9' | '9' -> '1') @@ read_line ()", "language": "OCaml", "metadata": {"date": 1538280074, "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/s979774880.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979774880", "user_id": "u504158101"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "print_endline @@ String.map (function '1' -> '9' | '9' -> '1') @@ read_line ()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "sample_input": "119\n"}, "reference_outputs": ["991\n"], "source_document_id": "p03242", "source_text": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s044945428", "group_id": "codeNet:p03243", "input_text": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ (n + 110) / 111 * 111", "language": "OCaml", "metadata": {"date": 1572361005, "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/s044945428.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s044945428", "user_id": "u732304692"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ (n + 110) / 111 * 111", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 73, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s001781821", "group_id": "codeNet:p03243", "input_text": "let s = read_line () in\nlet c = String.get s 0 in\nlet len = String.length s in\nlet s = String.make len c in\n\nPrintf.printf \"%s\\n\" s\n\n\n", "language": "OCaml", "metadata": {"date": 1541368325, "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/s001781821.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s001781821", "user_id": "u472975241"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "let s = read_line () in\nlet c = String.get s 0 in\nlet len = String.length s in\nlet s = String.make len c in\n\nPrintf.printf \"%s\\n\" s\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s830770851", "group_id": "codeNet:p03243", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n -> Printf.printf \"%d\\n\" @@ n + 110 - (n + 110) mod 111\n", "language": "OCaml", "metadata": {"date": 1538279017, "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/s830770851.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830770851", "user_id": "u504158101"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n -> Printf.printf \"%d\\n\" @@ n + 110 - (n + 110) mod 111\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s514190309", "group_id": "codeNet:p03244", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet css = Array.make_matrix 2 100001 0\nlet ms = ref [|0, 0; 0, 0|]\nlet e0, e1, o0, o1 = Array.iteri (fun i v -> let c = css.(i mod 2).(v) + 1 in css.(i mod 2).(v) <- c; !ms.(i mod 2) <- max !ms.(i mod 2) (c, v)) vs;\n  List.iter (fun i -> Array.sort (fun x y -> compare y x) css.(i)) [0; 1];\n  css.(0).(0), css.(0).(1), css.(1).(0), css.(1).(1)\nlet _ = Printf.printf \"%d\\n\" @@ if snd !ms.(0) = snd !ms.(1) then n - max (e0 + o1) (e1 + o0) else n - e0 - o0", "language": "OCaml", "metadata": {"date": 1563491440, "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/s514190309.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514190309", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet css = Array.make_matrix 2 100001 0\nlet ms = ref [|0, 0; 0, 0|]\nlet e0, e1, o0, o1 = Array.iteri (fun i v -> let c = css.(i mod 2).(v) + 1 in css.(i mod 2).(v) <- c; !ms.(i mod 2) <- max !ms.(i mod 2) (c, v)) vs;\n  List.iter (fun i -> Array.sort (fun x y -> compare y x) css.(i)) [0; 1];\n  css.(0).(0), css.(0).(1), css.(1).(0), css.(1).(1)\nlet _ = Printf.printf \"%d\\n\" @@ if snd !ms.(0) = snd !ms.(1) then n - max (e0 + o1) (e1 + o0) else n - e0 - o0", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03244", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 544, "cpu_time_ms": 90, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s155147234", "group_id": "codeNet:p03244", "input_text": "let () = \n\tScanf.scanf \"%d\" (fun n -> \n    \tlet whole_array = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n        in \n        let list = Array.to_list whole_array in \n        let (odd_l, even_l) = \n        let rec make_l ol el l = \n        match l with\n        | [] -> (ol, el)\n        | x :: [] -> (x :: ol, el)\n        | x :: y :: rest -> make_l (x :: ol) (y :: el) rest\n        in make_l [] [] list \n        in\n       (* let rec majority l *) \n       (*odd_l, even_lそれぞれについて出現回数の一番大きい数と二番目に大きい数を求める*)\n       (*一番大きい数が異なれば単純にそれぞれの編集回数の和が答え。等しければ二番目を考慮*)\n       \n       (*以下無関係なコード*)\n        let tes_sum = Array.fold_left (+) 0 whole_array in\n         Printf.printf \"%d\" tes_sum)", "language": "OCaml", "metadata": {"date": 1538275079, "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/s155147234.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s155147234", "user_id": "u161164152"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = \n\tScanf.scanf \"%d\" (fun n -> \n    \tlet whole_array = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n        in \n        let list = Array.to_list whole_array in \n        let (odd_l, even_l) = \n        let rec make_l ol el l = \n        match l with\n        | [] -> (ol, el)\n        | x :: [] -> (x :: ol, el)\n        | x :: y :: rest -> make_l (x :: ol) (y :: el) rest\n        in make_l [] [] list \n        in\n       (* let rec majority l *) \n       (*odd_l, even_lそれぞれについて出現回数の一番大きい数と二番目に大きい数を求める*)\n       (*一番大きい数が異なれば単純にそれぞれの編集回数の和が答え。等しければ二番目を考慮*)\n       \n       (*以下無関係なコード*)\n        let tes_sum = Array.fold_left (+) 0 whole_array in\n         Printf.printf \"%d\" tes_sum)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03244", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 853, "cpu_time_ms": 33, "memory_kb": 7808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s320558149", "group_id": "codeNet:p03246", "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 vs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun v -> v in\n  let (odds, evens) =\n    Array.fold_left (fun (odds, evens) v ->\n      (evens, IntMap.add v (1 + try IntMap.find v odds with Not_found -> 0) odds))\n    (IntMap.empty, IntMap.empty) vs in\n  Printf.printf \"%d\\n\" @@ ( - ) n @@\n  match\n    List.sort (fun (_, x) (_, y) -> compare y x) @@\n    IntMap.bindings odds,\n    List.sort (fun (_, x) (_, y) -> compare y x) @@\n    IntMap.bindings evens\n  with\n  | [(u, l)], [(v, m)] ->\n      if u = v then max l m else l + m\n  | (u, l) :: (_, m) :: _, [(v, n)] -> \n      if u = v then max l (m + n) else l + n\n  | [(u, l)], (v, m) :: (_, n) :: _ -> \n      if u = v then max (l + n) m else l + m\n  | (u, l) :: (_, m) :: _, (v, n) :: (_, o) :: _ ->\n      if u = v then max (l + o) (m + n) else l + n\n", "language": "OCaml", "metadata": {"date": 1538286931, "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/s320558149.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320558149", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\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 vs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun v -> v in\n  let (odds, evens) =\n    Array.fold_left (fun (odds, evens) v ->\n      (evens, IntMap.add v (1 + try IntMap.find v odds with Not_found -> 0) odds))\n    (IntMap.empty, IntMap.empty) vs in\n  Printf.printf \"%d\\n\" @@ ( - ) n @@\n  match\n    List.sort (fun (_, x) (_, y) -> compare y x) @@\n    IntMap.bindings odds,\n    List.sort (fun (_, x) (_, y) -> compare y x) @@\n    IntMap.bindings evens\n  with\n  | [(u, l)], [(v, m)] ->\n      if u = v then max l m else l + m\n  | (u, l) :: (_, m) :: _, [(v, n)] -> \n      if u = v then max l (m + n) else l + n\n  | [(u, l)], (v, m) :: (_, n) :: _ -> \n      if u = v then max (l + n) m else l + m\n  | (u, l) :: (_, m) :: _, (v, n) :: (_, o) :: _ ->\n      if u = v then max (l + o) (m + n) else l + 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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 175, "memory_kb": 18816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s259647400", "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 - 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 + (v1 - 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": 1538274254, "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/s259647400.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s259647400", "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 - 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 + (v1 - 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2288, "cpu_time_ms": 178, "memory_kb": 18816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s206697850", "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 v1 - v1'\n          else if v1' > v2' then v1 - v2'\n          else 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": 1538274010, "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/s206697850.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s206697850", "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 v1 - v1'\n          else if v1' > v2' then v1 - v2'\n          else 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1920, "cpu_time_ms": 174, "memory_kb": 18816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s674362020", "group_id": "codeNet:p03252", "input_text": "module CharSet = Set.Make (Char)\n\nlet () =\n  let s = read_line () in\n  let t = read_line () in\n  let a = Array.make 26 CharSet.empty in\n  let b = Array.make 26 CharSet.empty in\n  let ix c = Char.code c - Char.code 'a' in\n  for i = 0 to String.length s - 1 do\n    if s.[i] <> t.[i] then begin\n      a.(ix s.[i]) <- CharSet.add t.[i] a.(ix s.[i]);\n      b.(ix t.[i]) <- CharSet.add s.[i] b.(ix t.[i])\n    end\n  done;\n  print_endline @@\n  if \n    List.for_all (List.for_all (fun s -> CharSet.cardinal s <= 1)) @@\n    List.map Array.to_list [a; b]\n  then \"Yes\"\n  else \"No\"\n", "language": "OCaml", "metadata": {"date": 1537754963, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03252.html", "problem_id": "p03252", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03252/input.txt", "sample_output_relpath": "derived/input_output/data/p03252/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03252/OCaml/s674362020.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s674362020", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module CharSet = Set.Make (Char)\n\nlet () =\n  let s = read_line () in\n  let t = read_line () in\n  let a = Array.make 26 CharSet.empty in\n  let b = Array.make 26 CharSet.empty in\n  let ix c = Char.code c - Char.code 'a' in\n  for i = 0 to String.length s - 1 do\n    if s.[i] <> t.[i] then begin\n      a.(ix s.[i]) <- CharSet.add t.[i] a.(ix s.[i]);\n      b.(ix t.[i]) <- CharSet.add s.[i] b.(ix t.[i])\n    end\n  done;\n  print_endline @@\n  if \n    List.for_all (List.for_all (fun s -> CharSet.cardinal s <= 1)) @@\n    List.map Array.to_list [a; b]\n  then \"Yes\"\n  else \"No\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given strings S and T consisting of lowercase English letters.\n\nYou can perform the following operation on S any number of times:\n\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\n\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\n|S| = |T|\n\nS and T consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S and T can be made equal, print Yes; otherwise, print No.\n\nSample Input 1\n\nazzel\napple\n\nSample Output 1\n\nYes\n\nazzel can be changed to apple, as follows:\n\nChoose e as c_1 and l as c_2. azzel becomes azzle.\n\nChoose z as c_1 and p as c_2. azzle becomes apple.\n\nSample Input 2\n\nchokudai\nredcoder\n\nSample Output 2\n\nNo\n\nNo sequences of operation can change chokudai to redcoder.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu\n\nSample Output 3\n\nYes", "sample_input": "azzel\napple\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03252", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given strings S and T consisting of lowercase English letters.\n\nYou can perform the following operation on S any number of times:\n\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\n\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\n|S| = |T|\n\nS and T consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S and T can be made equal, print Yes; otherwise, print No.\n\nSample Input 1\n\nazzel\napple\n\nSample Output 1\n\nYes\n\nazzel can be changed to apple, as follows:\n\nChoose e as c_1 and l as c_2. azzel becomes azzle.\n\nChoose z as c_1 and p as c_2. azzle becomes apple.\n\nSample Input 2\n\nchokudai\nredcoder\n\nSample Output 2\n\nNo\n\nNo sequences of operation can change chokudai to redcoder.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 569, "cpu_time_ms": 25, "memory_kb": 3584}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s332221835", "group_id": "codeNet:p03254", "input_text": "Scanf.scanf \"%d %d\" (fun n x ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare a;\n\n    let rec loop i acc =\n        if i = n then (if acc = x then i else i - 1) else\n            if acc + a.(i) <= x then loop (i + 1) (acc + a.(i)) else i\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1596599870, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03254.html", "problem_id": "p03254", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03254/input.txt", "sample_output_relpath": "derived/input_output/data/p03254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03254/OCaml/s332221835.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s332221835", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n x ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare a;\n\n    let rec loop i acc =\n        if i = n then (if acc = x then i else i - 1) else\n            if acc + a.(i) <= x then loop (i + 1) (acc + a.(i)) else i\n    in\n    loop 0 0 |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s278725869", "group_id": "codeNet:p03254", "input_text": "open Batteries\n\nlet calc x li =\n  let rec aux c sum = function\n    | [] when sum = x -> c\n    | [] -> c - 1\n    | a :: al when a + sum > x -> c\n    | a :: al -> aux (1 + c) (a + sum) al\n  in\n  aux 0 0 li\n\nlet () =\n  Scanf.scanf \" %d %d \" (fun n x ->\n      List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n      |> List.sort (fun x y -> x - y)\n      |> calc x |> Printf.printf \"%d\\n\" )\n", "language": "OCaml", "metadata": {"date": 1551068525, "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/s278725869.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278725869", "user_id": "u406828576"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\n\nlet calc x li =\n  let rec aux c sum = function\n    | [] when sum = x -> c\n    | [] -> c - 1\n    | a :: al when a + sum > x -> c\n    | a :: al -> aux (1 + c) (a + sum) al\n  in\n  aux 0 0 li\n\nlet () =\n  Scanf.scanf \" %d %d \" (fun n x ->\n      List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n      |> List.sort (fun x y -> x - y)\n      |> calc x |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 390, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s576439181", "group_id": "codeNet:p03254", "input_text": "let 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\\n\" @@ fun n x ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Array.sort compare as_;\n  let acc = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    acc.(i + 1) <- acc.(i) + as_.(i)\n  done;\n  Printf.printf \"%d\\n\" @@\n    if acc.(n) < x then n - 1\n    else if x = acc.(n) then n\n    else upper_bound 0 (n + 1) @@ fun i -> acc.(i) <= x", "language": "OCaml", "metadata": {"date": 1537117302, "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/s576439181.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576439181", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let 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\\n\" @@ fun n x ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Array.sort compare as_;\n  let acc = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    acc.(i + 1) <- acc.(i) + as_.(i)\n  done;\n  Printf.printf \"%d\\n\" @@\n    if acc.(n) < x then n - 1\n    else if x = acc.(n) then n\n    else upper_bound 0 (n + 1) @@ fun i -> acc.(i) <= x", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 548, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s788066207", "group_id": "codeNet:p03263", "input_text": "let (h, w) = Scanf.scanf \"%d %d\" (fun x y -> (x, y)) in\nlet a = Array.make h (Array.make w 0) in\nfor i = 0 to h - 1 do\n  for j = 0 to w - 1 do\n    a.(i).(j) <- Scanf.scanf (if j = 0 then \"\\n%d\" else \" %d\") (fun x -> x)\n  done\ndone;\nlet ans = ref [] in\nfor i = 0 to h - 2 do\n  for j = 0 to w - 1 do\n    if a.(i).(j) mod 2 = 1 then begin\n      a.(i).(j) <- a.(i).(j) - 1;\n      a.(i + 1).(j) <- a.(i + 1).(j) + 1;\n      ans := (i, j, i + 1, j)::!ans\n    end\n  done\ndone;\nfor j = 0 to w - 2 do\n  if a.(h - 1).(j) mod 2 = 1 then begin\n    a.(h - 1).(j) <- a.(h - 1).(j) - 1;\n    a.(h - 1).(j + 1) <- a.(h - 1).(j + 1) + 1;\n    ans := (h - 1, j, h - 1, j + 1)::!ans\n  end\ndone;\nlet ans = List.rev !ans in\nprint_int (List.length ans);\nprint_newline ();\nans |> List.iter (fun (y1, x1, y2, x2) -> Printf.printf \"%d %d %d %d\\n\" (y1 + 1) (x1 + 1) (y2 + 1) (x2 + 1));;\n\n", "language": "OCaml", "metadata": {"date": 1536463719, "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/s788066207.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s788066207", "user_id": "u006493569"}, "prompt_components": {"gold_output": "3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n", "input_to_evaluate": "let (h, w) = Scanf.scanf \"%d %d\" (fun x y -> (x, y)) in\nlet a = Array.make h (Array.make w 0) in\nfor i = 0 to h - 1 do\n  for j = 0 to w - 1 do\n    a.(i).(j) <- Scanf.scanf (if j = 0 then \"\\n%d\" else \" %d\") (fun x -> x)\n  done\ndone;\nlet ans = ref [] in\nfor i = 0 to h - 2 do\n  for j = 0 to w - 1 do\n    if a.(i).(j) mod 2 = 1 then begin\n      a.(i).(j) <- a.(i).(j) - 1;\n      a.(i + 1).(j) <- a.(i + 1).(j) + 1;\n      ans := (i, j, i + 1, j)::!ans\n    end\n  done\ndone;\nfor j = 0 to w - 2 do\n  if a.(h - 1).(j) mod 2 = 1 then begin\n    a.(h - 1).(j) <- a.(h - 1).(j) - 1;\n    a.(h - 1).(j + 1) <- a.(h - 1).(j + 1) + 1;\n    ans := (h - 1, j, h - 1, j + 1)::!ans\n  end\ndone;\nlet ans = List.rev !ans in\nprint_int (List.length ans);\nprint_newline ();\nans |> List.iter (fun (y1, x1, y2, x2) -> Printf.printf \"%d %d %d %d\\n\" (y1 + 1) (x1 + 1) (y2 + 1) (x2 + 1));;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 859, "cpu_time_ms": 281, "memory_kb": 29184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s812496872", "group_id": "codeNet:p03263", "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\n\nlet rec print_trace = function\n  | (a,b)::(c,d)::xs -> (\n    Printf.printf \"%d %d %d %d\\n\" (a+1) (b+1) (c+1) (d+1);\n    print_trace ((c,d)::xs)\n  )\n  | _ -> ()\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun h w ->\n  let a = Array.init h (fun _ -> Array.init w (fun _ -> Scanf.scanf \" %d\" ((+) 0))) in\n\n  let moves, _ = for_fold 0 (h*w) ([], None) (fun (ac, tr) i ->\n    let x = i / w in\n    let y = if x mod 2 = 0 then i mod w else (w-1) - i mod w in\n    match tr with\n    | None ->\n      if a.(x).(y) mod 2 = 1 then (ac, Some [(x, y)]) else (ac, None)\n    | Some tr -> begin\n      if a.(x).(y) mod 2 = 1 then (List.rev ((x,y)::tr) :: ac, None) else (ac, Some ((x,y)::tr))\n    end)\n  in\n\n  let moves = List.rev moves in\n\n  let n = List.fold_left (fun n x -> n + List.length x - 1) 0 moves in\n  Printf.printf \"%d\\n\" n;\n  List.iter print_trace moves", "language": "OCaml", "metadata": {"date": 1536455963, "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/s812496872.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812496872", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n2 2 2 3\n1 1 1 2\n1 3 1 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\n\nlet rec print_trace = function\n  | (a,b)::(c,d)::xs -> (\n    Printf.printf \"%d %d %d %d\\n\" (a+1) (b+1) (c+1) (d+1);\n    print_trace ((c,d)::xs)\n  )\n  | _ -> ()\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun h w ->\n  let a = Array.init h (fun _ -> Array.init w (fun _ -> Scanf.scanf \" %d\" ((+) 0))) in\n\n  let moves, _ = for_fold 0 (h*w) ([], None) (fun (ac, tr) i ->\n    let x = i / w in\n    let y = if x mod 2 = 0 then i mod w else (w-1) - i mod w in\n    match tr with\n    | None ->\n      if a.(x).(y) mod 2 = 1 then (ac, Some [(x, y)]) else (ac, None)\n    | Some tr -> begin\n      if a.(x).(y) mod 2 = 1 then (List.rev ((x,y)::tr) :: ac, None) else (ac, Some ((x,y)::tr))\n    end)\n  in\n\n  let moves = List.rev moves in\n\n  let n = List.fold_left (fun n x -> n + List.length x - 1) 0 moves in\n  Printf.printf \"%d\\n\" n;\n  List.iter print_trace moves", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 916, "cpu_time_ms": 191, "memory_kb": 24832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s981887881", "group_id": "codeNet:p03264", "input_text": "Scanf.scanf \"%d\" (fun k ->\n    Printf.printf \"%d\\n\" @@ (k / 2) * (k - k / 2)\n)", "language": "OCaml", "metadata": {"date": 1595217330, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s981887881.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981887881", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun k ->\n    Printf.printf \"%d\\n\" @@ (k / 2) * (k - k / 2)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s770151581", "group_id": "codeNet:p03264", "input_text": "let () = Scanf.scanf \"%d\" (fun k -> k / 2 * (k - k / 2)) |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1564170182, "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/s770151581.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s770151581", "user_id": "u029876051"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" (fun k -> k / 2 * (k - k / 2)) |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s076634883", "group_id": "codeNet:p03264", "input_text": "let k = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ k/2 * (k - k/2)", "language": "OCaml", "metadata": {"date": 1562131291, "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/s076634883.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076634883", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let k = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ k/2 * (k - k/2)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s069905273", "group_id": "codeNet:p03264", "input_text": "let f n = match n with\nn when (mod) n 2 = 0 -> (n/2)*(n/2)\n| n -> (((n-1)/2)+1)*((n-1)/2);;\nlet () = Scanf.scanf \"%d\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561268378, "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/s069905273.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069905273", "user_id": "u635974378"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let f n = match n with\nn when (mod) n 2 = 0 -> (n/2)*(n/2)\n| n -> (((n-1)/2)+1)*((n-1)/2);;\nlet () = Scanf.scanf \"%d\" f\n|> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s522043255", "group_id": "codeNet:p03265", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun x1 y1 x2 y2 ->\n    let rot_x cx cy x y =  y + cx - cy in\n    let rot_y cx cy x y = -x + cy + cx in\n    let x3 = rot_x x2 y2 x1 y1 in\n    let y3 = rot_y x2 y2 x1 y1 in\n    let x4 = rot_x x3 y3 x2 y2 in\n    let y4 = rot_y x3 y3 x2 y2 in\n    Printf.printf \"%d %d %d %d\\n\" x3 y3 x4 y4\n)", "language": "OCaml", "metadata": {"date": 1599439914, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s522043255.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522043255", "user_id": "u342443598"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun x1 y1 x2 y2 ->\n    let rot_x cx cy x y =  y + cx - cy in\n    let rot_y cx cy x y = -x + cy + cx in\n    let x3 = rot_x x2 y2 x1 y1 in\n    let y3 = rot_y x2 y2 x1 y1 in\n    let x4 = rot_x x3 y3 x2 y2 in\n    let y4 = rot_y x3 y3 x2 y2 in\n    Printf.printf \"%d %d %d %d\\n\" x3 y3 x4 y4\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s199957343", "group_id": "codeNet:p03265", "input_text": "let x1, y1, x2, y2, x, y = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d, c - a, d - b\nlet _ = Printf.printf \"%d %d %d %d\\n\" (x2 - y) (y2 + x) (x1 - y) (y1 + x)", "language": "OCaml", "metadata": {"date": 1571376426, "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/s199957343.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199957343", "user_id": "u732304692"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "let x1, y1, x2, y2, x, y = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d, c - a, d - b\nlet _ = Printf.printf \"%d %d %d %d\\n\" (x2 - y) (y2 + x) (x1 - y) (y1 + x)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s192146195", "group_id": "codeNet:p03272", "input_text": "let train n i = n - i + 1\n\nlet () = Scanf.scanf \"%d %d\" train |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595871836, "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/s192146195.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s192146195", "user_id": "u272377260"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let train n i = n - i + 1\n\nlet () = Scanf.scanf \"%d %d\" train |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s423580854", "group_id": "codeNet:p03272", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n i ->\n  Printf.printf \"%d\\n\" @@ n - i + 1\n", "language": "OCaml", "metadata": {"date": 1535256450, "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/s423580854.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s423580854", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s384801390", "group_id": "codeNet:p03274", "input_text": "let rec for_fold a b v f = if a >= b then v else for_fold (a+1) b (f a v) f\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let x = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  for_fold 0 (n-k+1) 10101010101010 (fun i v ->\n    let l, r = x.(i), x.(i+k-1) in\n    if r <= 0 || l >= 0 then min v @@ max (abs l) (abs r)\n    else min v @@ min (2 * r - l) (r - 2 * l))\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1551631690, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/OCaml/s384801390.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s384801390", "user_id": "u798181098"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "let rec for_fold a b v f = if a >= b then v else for_fold (a+1) b (f a v) f\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let x = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  for_fold 0 (n-k+1) 10101010101010 (fun i v ->\n    let l, r = x.(i), x.(i+k-1) in\n    if r <= 0 || l >= 0 then min v @@ max (abs l) (abs r)\n    else min v @@ min (2 * r - l) (r - 2 * l))\n  |> 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": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s945678133", "group_id": "codeNet:p03274", "input_text": "let rec firstNth list n = match list with\n  | [] -> []\n  | _ when n = 0 -> []\n  | x::rest -> x::(firstNth rest (n-1))\n  \n\nlet solve n k list =\n  let dists = List.map (fun x -> (x, abs x)) list in\n  let sorted = firstNth (List.sort (fun x y -> if (snd x) < (snd y) then -1 else 1) dists) k in\n  let maxL = List.fold_left (fun acc x -> max acc (fst x)) 0 sorted and\n      minL = List.fold_left (fun acc x -> min acc (fst x)) 0 sorted in\n  maxL - (min minL 0) + (min maxL (abs (min minL 0)))\n\nlet read_list_of_int () =\n  let rec read_list_of_int_inner lst =\n    try let ans = (Scanf.scanf \"%d \" (fun x->x)) in\n        read_list_of_int_inner (ans::lst)\n    with End_of_file ->\n      List.rev lst\n  in\n  read_list_of_int_inner []\n\nlet () =\n  let n, k = (Scanf.scanf \"%d %d\\n\" (fun x y -> x,y)) in\n  let list = read_list_of_int () in\n  let ans = solve n k list in\n  Printf.printf \"%d\\n\" ans;\n;;\n", "language": "OCaml", "metadata": {"date": 1535249041, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/OCaml/s945678133.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s945678133", "user_id": "u980152513"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "let rec firstNth list n = match list with\n  | [] -> []\n  | _ when n = 0 -> []\n  | x::rest -> x::(firstNth rest (n-1))\n  \n\nlet solve n k list =\n  let dists = List.map (fun x -> (x, abs x)) list in\n  let sorted = firstNth (List.sort (fun x y -> if (snd x) < (snd y) then -1 else 1) dists) k in\n  let maxL = List.fold_left (fun acc x -> max acc (fst x)) 0 sorted and\n      minL = List.fold_left (fun acc x -> min acc (fst x)) 0 sorted in\n  maxL - (min minL 0) + (min maxL (abs (min minL 0)))\n\nlet read_list_of_int () =\n  let rec read_list_of_int_inner lst =\n    try let ans = (Scanf.scanf \"%d \" (fun x->x)) in\n        read_list_of_int_inner (ans::lst)\n    with End_of_file ->\n      List.rev lst\n  in\n  read_list_of_int_inner []\n\nlet () =\n  let n, k = (Scanf.scanf \"%d %d\\n\" (fun x y -> x,y)) in\n  let list = read_list_of_int () in\n  let ans = solve n k list in\n  Printf.printf \"%d\\n\" ans;\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": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 889, "cpu_time_ms": 108, "memory_kb": 18944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s131998346", "group_id": "codeNet:p03280", "input_text": "open Scanf\nopen Printf\n\nlet garden a b = a * b - (a + b - 1)\n\nlet () = scanf \"%d %d\" garden |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1595872073, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s131998346.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131998346", "user_id": "u272377260"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet garden a b = a * b - (a + b - 1)\n\nlet () = scanf \"%d %d\" garden |> printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s445784650", "group_id": "codeNet:p03280", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@ (a - 1) * (b - 1)", "language": "OCaml", "metadata": {"date": 1534657353, "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/s445784650.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s445784650", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s495651986", "group_id": "codeNet:p03280", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n    Printf.printf \"%d\\n\" @@  a * b - a - b + 1\n", "language": "OCaml", "metadata": {"date": 1534645406, "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/s495651986.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s495651986", "user_id": "u013750540"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n    Printf.printf \"%d\\n\" @@  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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s279601188", "group_id": "codeNet:p03281", "input_text": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet n = scan \"%d\" identity\n\nlet aux n =\n  Enum.Labels.map (1 -- n)\n    ~f:(fun i -> if n mod i = 0 then 1 else 0 )\n  |> Enum.sum\n  |> (=) 8\n\nlet () =\n  Enum.Labels.map (1 -- n)\n    ~f:(fun i -> if i mod 2 = 1 && aux i then 1 else 0)\n  |> Enum.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1586797203, "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/s279601188.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s279601188", "user_id": "u802614675"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet n = scan \"%d\" identity\n\nlet aux n =\n  Enum.Labels.map (1 -- n)\n    ~f:(fun i -> if n mod i = 0 then 1 else 0 )\n  |> Enum.sum\n  |> (=) 8\n\nlet () =\n  Enum.Labels.map (1 -- n)\n    ~f:(fun i -> if i mod 2 = 1 && aux i then 1 else 0)\n  |> Enum.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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 756, "cpu_time_ms": 3, "memory_kb": 3200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s560867609", "group_id": "codeNet:p03281", "input_text": "open Scanf\nopen Printf\n\nlet prime = [\n        3;\n        5;\n        7;\n        11;\n        13;\n      ]\n\nlet num = [\n  3 * 5 * 7;\n  3 * 5 * 11;\n  3 * 5 * 13;\n  3 * 7 * 11;\n  3 * 7 * 13;\n  3 * 11 * 13;\n  5 * 7 * 11;\n  5 * 7 * 13;\n  7 * 11 * 13;\n  3 * 3 * 5 * 5;\n  3 * 3 * 7 * 7;\n  3 * 3 * 11 * 11;\n  3 * 3 * 13 * 13;\n  5 * 5 * 7 * 7;\n  5 * 5 * 11 * 11;\n  5 * 5 * 13 * 13;\n  7 * 7 * 11 * 11;\n  7 * 7 * 13 * 13;\n  11 * 11 * 13 * 13\n]\n\nlet f n = List.length @@ List.filter (fun k -> k <= n) num\n\nlet () = let ans = scanf \"%d\\n\" f in\n  printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1534642124, "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/s560867609.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s560867609", "user_id": "u379439911"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet prime = [\n        3;\n        5;\n        7;\n        11;\n        13;\n      ]\n\nlet num = [\n  3 * 5 * 7;\n  3 * 5 * 11;\n  3 * 5 * 13;\n  3 * 7 * 11;\n  3 * 7 * 13;\n  3 * 11 * 13;\n  5 * 7 * 11;\n  5 * 7 * 13;\n  7 * 11 * 13;\n  3 * 3 * 5 * 5;\n  3 * 3 * 7 * 7;\n  3 * 3 * 11 * 11;\n  3 * 3 * 13 * 13;\n  5 * 5 * 7 * 7;\n  5 * 5 * 11 * 11;\n  5 * 5 * 13 * 13;\n  7 * 7 * 11 * 11;\n  7 * 7 * 13 * 13;\n  11 * 11 * 13 * 13\n]\n\nlet f n = List.length @@ List.filter (fun k -> k <= n) num\n\nlet () = let ans = scanf \"%d\\n\" f in\n  printf \"%d\\n\" ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 547, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s064457847", "group_id": "codeNet:p03281", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n = scanf \"%d\" id\n\nlet f n =\n    let r = ref 0 in\n    for i = 1 to n do\n        if n mod i = 0 then incr r    \n    done;\n    !r\n    \nlet () =\n    let r = ref 0 in\n    for i = 1 to n do\n        if i mod 2 = 1 && f i = 8 then incr r\n    done;\n    printf \"%d\\n\" !r\n", "language": "OCaml", "metadata": {"date": 1534640823, "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/s064457847.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s064457847", "user_id": "u450300828"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n = scanf \"%d\" id\n\nlet f n =\n    let r = ref 0 in\n    for i = 1 to n do\n        if n mod i = 0 then incr r    \n    done;\n    !r\n    \nlet () =\n    let r = ref 0 in\n    for i = 1 to n do\n        if i mod 2 = 1 && f i = 8 then incr r\n    done;\n    printf \"%d\\n\" !r\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s101592182", "group_id": "codeNet:p03282", "input_text": "let solve s _ =\n  let by = Bytes.of_string s in\n  let non_one = Bytes.map (fun c -> if c = '1' then ' ' else c) by in\n  let trimmed = Bytes.trim non_one in\n  trimmed.[0]\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%s\\n%s\\n\" solve) in\n        Printf.printf \"%c\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\n;;\n", "language": "OCaml", "metadata": {"date": 1534645174, "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/s101592182.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s101592182", "user_id": "u980152513"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let solve s _ =\n  let by = Bytes.of_string s in\n  let non_one = Bytes.map (fun c -> if c = '1' then ' ' else c) by in\n  let trimmed = Bytes.trim non_one in\n  trimmed.[0]\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%s\\n%s\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s993728261", "group_id": "codeNet:p03282", "input_text": "open Scanf\nopen Printf\n\nlet tail s = String.sub s 1 (String.length s - 1)\nlet head s = int_of_string (String.sub s 0 1)\n\nlet n = float_of_int @@ 5000 * 10000 * 10000 * 10000\n\nlet pow i n = if i = 1\n  then 1\n  else begin\n    let rec pow' k n = if n = 1 then k else pow' (k * i) (n - 1)\n    in pow' i n\n  end\n\nlet rec f s k = let i = head s in\n  let a = log @@ float_of_int i in\n  if k < n *. a\n  then i\n  else f (tail s) (k +. log (1. -. exp (n *. a -. k)))\n\nlet () = let ans = scanf \"%s\\n%d\\n\" (fun s k -> f s (log @@ float_of_int k)) in\n  printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1534645018, "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/s993728261.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s993728261", "user_id": "u379439911"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet tail s = String.sub s 1 (String.length s - 1)\nlet head s = int_of_string (String.sub s 0 1)\n\nlet n = float_of_int @@ 5000 * 10000 * 10000 * 10000\n\nlet pow i n = if i = 1\n  then 1\n  else begin\n    let rec pow' k n = if n = 1 then k else pow' (k * i) (n - 1)\n    in pow' i n\n  end\n\nlet rec f s k = let i = head s in\n  let a = log @@ float_of_int i in\n  if k < n *. a\n  then i\n  else f (tail s) (k +. log (1. -. exp (n *. a -. k)))\n\nlet () = let ans = scanf \"%s\\n%d\\n\" (fun s k -> f s (log @@ float_of_int k)) in\n  printf \"%d\\n\" ans", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 557, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s616370186", "group_id": "codeNet:p03282", "input_text": "open Scanf\nopen Printf\n\nlet tail s = String.sub s 1 (String.length s - 1)\nlet head s = int_of_string (String.sub s 0 1)\n\nlet num = 5000 * 10000 * 10000 * 10000\n\nlet pow i n = if i = 1\n  then 1\n  else begin\n    let rec pow' k n = if n = 1 then k else pow' (k * i) (n - 1)\n    in pow' i n\n  end\n\nlet rec f s k = let i = head s in\n  if log (float_of_int k) < (float_of_int num) *. log (float_of_int i)\n  then i\n  else f (tail s) (k - pow i num)\n\nlet () = let ans = scanf \"%s\\n%d\\n\" f in\n  printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1534643664, "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/s616370186.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s616370186", "user_id": "u379439911"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet tail s = String.sub s 1 (String.length s - 1)\nlet head s = int_of_string (String.sub s 0 1)\n\nlet num = 5000 * 10000 * 10000 * 10000\n\nlet pow i n = if i = 1\n  then 1\n  else begin\n    let rec pow' k n = if n = 1 then k else pow' (k * i) (n - 1)\n    in pow' i n\n  end\n\nlet rec f s k = let i = head s in\n  if log (float_of_int k) < (float_of_int num) *. log (float_of_int i)\n  then i\n  else f (tail s) (k - pow i num)\n\nlet () = let ans = scanf \"%s\\n%d\\n\" f in\n  printf \"%d\\n\" ans", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 503, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s860848852", "group_id": "codeNet:p03282", "input_text": "let arr_of_str s = Array.init (String.length s) (fun i -> i, s.[i])\nlet () = Printf.printf \"%c\\n\" @@\n  Scanf.scanf \"%s %d\" @@ fun s k ->\n  let s = arr_of_str s in\n  let li, c = Array.fold_left (fun (j, z) (i, c) ->\n    if z <> '1' then (j, z) else if c <> '1' then (i, c) else (j, z)) (Array.length s, '1') s\n  in\n  if k-1 <= li then snd s.(k-1) else c", "language": "OCaml", "metadata": {"date": 1534641160, "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/s860848852.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860848852", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let arr_of_str s = Array.init (String.length s) (fun i -> i, s.[i])\nlet () = Printf.printf \"%c\\n\" @@\n  Scanf.scanf \"%s %d\" @@ fun s k ->\n  let s = arr_of_str s in\n  let li, c = Array.fold_left (fun (j, z) (i, c) ->\n    if z <> '1' then (j, z) else if c <> '1' then (i, c) else (j, z)) (Array.length s, '1') s\n  in\n  if k-1 <= li then snd s.(k-1) else c", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s034191038", "group_id": "codeNet:p03283", "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,q) = scan \"%d %d %d\" Tuple3.make\n\nlet () =\n  let mat = Array.make_matrix (succ n) (succ n) 0 in\n  ListL.iter (0 ++^ m) ~f:(fun _ ->\n      let (l, r) = scan \"%d %d\" Tuple2.make in\n      mat.(r).(l) <- mat.(r).(l) + 1);\n  ListL.iter (1 ++ n) ~f:(fun i ->\n      List.fold_left (fun p j ->\n          let p = p + mat.(i).(j) in\n          mat.(i).(j) <- p + mat.(pred i).(j); p\n        ) 0 (1 ++ n) |> ignore);\n  ListL.iter (0 ++^ q) ~f:(fun _ ->\n      let (p,q) = scan \"%d %d\" Tuple2.make in\n      mat.(q).(q) - mat.(q).(pred p) - mat.(pred p).(q) + mat.(pred p).(pred p)\n      |> Printf.printf \"%d\\n\"\n    )\n", "language": "OCaml", "metadata": {"date": 1590194590, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03283.html", "problem_id": "p03283", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03283/input.txt", "sample_output_relpath": "derived/input_output/data/p03283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03283/OCaml/s034191038.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s034191038", "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,m,q) = scan \"%d %d %d\" Tuple3.make\n\nlet () =\n  let mat = Array.make_matrix (succ n) (succ n) 0 in\n  ListL.iter (0 ++^ m) ~f:(fun _ ->\n      let (l, r) = scan \"%d %d\" Tuple2.make in\n      mat.(r).(l) <- mat.(r).(l) + 1);\n  ListL.iter (1 ++ n) ~f:(fun i ->\n      List.fold_left (fun p j ->\n          let p = p + mat.(i).(j) in\n          mat.(i).(j) <- p + mat.(pred i).(j); p\n        ) 0 (1 ++ n) |> ignore);\n  ListL.iter (0 ++^ q) ~f:(fun _ ->\n      let (p,q) = scan \"%d %d\" Tuple2.make in\n      mat.(q).(q) - mat.(q).(pred p) - mat.(pred p).(q) + mat.(pred p).(pred p)\n      |> Printf.printf \"%d\\n\"\n    )\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is a east-west railroad and N cities along it, numbered 1, 2, 3, ..., N from west to east.\nA company called AtCoder Express possesses M trains, and the train i runs from City L_i to City R_i (it is possible that L_i = R_i).\nTakahashi the king is interested in the following Q matters:\n\nThe number of the trains that runs strictly within the section from City p_i to City q_i, that is, the number of trains j such that p_i \\leq L_j and R_j \\leq q_i.\n\nAlthough he is genius, this is too much data to process by himself. Find the answer for each of these Q queries to help him.\n\nConstraints\n\nN is an integer between 1 and 500 (inclusive).\n\nM is an integer between 1 and 200 \\ 000 (inclusive).\n\nQ is an integer between 1 and 100 \\ 000 (inclusive).\n\n1 \\leq L_i \\leq R_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq p_i \\leq q_i \\leq N (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\nL_1 R_1\nL_2 R_2\n:\nL_M R_M\np_1 q_1\np_2 q_2\n:\np_Q q_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the number of the trains that runs strictly within the section from City p_i to City q_i.\n\nSample Input 1\n\n2 3 1\n1 1\n1 2\n2 2\n1 2\n\nSample Output 1\n\n3\n\nAs all the trains runs within the section from City 1 to City 2, the answer to the only query is 3.\n\nSample Input 2\n\n10 3 2\n1 5\n2 8\n7 10\n1 7\n3 10\n\nSample Output 2\n\n1\n1\n\nThe first query is on the section from City 1 to 7. There is only one train that runs strictly within that section: Train 1.\nThe second query is on the section from City 3 to 10. There is only one train that runs strictly within that section: Train 3.\n\nSample Input 3\n\n10 10 10\n1 6\n2 9\n4 5\n4 7\n4 7\n5 8\n6 6\n6 7\n7 9\n10 10\n1 8\n1 9\n1 10\n2 8\n2 9\n2 10\n3 8\n3 9\n3 10\n1 10\n\nSample Output 3\n\n7\n9\n10\n6\n8\n9\n6\n7\n8\n10", "sample_input": "2 3 1\n1 1\n1 2\n2 2\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03283", "source_text": "Score: 400 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is a east-west railroad and N cities along it, numbered 1, 2, 3, ..., N from west to east.\nA company called AtCoder Express possesses M trains, and the train i runs from City L_i to City R_i (it is possible that L_i = R_i).\nTakahashi the king is interested in the following Q matters:\n\nThe number of the trains that runs strictly within the section from City p_i to City q_i, that is, the number of trains j such that p_i \\leq L_j and R_j \\leq q_i.\n\nAlthough he is genius, this is too much data to process by himself. Find the answer for each of these Q queries to help him.\n\nConstraints\n\nN is an integer between 1 and 500 (inclusive).\n\nM is an integer between 1 and 200 \\ 000 (inclusive).\n\nQ is an integer between 1 and 100 \\ 000 (inclusive).\n\n1 \\leq L_i \\leq R_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq p_i \\leq q_i \\leq N (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\nL_1 R_1\nL_2 R_2\n:\nL_M R_M\np_1 q_1\np_2 q_2\n:\np_Q q_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the number of the trains that runs strictly within the section from City p_i to City q_i.\n\nSample Input 1\n\n2 3 1\n1 1\n1 2\n2 2\n1 2\n\nSample Output 1\n\n3\n\nAs all the trains runs within the section from City 1 to City 2, the answer to the only query is 3.\n\nSample Input 2\n\n10 3 2\n1 5\n2 8\n7 10\n1 7\n3 10\n\nSample Output 2\n\n1\n1\n\nThe first query is on the section from City 1 to 7. There is only one train that runs strictly within that section: Train 1.\nThe second query is on the section from City 3 to 10. There is only one train that runs strictly within that section: Train 3.\n\nSample Input 3\n\n10 10 10\n1 6\n2 9\n4 5\n4 7\n4 7\n5 8\n6 6\n6 7\n7 9\n10 10\n1 8\n1 9\n1 10\n2 8\n2 9\n2 10\n3 8\n3 9\n3 10\n1 10\n\nSample Output 3\n\n7\n9\n10\n6\n8\n9\n6\n7\n8\n10", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 423, "memory_kb": 13184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s986037559", "group_id": "codeNet:p03284", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k ->\n  print_endline @@ string_of_int (n mod k)\n)", "language": "OCaml", "metadata": {"date": 1583977239, "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/s986037559.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s986037559", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k ->\n  print_endline @@ string_of_int (n mod k)\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s807127375", "group_id": "codeNet:p03285", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) false in\n    let rec loop i =\n        let rec loop2 j =\n            if j <= n then (a.(j) <- true; loop2 (j + 7))\n        in\n        if i <= n then (loop2 i; loop (i + 4))\n    in\n    loop 0;\n    print_endline @@ if a.(n) then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1586829151, "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/s807127375.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s807127375", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.make (n + 1) false in\n    let rec loop i =\n        let rec loop2 j =\n            if j <= n then (a.(j) <- true; loop2 (j + 7))\n        in\n        if i <= n then (loop2 i; loop (i + 4))\n    in\n    loop 0;\n    print_endline @@ if a.(n) then \"Yes\" else \"No\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 301, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s851371737", "group_id": "codeNet:p03286", "input_text": "let m a b = a mod b + if a mod b < 0 then abs b else 0\nlet rec f n a = if n = 0 then a else f ((n - m n ~-2) / -2) (m n ~-2 :: a)\nlet _ = print_newline @@ match f (read_int ()) [] with [] -> print_int 0 | a -> List.iter print_int a", "language": "OCaml", "metadata": {"date": 1581413531, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03286.html", "problem_id": "p03286", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03286/input.txt", "sample_output_relpath": "derived/input_output/data/p03286/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03286/OCaml/s851371737.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s851371737", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1011\n", "input_to_evaluate": "let m a b = a mod b + if a mod b < 0 then abs b else 0\nlet rec f n a = if n = 0 then a else f ((n - m n ~-2) / -2) (m n ~-2 :: a)\nlet _ = print_newline @@ match f (read_int ()) [] with [] -> print_int 0 | a -> List.iter print_int a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven an integer N, find the base -2 representation of N.\n\nHere, S is the base -2 representation of N when the following are all satisfied:\n\nS is a string consisting of 0 and 1.\n\nUnless S = 0, the initial character of S is 1.\n\nLet S = S_k S_{k-1} ... S_0, then S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N.\n\nIt can be proved that, for any integer M, the base -2 representation of M is uniquely determined.\n\nConstraints\n\nEvery value in input is integer.\n\n-10^9 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the base -2 representation of N.\n\nSample Input 1\n\n-9\n\nSample Output 1\n\n1011\n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, 1011 is the base -2 representation of -9.\n\nSample Input 2\n\n123456789\n\nSample Output 2\n\n11000101011001101110100010101\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "-9\n"}, "reference_outputs": ["1011\n"], "source_document_id": "p03286", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven an integer N, find the base -2 representation of N.\n\nHere, S is the base -2 representation of N when the following are all satisfied:\n\nS is a string consisting of 0 and 1.\n\nUnless S = 0, the initial character of S is 1.\n\nLet S = S_k S_{k-1} ... S_0, then S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N.\n\nIt can be proved that, for any integer M, the base -2 representation of M is uniquely determined.\n\nConstraints\n\nEvery value in input is integer.\n\n-10^9 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the base -2 representation of N.\n\nSample Input 1\n\n-9\n\nSample Output 1\n\n1011\n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, 1011 is the base -2 representation of -9.\n\nSample Input 2\n\n123456789\n\nSample Output 2\n\n11000101011001101110100010101\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 231, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s724477789", "group_id": "codeNet:p03287", "input_text": "module M = Map.Make (struct type t = int let compare = compare end) ;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n\n    let rec loop i cur map =\n        if i = n then map else\n            let a = Scanf.scanf \" %d\" (fun a -> a) in\n            let cur = (cur + a) mod m in\n            let map = M.add cur (1 + try M.find cur map with _ -> 0) map in\n            loop (i + 1) cur map\n    in\n    let map = loop 0 0 (M.add 0 1 M.empty) in\n    M.fold (fun _ v acc -> acc + v * (v - 1) / 2) map 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1586834267, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03287.html", "problem_id": "p03287", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03287/input.txt", "sample_output_relpath": "derived/input_output/data/p03287/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03287/OCaml/s724477789.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s724477789", "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\nScanf.scanf \"%d %d\" (fun n m ->\n\n    let rec loop i cur map =\n        if i = n then map else\n            let a = Scanf.scanf \" %d\" (fun a -> a) in\n            let cur = (cur + a) mod m in\n            let map = M.add cur (1 + try M.find cur map with _ -> 0) map in\n            loop (i + 1) cur map\n    in\n    let map = loop 0 0 (M.add 0 1 M.empty) in\n    M.fold (fun _ v acc -> acc + v * (v - 1) / 2) map 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "sample_input": "3 2\n4 1 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03287", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 503, "cpu_time_ms": 95, "memory_kb": 8448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s492993004", "group_id": "codeNet:p03288", "input_text": "let r = read_int () in\nprint_endline @@\nif r < 1200 then \"ABC\" else\n    if r < 2800 then \"ARC\" else \"AGC\"", "language": "OCaml", "metadata": {"date": 1586655231, "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/s492993004.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s492993004", "user_id": "u342443598"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let r = read_int () in\nprint_endline @@\nif r < 1200 then \"ABC\" else\n    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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s323522806", "group_id": "codeNet:p03289", "input_text": "let s = read_line ()\nlet f g s = let n = ref 0 in String.iter (fun c -> if g c then incr n) s; !n\nlet _ = print_endline @@ if s.[0] = 'A' && String.(contains (sub s 2 (length s - 3)) 'C') && f (fun c -> Char.uppercase c = c) s = 2 then \"AC\" else \"WA\"", "language": "OCaml", "metadata": {"date": 1572541130, "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/s323522806.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323522806", "user_id": "u732304692"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "let s = read_line ()\nlet f g s = let n = ref 0 in String.iter (fun c -> if g c then incr n) s; !n\nlet _ = print_endline @@ if s.[0] = 'A' && String.(contains (sub s 2 (length s - 3)) 'C') && f (fun c -> Char.uppercase c = c) s = 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s504709947", "group_id": "codeNet:p03289", "input_text": "Str.(if string_match (regexp \"^A[a-z]+C[a-z]+$\") (read_line()) 0 then \"AC\" else \"WA\")", "language": "OCaml", "metadata": {"date": 1541124197, "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/s504709947.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504709947", "user_id": "u481480055"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "Str.(if string_match (regexp \"^A[a-z]+C[a-z]+$\") (read_line()) 0 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s406209521", "group_id": "codeNet:p03290", "input_text": "let inf = 10101010101010\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun d g ->\n  let pc = Array.init d (fun i -> Scanf.scanf \" %d %d\" (fun x y -> i, x, y))\n    |> Array.to_list |> List.rev in\n\n  Array.init (1 lsl d) (fun b ->\n    let s', n' =\n      List.fold_left (fun (s, n) (i, p, c) ->\n        if b land (1 lsl i) <> 0 then begin\n          (s + p * 100 * (i+1) + c, n + p)\n        end else (s, n)) (0, 0) pc\n    in\n    let s, n =\n      List.fold_left (fun (s, n) (i, p, c) ->\n      if b land (1 lsl i) <> 0 then (s, n) else begin\n        let u = 100 * (i+1) in\n        let m = (g - s + u - 1) / u |> min (p-1) |> max 0 in\n        (s + m * u, n + m)\n      end) (s', n') pc in\n    if s >= g then n else inf\n  ) |> Array.fold_left min inf |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1533536721, "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/s406209521.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s406209521", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let inf = 10101010101010\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun d g ->\n  let pc = Array.init d (fun i -> Scanf.scanf \" %d %d\" (fun x y -> i, x, y))\n    |> Array.to_list |> List.rev in\n\n  Array.init (1 lsl d) (fun b ->\n    let s', n' =\n      List.fold_left (fun (s, n) (i, p, c) ->\n        if b land (1 lsl i) <> 0 then begin\n          (s + p * 100 * (i+1) + c, n + p)\n        end else (s, n)) (0, 0) pc\n    in\n    let s, n =\n      List.fold_left (fun (s, n) (i, p, c) ->\n      if b land (1 lsl i) <> 0 then (s, n) else begin\n        let u = 100 * (i+1) in\n        let m = (g - s + u - 1) / u |> min (p-1) |> max 0 in\n        (s + m * u, n + m)\n      end) (s', n') pc in\n    if s >= g then n else inf\n  ) |> Array.fold_left min inf |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "sample_input": "2 700\n3 500\n5 800\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03290", "source_text": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 753, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s979106277", "group_id": "codeNet:p03293", "input_text": "open Batteries\nopen Printf\nlet () =\n  let s,t = Scanf.scanf \"%s %s \" (fun a b -> a,b) in\n  let ss = s^s in\n  let res =\n    try (\n      let _ = String.rfind ss t in true\n    ) with _ -> false\n  in\n  Printf.printf \"%s\\n\" @@\n  if res then \"Yes\" else \"No\"\n", "language": "OCaml", "metadata": {"date": 1534029530, "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/s979106277.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979106277", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let s,t = Scanf.scanf \"%s %s \" (fun a b -> a,b) in\n  let ss = s^s in\n  let res =\n    try (\n      let _ = String.rfind ss t in true\n    ) with _ -> false\n  in\n  Printf.printf \"%s\\n\" @@\n  if res then \"Yes\" else \"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s712293842", "group_id": "codeNet:p03293", "input_text": "let () =\n  let s = read_line () in\n  let t = read_line () in\n  Array.init (String.length s) (fun i -> i)\n  |> Array.to_list\n  |> List.exists (fun i ->\n      Array.init (String.length s) (fun j -> j)\n      |> Array.to_list\n      |> List.for_all (fun j ->\n          s.[(i + j) mod String.length s] = t.[j]))\n  |> (function true -> \"Yes\" | false -> \"No\")\n  |> print_endline\n", "language": "OCaml", "metadata": {"date": 1532221553, "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/s712293842.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s712293842", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  let t = read_line () in\n  Array.init (String.length s) (fun i -> i)\n  |> Array.to_list\n  |> List.exists (fun i ->\n      Array.init (String.length s) (fun j -> j)\n      |> Array.to_list\n      |> List.for_all (fun j ->\n          s.[(i + j) mod String.length s] = t.[j]))\n  |> (function true -> \"Yes\" | false -> \"No\")\n  |> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 1, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s275390131", "group_id": "codeNet:p03294", "input_text": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let ax = Array.init n (fun _ ->\n               Scanf.scanf \" %d\" (fun x -> x)) in\n   let res = Array.fold_left (fun res x ->\n                res + x - 1\n              ) 0 ax in\n  \n  Printf.printf \"%d\\n\" res\n  ", "language": "OCaml", "metadata": {"date": 1532228080, "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/s275390131.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s275390131", "user_id": "u614063956"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let ax = Array.init n (fun _ ->\n               Scanf.scanf \" %d\" (fun x -> x)) in\n   let res = Array.fold_left (fun res x ->\n                res + x - 1\n              ) 0 ax in\n  \n  Printf.printf \"%d\\n\" res\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 3200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s491652403", "group_id": "codeNet:p03294", "input_text": "let rec gcd a b =\n  if b = 0 then a else gcd b (a mod b)\nlet rec lcm a b =\n  a * b / gcd a b\nlet () =\n    let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let ax = Array.init n (fun _ ->\n               Scanf.scanf \" %d\" (fun x -> x)) in\n  let l = Array.fold_left (lcm) 1 ax in\n  let m = (if l = 1 then 1 else  l - 1) in\n  let res = Array.fold_left (fun res x ->\n                res + (m mod x)\n              ) 0 ax in\n  \n  Printf.printf \"%d\\n\" res\n  \n\n", "language": "OCaml", "metadata": {"date": 1532225502, "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/s491652403.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s491652403", "user_id": "u614063956"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec gcd a b =\n  if b = 0 then a else gcd b (a mod b)\nlet rec lcm a b =\n  a * b / gcd a b\nlet () =\n    let n = Scanf.scanf \"%d\\n\" (fun x -> x) in\n  let ax = Array.init n (fun _ ->\n               Scanf.scanf \" %d\" (fun x -> x)) in\n  let l = Array.fold_left (lcm) 1 ax in\n  let m = (if l = 1 then 1 else  l - 1) in\n  let res = Array.fold_left (fun res x ->\n                res + (m mod x)\n              ) 0 ax in\n  \n  Printf.printf \"%d\\n\" res\n  \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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 448, "cpu_time_ms": 3, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s685680500", "group_id": "codeNet:p03295", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n max_int in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- min (b - 1) es.(a - 1)\n  done;\n  let acc = ref 0 in\n  for i = 0 to n - 2 do\n    if es.(i) = i + 1 then incr acc\n    else es.(i + 1) <- min es.(i) es.(i + 1)\n  done;\n  Printf.printf \"%d\\n\" !acc\n", "language": "OCaml", "metadata": {"date": 1532262400, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03295.html", "problem_id": "p03295", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03295/input.txt", "sample_output_relpath": "derived/input_output/data/p03295/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03295/OCaml/s685680500.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685680500", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n max_int in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- min (b - 1) es.(a - 1)\n  done;\n  let acc = ref 0 in\n  for i = 0 to n - 2 do\n    if es.(i) = i + 1 then incr acc\n    else es.(i + 1) <- min es.(i) es.(i + 1)\n  done;\n  Printf.printf \"%d\\n\" !acc\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands lining up from west to east, connected by N-1 bridges.\n\nThe i-th bridge connects the i-th island from the west and the (i+1)-th island from the west.\n\nOne day, disputes took place between some islands, and there were M requests from the inhabitants of the islands:\n\nRequest i: A dispute took place between the a_i-th island from the west and the b_i-th island from the west. Please make traveling between these islands with bridges impossible.\n\nYou decided to remove some bridges to meet all these M requests.\n\nFind the minimum number of bridges that must be removed.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq a_i < b_i \\leq N\n\nAll pairs (a_i, b_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nPrint the minimum number of bridges that must be removed.\n\nSample Input 1\n\n5 2\n1 4\n2 5\n\nSample Output 1\n\n1\n\nThe requests can be met by removing the bridge connecting the second and third islands from the west.\n\nSample Input 2\n\n9 5\n1 8\n2 7\n3 5\n4 6\n7 9\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n\nSample Output 3\n\n4", "sample_input": "5 2\n1 4\n2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03295", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands lining up from west to east, connected by N-1 bridges.\n\nThe i-th bridge connects the i-th island from the west and the (i+1)-th island from the west.\n\nOne day, disputes took place between some islands, and there were M requests from the inhabitants of the islands:\n\nRequest i: A dispute took place between the a_i-th island from the west and the b_i-th island from the west. Please make traveling between these islands with bridges impossible.\n\nYou decided to remove some bridges to meet all these M requests.\n\nFind the minimum number of bridges that must be removed.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq a_i < b_i \\leq N\n\nAll pairs (a_i, b_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nPrint the minimum number of bridges that must be removed.\n\nSample Input 1\n\n5 2\n1 4\n2 5\n\nSample Output 1\n\n1\n\nThe requests can be met by removing the bridge connecting the second and third islands from the west.\n\nSample Input 2\n\n9 5\n1 8\n2 7\n3 5\n4 6\n7 9\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 48, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s190031464", "group_id": "codeNet:p03296", "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 acc =\n        if i = n then acc else\n            if a.(i) = a.(i - 1) then (\n                a.(i) <- -i;\n                loop (i + 1) (acc + 1)\n            ) else loop (i + 1) acc\n    in\n    loop 1 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1595122889, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03296.html", "problem_id": "p03296", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03296/input.txt", "sample_output_relpath": "derived/input_output/data/p03296/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03296/OCaml/s190031464.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s190031464", "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 acc =\n        if i = n then acc else\n            if a.(i) = a.(i - 1) then (\n                a.(i) <- -i;\n                loop (i + 1) (acc + 1)\n            ) 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\nTakahashi lives in another world. There are slimes (creatures) of 10000 colors in this world. Let us call these colors Color 1, 2, ..., 10000.\n\nTakahashi has N slimes, and they are standing in a row from left to right. The color of the i-th slime from the left is a_i.\nIf two slimes of the same color are adjacent, they will start to combine themselves. Because Takahashi likes smaller slimes, he has decided to change the colors of some of the slimes with his magic.\n\nTakahashi can change the color of one slime to any of the 10000 colors by one spell.\nHow many spells are required so that no slimes will start to combine themselves?\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq a_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of spells required.\n\nSample Input 1\n\n5\n1 1 2 2 2\n\nSample Output 1\n\n2\n\nFor example, if we change the color of the second slime from the left to 4, and the color of the fourth slime to 5, the colors of the slimes will be 1, 4, 2, 5, 2, which satisfy the condition.\n\nSample Input 2\n\n3\n1 2 1\n\nSample Output 2\n\n0\n\nAlthough the colors of the first and third slimes are the same, they are not adjacent, so no spell is required.\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n2\n\nFor example, if we change the colors of the second and fourth slimes from the left to 2, the colors of the slimes will be 1, 2, 1, 2, 1, which satisfy the condition.\n\nSample Input 4\n\n14\n1 2 2 3 3 3 4 4 4 4 1 2 3 4\n\nSample Output 4\n\n4", "sample_input": "5\n1 1 2 2 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03296", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi lives in another world. There are slimes (creatures) of 10000 colors in this world. Let us call these colors Color 1, 2, ..., 10000.\n\nTakahashi has N slimes, and they are standing in a row from left to right. The color of the i-th slime from the left is a_i.\nIf two slimes of the same color are adjacent, they will start to combine themselves. Because Takahashi likes smaller slimes, he has decided to change the colors of some of the slimes with his magic.\n\nTakahashi can change the color of one slime to any of the 10000 colors by one spell.\nHow many spells are required so that no slimes will start to combine themselves?\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq a_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of spells required.\n\nSample Input 1\n\n5\n1 1 2 2 2\n\nSample Output 1\n\n2\n\nFor example, if we change the color of the second slime from the left to 4, and the color of the fourth slime to 5, the colors of the slimes will be 1, 4, 2, 5, 2, which satisfy the condition.\n\nSample Input 2\n\n3\n1 2 1\n\nSample Output 2\n\n0\n\nAlthough the colors of the first and third slimes are the same, they are not adjacent, so no spell is required.\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n2\n\nFor example, if we change the colors of the second and fourth slimes from the left to 2, the colors of the slimes will be 1, 2, 1, 2, 1, which satisfy the condition.\n\nSample Input 4\n\n14\n1 2 2 3 3 3 4 4 4 4 1 2 3 4\n\nSample Output 4\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 8, "memory_kb": 3828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s527048526", "group_id": "codeNet:p03297", "input_text": "open Scanf\nopen Printf\n\nmodule Int = struct\n  type t = int\n  let compare a b = compare a b\nend\n\nmodule S = Set.Make(Int)\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 = if c > 64000000\n  then let memo = S.empty in\n    let rec g x = if x < 0\n      then printf \"No\\n\"\n      else if S.mem x memo\n      then printf \"Yes\\n\"\n      else (ignore (S.add x memo); g (consume c b (x+d)))\n    in g (consume c b a)\n  else let memo = Array.make (c+1) false in\n    let rec g x = if x < 0\n      then printf \"No\\n\"\n      else if memo.(x)\n      then printf \"Yes\\n\"\n      else (memo.(x) <- true; g (consume c b (x+d)))\n    in g (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": 1532246119, "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/s527048526.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s527048526", "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\nmodule Int = struct\n  type t = int\n  let compare a b = compare a b\nend\n\nmodule S = Set.Make(Int)\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 = if c > 64000000\n  then let memo = S.empty in\n    let rec g x = if x < 0\n      then printf \"No\\n\"\n      else if S.mem x memo\n      then printf \"Yes\\n\"\n      else (ignore (S.add x memo); g (consume c b (x+d)))\n    in g (consume c b a)\n  else let memo = Array.make (c+1) false in\n    let rec g x = if x < 0\n      then printf \"No\\n\"\n      else if memo.(x)\n      then printf \"Yes\\n\"\n      else (memo.(x) <- true; g (consume c b (x+d)))\n    in g (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 792, "cpu_time_ms": 2103, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s914259067", "group_id": "codeNet:p03302", "input_text": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = print_endline @@ if a + b = 15 then \"+\" else if a * b = 15 then \"*\" else \"x\"", "language": "OCaml", "metadata": {"date": 1564020779, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03302.html", "problem_id": "p03302", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03302/input.txt", "sample_output_relpath": "derived/input_output/data/p03302/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03302/OCaml/s914259067.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s914259067", "user_id": "u732304692"}, "prompt_components": {"gold_output": "+\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = print_endline @@ if a + b = 15 then \"+\" else if a * b = 15 then \"*\" else \"x\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 15.", "sample_input": "4 11\n"}, "reference_outputs": ["+\n"], "source_document_id": "p03302", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 15.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s534266945", "group_id": "codeNet:p03303", "input_text": "let () = Scanf.scanf \"%s\\n%d\\n\" @@ fun s w ->\n  for i = 0 to (String.length s + w - 1) / w - 1 do\n    print_char s.[i * w]\n  done;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1531013568, "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/s534266945.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s534266945", "user_id": "u504158101"}, "prompt_components": {"gold_output": "adg\n", "input_to_evaluate": "let () = Scanf.scanf \"%s\\n%d\\n\" @@ fun s w ->\n  for i = 0 to (String.length s + w - 1) / w - 1 do\n    print_char s.[i * w]\n  done;\n  print_newline ()\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s013436096", "group_id": "codeNet:p03304", "input_text": "let () =\n  let n, m, d = Scanf.scanf \"%d %d %d\" (fun n m d -> n, m, d) in\n  (if d = 0 then\n     1.0 /. float n *. float (m-1)\n   else\n     2.0 *. float (n - d) /. float (n * n) *. float (m-1))\n  |> Printf.printf \"%.7f\\n\" \n  ", "language": "OCaml", "metadata": {"date": 1531020803, "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/s013436096.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013436096", "user_id": "u614063956"}, "prompt_components": {"gold_output": "1.0000000000\n", "input_to_evaluate": "let () =\n  let n, m, d = Scanf.scanf \"%d %d %d\" (fun n m d -> n, m, d) in\n  (if d = 0 then\n     1.0 /. float n *. float (m-1)\n   else\n     2.0 *. float (n - d) /. float (n * n) *. float (m-1))\n  |> Printf.printf \"%.7f\\n\" \n  ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "sample_input": "2 3 1\n"}, "reference_outputs": ["1.0000000000\n"], "source_document_id": "p03304", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s343367871", "group_id": "codeNet:p03307", "input_text": "let n = read_int ()\nlet _ = (if n mod 2 = 0 then n else n * 2) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1583978457, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/OCaml/s343367871.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s343367871", "user_id": "u511870776"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let n = read_int ()\nlet _ = (if n mod 2 = 0 then n else n * 2) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s998786043", "group_id": "codeNet:p03307", "input_text": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ if n mod 2 = 0 then n else 2 * n", "language": "OCaml", "metadata": {"date": 1562311676, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/OCaml/s998786043.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s998786043", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ if n mod 2 = 0 then n else 2 * n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 84, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s265215938", "group_id": "codeNet:p03307", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n    Printf.printf \"%d\\n\" @@\n    n * (if n mod 2 == 0 then 1 else 2)\n", "language": "OCaml", "metadata": {"date": 1534144347, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/OCaml/s265215938.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s265215938", "user_id": "u013750540"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n    Printf.printf \"%d\\n\" @@\n    n * (if n mod 2 == 0 then 1 else 2)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s432974616", "group_id": "codeNet:p03307", "input_text": "let get_int () = Scanf.scanf \"%d \" (fun v -> v)\n\nlet () =\n  let n = get_int ()\n  in (if n mod 2 = 0 then n else n*2\n  ) |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1530491490, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/OCaml/s432974616.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s432974616", "user_id": "u481480055"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let get_int () = Scanf.scanf \"%d \" (fun v -> v)\n\nlet () =\n  let n = get_int ()\n  in (if n mod 2 = 0 then n else n*2\n  ) |> string_of_int |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s175176359", "group_id": "codeNet:p03308", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.(fold_left max a_s.(0) a_s - fold_left min a_s.(0) a_s) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1567140403, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03308.html", "problem_id": "p03308", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03308/input.txt", "sample_output_relpath": "derived/input_output/data/p03308/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03308/OCaml/s175176359.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s175176359", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.(fold_left max a_s.(0) a_s - fold_left min a_s.(0) a_s) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 184, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s868424597", "group_id": "codeNet:p03308", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.fold_left max 0 a_s - Array.fold_left min a_s.(0) a_s |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1563585169, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03308.html", "problem_id": "p03308", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03308/input.txt", "sample_output_relpath": "derived/input_output/data/p03308/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03308/OCaml/s868424597.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868424597", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.fold_left max 0 a_s - Array.fold_left min a_s.(0) a_s |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s320632333", "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  Array.fold_left (fun (u,i) v -> \n    (* Printf.printf \"  %d::abs(%d-(%d+%d))=%d\\n\"\n      i v b i (abs (v-(b+i)))\n    ; *)\n    (u + (abs (v - (b+i)))), i+1) (0,1) a\n  |> fst\n\nlet () =\n  let n = get_int ()\n  in let a = input_int_array n\n  in let l = a |> Array.to_list\n  in let lmax = List.fold_left max min_int l\n  in let v = ref lmax in let f = ref true\n  in let la = ref max_int\n  in while !f do\n    let r = test a !v\n    in\n    (* Printf.printf \"%d::%d\\n\" !v r; *)\n    if r < !la then (\n      la := r; v := !v - 1\n    ) else (\n      f := false\n    )\n  done;\n  !la |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1530492836, "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/s320632333.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s320632333", "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  Array.fold_left (fun (u,i) v -> \n    (* Printf.printf \"  %d::abs(%d-(%d+%d))=%d\\n\"\n      i v b i (abs (v-(b+i)))\n    ; *)\n    (u + (abs (v - (b+i)))), i+1) (0,1) a\n  |> fst\n\nlet () =\n  let n = get_int ()\n  in let a = input_int_array n\n  in let l = a |> Array.to_list\n  in let lmax = List.fold_left max min_int l\n  in let v = ref lmax in let f = ref true\n  in let la = ref max_int\n  in while !f do\n    let r = test a !v\n    in\n    (* Printf.printf \"%d::%d\\n\" !v r; *)\n    if r < !la then (\n      la := r; v := !v - 1\n    ) else (\n      f := false\n    )\n  done;\n  !la |> string_of_int |> print_endline", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 745, "cpu_time_ms": 2104, "memory_kb": 9856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s473339665", "group_id": "codeNet:p03310", "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)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  for i = 1 to n-1 do a.(i) <- a.(i) + a.(i-1) done;\n\n  let psum l r =\n    if l >= r then 0\n    else if l = 0 then a.(r-1) else a.(r-1) - a.(l-1)\n  in\n  let halve a b =\n    let rec loop l r =\n      if l >= r then r\n      else\n        let m = (l+r) / 2 in\n        if psum a m >= psum m b then loop l m else loop (l+1) r\n    in\n    let m = loop a b in\n    if abs (psum a m - psum m b) <= abs (psum a (m-1) - psum (m-1) b) then\n      psum a m, psum m b\n    else\n      psum a (m-1), psum (m-1) b\n  in\n\n  for_fold 2 (n-3) (fun v i ->\n    let a, b = halve 0 i in\n    let c, d = halve i n in\n    List.(fold_left max a [a;b;c;d] - fold_left min a [a;b;c;d])\n    |> min v\n  ) a.(n-1) \n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1532430186, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03310.html", "problem_id": "p03310", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03310/input.txt", "sample_output_relpath": "derived/input_output/data/p03310/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03310/OCaml/s473339665.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s473339665", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\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)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  for i = 1 to n-1 do a.(i) <- a.(i) + a.(i-1) done;\n\n  let psum l r =\n    if l >= r then 0\n    else if l = 0 then a.(r-1) else a.(r-1) - a.(l-1)\n  in\n  let halve a b =\n    let rec loop l r =\n      if l >= r then r\n      else\n        let m = (l+r) / 2 in\n        if psum a m >= psum m b then loop l m else loop (l+1) r\n    in\n    let m = loop a b in\n    if abs (psum a m - psum m b) <= abs (psum a (m-1) - psum (m-1) b) then\n      psum a m, psum m b\n    else\n      psum a (m-1), psum (m-1) b\n  in\n\n  for_fold 2 (n-3) (fun v i ->\n    let a, b = halve 0 i in\n    let c, d = halve i n in\n    List.(fold_left max a [a;b;c;d] - fold_left min a [a;b;c;d])\n    |> min v\n  ) a.(n-1) \n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E.\nThe positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively.\nSnuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller.\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nConstraints\n\n4 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nSample Input 1\n\n5\n3 2 4 1 2\n\nSample Output 1\n\n2\n\nIf we divide A as B,C,D,E=(3),(2),(4),(1,2), then P=3,Q=2,R=4,S=1+2=3.\nHere, the maximum and the minimum among P,Q,R,S are 4 and 2, with the absolute difference of 2.\nWe cannot make the absolute difference of the maximum and the minimum less than 2, so the answer is 2.\n\nSample Input 2\n\n10\n10 71 84 33 6 47 23 25 52 64\n\nSample Output 2\n\n36\n\nSample Input 3\n\n7\n1 2 3 1000000000 4 5 6\n\nSample Output 3\n\n999999994", "sample_input": "5\n3 2 4 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03310", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E.\nThe positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively.\nSnuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller.\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nConstraints\n\n4 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nSample Input 1\n\n5\n3 2 4 1 2\n\nSample Output 1\n\n2\n\nIf we divide A as B,C,D,E=(3),(2),(4),(1,2), then P=3,Q=2,R=4,S=1+2=3.\nHere, the maximum and the minimum among P,Q,R,S are 4 and 2, with the absolute difference of 2.\nWe cannot make the absolute difference of the maximum and the minimum less than 2, so the answer is 2.\n\nSample Input 2\n\n10\n10 71 84 33 6 47 23 25 52 64\n\nSample Output 2\n\n36\n\nSample Input 3\n\n7\n1 2 3 1000000000 4 5 6\n\nSample Output 3\n\n999999994", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2104, "memory_kb": 7424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s349034424", "group_id": "codeNet:p03313", "input_text": "let memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x =\n    try Hashtbl.find dp x with\n    | Not_found ->\n        let result = f get x in\n        Hashtbl.add dp x result;\n        result in\n  get\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 as_ = Array.init (1 lsl n) @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  let dp = Array.init (1 lsl n) (fun i -> [i]) in\n  for i = 0 to (1 lsl n) - 1 do\n    for j = 0 to n - 1 do\n      if 0 < i land (1 lsl j) then\n        dp.(i) <-\n          take 2 @@\n          List.sort (fun i j -> compare as_.(j) as_.(i)) @@\n          List.sort_uniq compare @@\n          dp.(i) @ dp.(i land (lnot (1 lsl j)))\n    done\n  done;\n  let a = Array.map (fun is ->\n    List.fold_left ( + ) 0 @@\n    List.map (Array.get as_) is) dp in\n  for i = 1 to (1 lsl n) - 1 do\n    a.(i) <- max a.(i) a.(i - 1);\n    Printf.printf \"%d\\n\" a.(i)\n  done\n", "language": "OCaml", "metadata": {"date": 1535749359, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03313.html", "problem_id": "p03313", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03313/input.txt", "sample_output_relpath": "derived/input_output/data/p03313/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03313/OCaml/s349034424.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349034424", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n4\n5\n", "input_to_evaluate": "let memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x =\n    try Hashtbl.find dp x with\n    | Not_found ->\n        let result = f get x in\n        Hashtbl.add dp x result;\n        result in\n  get\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 as_ = Array.init (1 lsl n) @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  let dp = Array.init (1 lsl n) (fun i -> [i]) in\n  for i = 0 to (1 lsl n) - 1 do\n    for j = 0 to n - 1 do\n      if 0 < i land (1 lsl j) then\n        dp.(i) <-\n          take 2 @@\n          List.sort (fun i j -> compare as_.(j) as_.(i)) @@\n          List.sort_uniq compare @@\n          dp.(i) @ dp.(i land (lnot (1 lsl j)))\n    done\n  done;\n  let a = Array.map (fun is ->\n    List.fold_left ( + ) 0 @@\n    List.map (Array.get as_) is) dp in\n  for i = 1 to (1 lsl n) - 1 do\n    a.(i) <- max a.(i) a.(i - 1);\n    Printf.printf \"%d\\n\" a.(i)\n  done\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is an integer sequence of length 2^N: A_0, A_1, ..., A_{2^N-1}. (Note that the sequence is 0-indexed.)\n\nFor every integer K satisfying 1 \\leq K \\leq 2^N-1, solve the following problem:\n\nLet i and j be integers. Find the maximum value of A_i + A_j where 0 \\leq i < j \\leq 2^N-1 and (i or j) \\leq K.\nHere, or denotes the bitwise OR.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 ... A_{2^N-1}\n\nOutput\n\nPrint 2^N-1 lines.\nIn the i-th line, print the answer of the problem above for K=i.\n\nSample Input 1\n\n2\n1 2 3 1\n\nSample Output 1\n\n3\n4\n5\n\nFor K=1, the only possible pair of i and j is (i,j)=(0,1), so the answer is A_0+A_1=1+2=3.\n\nFor K=2, the possible pairs of i and j are (i,j)=(0,1),(0,2).\nWhen (i,j)=(0,2), A_i+A_j=1+3=4. This is the maximum value, so the answer is 4.\n\nFor K=3, the possible pairs of i and j are (i,j)=(0,1),(0,2),(0,3),(1,2),(1,3),(2,3) .\nWhen (i,j)=(1,2), A_i+A_j=2+3=5. This is the maximum value, so the answer is 5.\n\nSample Input 2\n\n3\n10 71 84 33 6 47 23 25\n\nSample Output 2\n\n81\n94\n155\n155\n155\n155\n155\n\nSample Input 3\n\n4\n75 26 45 72 81 47 97 97 2 2 25 82 84 17 56 32\n\nSample Output 3\n\n101\n120\n147\n156\n156\n178\n194\n194\n194\n194\n194\n194\n194\n194\n194", "sample_input": "2\n1 2 3 1\n"}, "reference_outputs": ["3\n4\n5\n"], "source_document_id": "p03313", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is an integer sequence of length 2^N: A_0, A_1, ..., A_{2^N-1}. (Note that the sequence is 0-indexed.)\n\nFor every integer K satisfying 1 \\leq K \\leq 2^N-1, solve the following problem:\n\nLet i and j be integers. Find the maximum value of A_i + A_j where 0 \\leq i < j \\leq 2^N-1 and (i or j) \\leq K.\nHere, or denotes the bitwise OR.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 ... A_{2^N-1}\n\nOutput\n\nPrint 2^N-1 lines.\nIn the i-th line, print the answer of the problem above for K=i.\n\nSample Input 1\n\n2\n1 2 3 1\n\nSample Output 1\n\n3\n4\n5\n\nFor K=1, the only possible pair of i and j is (i,j)=(0,1), so the answer is A_0+A_1=1+2=3.\n\nFor K=2, the possible pairs of i and j are (i,j)=(0,1),(0,2).\nWhen (i,j)=(0,2), A_i+A_j=1+3=4. This is the maximum value, so the answer is 4.\n\nFor K=3, the possible pairs of i and j are (i,j)=(0,1),(0,2),(0,3),(1,2),(1,3),(2,3) .\nWhen (i,j)=(1,2), A_i+A_j=2+3=5. This is the maximum value, so the answer is 5.\n\nSample Input 2\n\n3\n10 71 84 33 6 47 23 25\n\nSample Output 2\n\n81\n94\n155\n155\n155\n155\n155\n\nSample Input 3\n\n4\n75 26 45 72 81 47 97 97 2 2 25 82 84 17 56 32\n\nSample Output 3\n\n101\n120\n147\n156\n156\n178\n194\n194\n194\n194\n194\n194\n194\n194\n194", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 987, "cpu_time_ms": 605, "memory_kb": 31360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s840780941", "group_id": "codeNet:p03316", "input_text": "let rec arr_string str =\n        let length = String.length str in\n        match length with\n        | 0 -> []\n       | len ->\n                let first = String.sub str 0 1 in\n                let rest = String.sub str 1 (len - 1) in\n                (String.get first 0) :: (arr_string rest)\n                \nlet print_intline num = print_endline (string_of_int num)\n                \nlet rec sum ls = match ls with\n    | [] -> 0\n    | (x::xs) -> x + (sum xs)            \n                \nlet digits n =\n    let rec loop n acc =\n        if n = 0 then acc\n        else loop (n/10) (n mod 10::acc) in\n    match n with\n    | 0 -> [0]\n    | _ -> loop n []\n\nlet () =\n    let line = read_line () in\n    let input = int_of_string line in\n    let ans = sum (digits input) in\n    let resp = input mod ans in\n    match resp with\n        | 0 -> print_endline \"Yes\"\n         | _ -> print_endline \"No\"", "language": "OCaml", "metadata": {"date": 1529845689, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03316.html", "problem_id": "p03316", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03316/input.txt", "sample_output_relpath": "derived/input_output/data/p03316/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03316/OCaml/s840780941.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840780941", "user_id": "u824327681"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let rec arr_string str =\n        let length = String.length str in\n        match length with\n        | 0 -> []\n       | len ->\n                let first = String.sub str 0 1 in\n                let rest = String.sub str 1 (len - 1) in\n                (String.get first 0) :: (arr_string rest)\n                \nlet print_intline num = print_endline (string_of_int num)\n                \nlet rec sum ls = match ls with\n    | [] -> 0\n    | (x::xs) -> x + (sum xs)            \n                \nlet digits n =\n    let rec loop n acc =\n        if n = 0 then acc\n        else loop (n/10) (n mod 10::acc) in\n    match n with\n    | 0 -> [0]\n    | _ -> loop n []\n\nlet () =\n    let line = read_line () in\n    let input = int_of_string line in\n    let ans = sum (digits input) in\n    let resp = input mod ans in\n    match resp with\n        | 0 -> print_endline \"Yes\"\n         | _ -> print_endline \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(101) = 1 + 0 + 1 = 2.\n\nGiven an integer N, determine if S(N) divides N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf S(N) divides N, print Yes; if it does not, print No.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nIn this input, N=12.\nAs S(12) = 1 + 2 = 3, S(N) divides N.\n\nSample Input 2\n\n101\n\nSample Output 2\n\nNo\n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\nYes", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03316", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(101) = 1 + 0 + 1 = 2.\n\nGiven an integer N, determine if S(N) divides N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf S(N) divides N, print Yes; if it does not, print No.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nIn this input, N=12.\nAs S(12) = 1 + 2 = 3, S(N) divides N.\n\nSample Input 2\n\n101\n\nSample Output 2\n\nNo\n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 887, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s201142898", "group_id": "codeNet:p03317", "input_text": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let _ = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (fun x -> x) in\n  Printf.printf \"%d\\n\" ((n+k-3) / (k-1))", "language": "OCaml", "metadata": {"date": 1531254314, "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/s201142898.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201142898", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let _ = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (fun x -> x) in\n  Printf.printf \"%d\\n\" ((n+k-3) / (k-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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s501559703", "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  |> List.tl\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", "language": "OCaml", "metadata": {"date": 1529808905, "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/s501559703.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501559703", "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  |> List.tl\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", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 694, "cpu_time_ms": 5, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s062849205", "group_id": "codeNet:p03323", "input_text": "open Printf\nopen Scanf\n\nlet solve a b =\n  if a <= 8 && b <= 8 then \"Yay!\" else \":(\"\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582595679, "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/s062849205.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062849205", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b =\n  if a <= 8 && b <= 8 then \"Yay!\" else \":(\"\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%s\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s615144544", "group_id": "codeNet:p03323", "input_text": "let f x y = if x <= 8 && y <= 8 then true else false\nlet calc = if Scanf.scanf \"%d %d\" f then \"Yay!\" else \":(\"\nlet main = print_string calc", "language": "OCaml", "metadata": {"date": 1529448861, "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/s615144544.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s615144544", "user_id": "u550314572"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "let f x y = if x <= 8 && y <= 8 then true else false\nlet calc = if Scanf.scanf \"%d %d\" f then \"Yay!\" else \":(\"\nlet main = print_string calc", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s080024582", "group_id": "codeNet:p03327", "input_text": "let n = read_int () \nlet _ = if n < 1000 then print_endline \"ABC\" else print_endline \"ABD\"", "language": "OCaml", "metadata": {"date": 1583979908, "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/s080024582.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s080024582", "user_id": "u511870776"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let n = read_int () \nlet _ = if n < 1000 then print_endline \"ABC\" else print_endline \"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s070697380", "group_id": "codeNet:p03328", "input_text": "Scanf.scanf \"%d %d\" (fun a b ->\n    let c = b - a in\n    Printf.printf \"%d\\n\" @@ c * (c - 1) / 2 - a\n)", "language": "OCaml", "metadata": {"date": 1586574161, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03328.html", "problem_id": "p03328", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03328/input.txt", "sample_output_relpath": "derived/input_output/data/p03328/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03328/OCaml/s070697380.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s070697380", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun a b ->\n    let c = b - a in\n    Printf.printf \"%d\\n\" @@ c * (c - 1) / 2 - a\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "sample_input": "8 13\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03328", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s864406072", "group_id": "codeNet:p03328", "input_text": "let () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  let h_arr = Array.init 1000 (fun _ -> 0) in\n  for i = 1 to 999 do\n    h_arr.(i) <- h_arr.(i-1)+i\n  done;\n  let d = b - a in\n\n  Printf.printf \"%d\\n\" (h_arr.(d) - b)\n", "language": "OCaml", "metadata": {"date": 1528682877, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03328.html", "problem_id": "p03328", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03328/input.txt", "sample_output_relpath": "derived/input_output/data/p03328/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03328/OCaml/s864406072.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864406072", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  let h_arr = Array.init 1000 (fun _ -> 0) in\n  for i = 1 to 999 do\n    h_arr.(i) <- h_arr.(i-1)+i\n  done;\n  let d = b - a in\n\n  Printf.printf \"%d\\n\" (h_arr.(d) - b)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "sample_input": "8 13\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03328", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s454130160", "group_id": "codeNet:p03328", "input_text": "open Scanf\nopen Printf\n\nlet id a = a\nlet pair a b = a, b\nlet triplet a b c = a, b, c\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 () = let a,b = scanf \"%d %d\\n\" pair in\n  let n = b - a - 1 in\n  printf \"%d\\n\" (n*(n+1)/2 - a)", "language": "OCaml", "metadata": {"date": 1528679674, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03328.html", "problem_id": "p03328", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03328/input.txt", "sample_output_relpath": "derived/input_output/data/p03328/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03328/OCaml/s454130160.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s454130160", "user_id": "u379439911"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet id a = a\nlet pair a b = a, b\nlet triplet a b c = a, b, c\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 () = let a,b = scanf \"%d %d\\n\" pair in\n  let n = b - a - 1 in\n  printf \"%d\\n\" (n*(n+1)/2 - a)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "sample_input": "8 13\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03328", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 301, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s571800781", "group_id": "codeNet:p03329", "input_text": "let rec digits r = function\n  | 0 -> []\n  | n -> n mod r :: digits r (n / r)\n \nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  Array.init (n + 1) (fun i ->\n    List.fold_left ( + ) 0 (digits 6 i) + List.fold_left ( + ) 0 (digits 9 (n - i)))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1528688412, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s571800781.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571800781", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let rec digits r = function\n  | 0 -> []\n  | n -> n mod r :: digits r (n / r)\n \nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  Array.init (n + 1) (fun i ->\n    List.fold_left ( + ) 0 (digits 6 i) + List.fold_left ( + ) 0 (digits 9 (n - i)))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 38, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s465234368", "group_id": "codeNet:p03338", "input_text": "let n, s = Scanf.scanf \" %d %s\" @@ fun a b -> a, b\nlet ans = ref 0\nlet _ =\n  for i = 1 to n - 1 do\n    let c = ref 0 in\n    for j = Char.code 'a' to Char.code 'z' do\n      if String.contains (String.sub s 0 i) @@ Char.chr j && String.contains (String.sub s i @@ n - i) @@ Char.chr j then incr c done;\n    ans := max !ans !c done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1563394545, "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/s465234368.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465234368", "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 = ref 0\nlet _ =\n  for i = 1 to n - 1 do\n    let c = ref 0 in\n    for j = Char.code 'a' to Char.code 'z' do\n      if String.contains (String.sub s 0 i) @@ Char.chr j && String.contains (String.sub s i @@ n - i) @@ Char.chr j then incr c done;\n    ans := max !ans !c 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s246130219", "group_id": "codeNet:p03338", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let s = read_line () in\n  Array.init (n + 1) (fun i ->\n    Array.init 26 (fun c -> Char.chr @@ Char.code 'a' + c)\n    |> Array.to_list\n    |> List.filter (fun c ->\n        List.exists (fun i -> s.[i] = c) (Array.to_list @@ Array.init i @@ fun j -> j) && List.exists (fun i -> s.[i] = c) (Array.to_list @@ Array.init (n - i) (( + ) i)))\n    |> List.length)\n  |> Array.fold_left max min_int\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1530507508, "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/s246130219.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s246130219", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let s = read_line () in\n  Array.init (n + 1) (fun i ->\n    Array.init 26 (fun c -> Char.chr @@ Char.code 'a' + c)\n    |> Array.to_list\n    |> List.filter (fun c ->\n        List.exists (fun i -> s.[i] = c) (Array.to_list @@ Array.init i @@ fun j -> j) && List.exists (fun i -> s.[i] = c) (Array.to_list @@ Array.init (n - i) (( + ) i)))\n    |> List.length)\n  |> Array.fold_left max min_int\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 455, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s726619877", "group_id": "codeNet:p03338", "input_text": "let base = int_of_char 'a'\nlet () =\n  Scanf.scanf \"%d \" @@ fun n  -> \n  let s =  Array.init n (fun _ ->\n               Scanf.scanf \"%c\" (fun x -> x)) in\n  let result = ref 0 in\n  for i = 0 to (n-1) do\n    let left = Array.sub s 0 i in\n    let right = Array.sub s i (n-i)  in\n    let left' = Array.to_list left in\n    let right' = Array.to_list right in\n    let num = ref 0 in\n    for i = 0 to 26 do\n      if List.mem (char_of_int (i+base)) left' = true\n         && List.mem (char_of_int (i+base)) right' = true then\n        num := 1 + !num\n      else\n        ()\n    done;\n    if !num > !result then result := !num\n    else ()\n  done;\n  Printf.printf \"%d\\n\" (!result)\n", "language": "OCaml", "metadata": {"date": 1528486858, "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/s726619877.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726619877", "user_id": "u614063956"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let base = int_of_char 'a'\nlet () =\n  Scanf.scanf \"%d \" @@ fun n  -> \n  let s =  Array.init n (fun _ ->\n               Scanf.scanf \"%c\" (fun x -> x)) in\n  let result = ref 0 in\n  for i = 0 to (n-1) do\n    let left = Array.sub s 0 i in\n    let right = Array.sub s i (n-i)  in\n    let left' = Array.to_list left in\n    let right' = Array.to_list right in\n    let num = ref 0 in\n    for i = 0 to 26 do\n      if List.mem (char_of_int (i+base)) left' = true\n         && List.mem (char_of_int (i+base)) right' = true then\n        num := 1 + !num\n      else\n        ()\n    done;\n    if !num > !result then result := !num\n    else ()\n  done;\n  Printf.printf \"%d\\n\" (!result)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 667, "cpu_time_ms": 3, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s163729805", "group_id": "codeNet:p03339", "input_text": "let n, s = Scanf.scanf \" %d %s\" @@ fun a b -> a, b\nlet ans = ref max_int\nlet ls, rs = Array.make (n + 1) 0, Array.make (n + 1) 0\nlet _ =\n  for i = 0 to n - 1 do ls.(i + 1) <- ls.(i) + if s.[i] = 'W' then 1 else 0 done;\n  for i = n - 1 downto 0 do rs.(i) <- rs.(i + 1) + if s.[i] = 'E' then 1 else 0 done;\n  for i = 0 to n - 1 do ans := min !ans @@ ls.(i) + rs.(i + 1) done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1563041765, "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/s163729805.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s163729805", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, s = Scanf.scanf \" %d %s\" @@ fun a b -> a, b\nlet ans = ref max_int\nlet ls, rs = Array.make (n + 1) 0, Array.make (n + 1) 0\nlet _ =\n  for i = 0 to n - 1 do ls.(i + 1) <- ls.(i) + if s.[i] = 'W' then 1 else 0 done;\n  for i = n - 1 downto 0 do rs.(i) <- rs.(i + 1) + if s.[i] = 'E' then 1 else 0 done;\n  for i = 0 to n - 1 do ans := min !ans @@ ls.(i) + rs.(i + 1) done;\n  Printf.printf \"%d\\n\" !ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 8320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s763014894", "group_id": "codeNet:p03339", "input_text": "open Batteries\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n\n  let char_arr = Array.of_list (String.to_list s) in\n  let res = ref n in\n\n  let left_w = Array.make n 0 in\n  let right_e = Array.make n 0 in\n\n  for i=1 to (n-1) do\n    if char_arr.(i-1) = 'W' then \n      left_w.(i) <- left_w.(i-1) + 1\n    else\n      left_w.(i) <- left_w.(i-1)\n  done;\n\n  for i=1 to (n-1) do\n    let i = n-1-i in\n    if char_arr.(i+1) = 'E' then \n      right_e.(i) <- right_e.(i+1) + 1\n    else\n      right_e.(i) <- right_e.(i+1)\n  done;\n\n  for i=0 to (n-1) do\n    let v = left_w.(i) + right_e.(i) in\n    if v < !res then res := v\n  done;\n\n  Array.iter print_int left_w;\n  print_endline \"\";\n  Array.iter print_int right_e;\n  print_endline \"\";\n  print_endline (string_of_int (!res))\n", "language": "OCaml", "metadata": {"date": 1527386634, "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/s763014894.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s763014894", "user_id": "u139013163"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n\n  let char_arr = Array.of_list (String.to_list s) in\n  let res = ref n in\n\n  let left_w = Array.make n 0 in\n  let right_e = Array.make n 0 in\n\n  for i=1 to (n-1) do\n    if char_arr.(i-1) = 'W' then \n      left_w.(i) <- left_w.(i-1) + 1\n    else\n      left_w.(i) <- left_w.(i-1)\n  done;\n\n  for i=1 to (n-1) do\n    let i = n-1-i in\n    if char_arr.(i+1) = 'E' then \n      right_e.(i) <- right_e.(i+1) + 1\n    else\n      right_e.(i) <- right_e.(i+1)\n  done;\n\n  for i=0 to (n-1) do\n    let v = left_w.(i) + right_e.(i) in\n    if v < !res then res := v\n  done;\n\n  Array.iter print_int left_w;\n  print_endline \"\";\n  Array.iter print_int right_e;\n  print_endline \"\";\n  print_endline (string_of_int (!res))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 813, "cpu_time_ms": 135, "memory_kb": 25088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s802019638", "group_id": "codeNet:p03339", "input_text": "open Batteries\n\nlet main () =\n  let n, s = Scanf.scanf \"%d\\n%s\" (fun x y -> x, y) in\n  let ans = ref 30001 in\n  for i = 0 to n - 1 do\n    let x = if i > 0 then String.slice ~first:0 ~last:i s else \"\" in\n    let y = String.slice ~first:(i+1) ~last:n s in\n    ans := min !ans (String.fold_left (fun acc elem -> if Char.equal 'W' elem then acc + 1 else acc) 0 x +\n                     String.fold_left (fun acc elem -> if Char.equal 'E' elem then acc + 1 else acc) 0 y)\n  done;\n  Printf.printf \"%d\\n\" !ans\n\nlet _ = main ()\n", "language": "OCaml", "metadata": {"date": 1527384701, "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/s802019638.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s802019638", "user_id": "u088955385"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\n\nlet main () =\n  let n, s = Scanf.scanf \"%d\\n%s\" (fun x y -> x, y) in\n  let ans = ref 30001 in\n  for i = 0 to n - 1 do\n    let x = if i > 0 then String.slice ~first:0 ~last:i s else \"\" in\n    let y = String.slice ~first:(i+1) ~last:n s in\n    ans := min !ans (String.fold_left (fun acc elem -> if Char.equal 'W' elem then acc + 1 else acc) 0 x +\n                     String.fold_left (fun acc elem -> if Char.equal 'E' elem then acc + 1 else acc) 0 y)\n  done;\n  Printf.printf \"%d\\n\" !ans\n\nlet _ = main ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2104, "memory_kb": 10496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s608336846", "group_id": "codeNet:p03341", "input_text": "Scanf.scanf \"%d %s\" (fun n s ->\n    let e = Array.make n 0 in\n    let w = Array.make n 0 in\n    if s.[0] = 'E' then e.(0) <- 1 else w.(0) <- 1;\n    for j = 1 to n - 1 do\n        if s.[j] = 'E' then (e.(j) <- e.(j - 1) + 1; w.(j) <- w.(j - 1))\n                       else (w.(j) <- w.(j - 1) + 1; e.(j) <- e.(j - 1))\n    done;\n    let rec loop i acc =\n        if i = n then acc else (\n            let q =\n                if i = 0     then e.(n - 1) - e.(i) else\n                if i = n - 1 then w.(i - 1)         else\n                                  e.(n - 1) - e.(i) + w.(i - 1)\n            in\n            let acc = min acc q in\n            loop (i + 1) acc\n\n        )\n    in\n    loop 0 max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1587612995, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03341.html", "problem_id": "p03341", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03341/input.txt", "sample_output_relpath": "derived/input_output/data/p03341/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03341/OCaml/s608336846.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s608336846", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d %s\" (fun n s ->\n    let e = Array.make n 0 in\n    let w = Array.make n 0 in\n    if s.[0] = 'E' then e.(0) <- 1 else w.(0) <- 1;\n    for j = 1 to n - 1 do\n        if s.[j] = 'E' then (e.(j) <- e.(j - 1) + 1; w.(j) <- w.(j - 1))\n                       else (w.(j) <- w.(j - 1) + 1; e.(j) <- e.(j - 1))\n    done;\n    let rec loop i acc =\n        if i = n then acc else (\n            let q =\n                if i = 0     then e.(n - 1) - e.(i) else\n                if i = n - 1 then w.(i - 1)         else\n                                  e.(n - 1) - e.(i) + w.(i - 1)\n            in\n            let acc = min acc q in\n            loop (i + 1) acc\n\n        )\n    in\n    loop 0 max_int |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people standing in a row from west to east.\nEach person is facing east or west.\nThe directions of the people is given as a string S of length N.\nThe i-th person from the west is facing east if S_i = E, and west if S_i = W.\n\nYou will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.\nHere, we do not care which direction the leader is facing.\n\nThe people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.\nFind the minimum number of people who have to change their directions.\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n|S| = N\n\nS_i is E or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of people who have to change their directions.\n\nSample Input 1\n\n5\nWEEWW\n\nSample Output 1\n\n1\n\nAssume that we appoint the third person from the west as the leader.\nThen, the first person from the west needs to face east and has to turn around.\nThe other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.\nIt is not possible to have 0 people who have to change their directions, so the answer is 1.\n\nSample Input 2\n\n12\nWEWEWEEEWWWE\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\nWWWWWEEE\n\nSample Output 3\n\n3", "sample_input": "5\nWEEWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03341", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 8320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s094504398", "group_id": "codeNet:p03341", "input_text": "(*\n * 西=左 \n * 東=右\n *)\n\nlet () = Scanf.scanf \"%d\\n%s\\n\" @@ fun n s ->\n  let west = Array.make (n + 2) 0\n  in\n  let east = Array.make (n + 2) 0\n  in\n  for i = 0 to n - 1 do\n    (if s.[i] = 'W' then\n      west.(i + 2) <- 1);\n    (if s.[i] = 'E' then\n      east.(i) <- 1)\n  done;\n  for i = 1 to n + 1 do\n    west.(i) <- west.(i) + west.(i - 1);\n  done;\n  for i = n downto 0 do\n    east.(i) <- east.(i) + east.(i + 1)\n  done;\n  Array.init n (fun i -> west.(i + 1) + east.(i + 1))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1527386477, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03341.html", "problem_id": "p03341", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03341/input.txt", "sample_output_relpath": "derived/input_output/data/p03341/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03341/OCaml/s094504398.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s094504398", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(*\n * 西=左 \n * 東=右\n *)\n\nlet () = Scanf.scanf \"%d\\n%s\\n\" @@ fun n s ->\n  let west = Array.make (n + 2) 0\n  in\n  let east = Array.make (n + 2) 0\n  in\n  for i = 0 to n - 1 do\n    (if s.[i] = 'W' then\n      west.(i + 2) <- 1);\n    (if s.[i] = 'E' then\n      east.(i) <- 1)\n  done;\n  for i = 1 to n + 1 do\n    west.(i) <- west.(i) + west.(i - 1);\n  done;\n  for i = n downto 0 do\n    east.(i) <- east.(i) + east.(i + 1)\n  done;\n  Array.init n (fun i -> west.(i + 1) + east.(i + 1))\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people standing in a row from west to east.\nEach person is facing east or west.\nThe directions of the people is given as a string S of length N.\nThe i-th person from the west is facing east if S_i = E, and west if S_i = W.\n\nYou will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.\nHere, we do not care which direction the leader is facing.\n\nThe people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.\nFind the minimum number of people who have to change their directions.\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n|S| = N\n\nS_i is E or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of people who have to change their directions.\n\nSample Input 1\n\n5\nWEEWW\n\nSample Output 1\n\n1\n\nAssume that we appoint the third person from the west as the leader.\nThen, the first person from the west needs to face east and has to turn around.\nThe other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.\nIt is not possible to have 0 people who have to change their directions, so the answer is 1.\n\nSample Input 2\n\n12\nWEWEWEEEWWWE\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\nWWWWWEEE\n\nSample Output 3\n\n3", "sample_input": "5\nWEEWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03341", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 21, "memory_kb": 12928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s344345763", "group_id": "codeNet:p03341", "input_text": "module MultiSet = \n  struct\nmodule type OrderedType =\n  sig\n    type t\n    val compare: t -> t -> int\n  end\n \nmodule 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    (* 最小の要素 空集合が与えられた場合はNot_foundを投げる *)\n    val min_elt : t -> elt\n    (* 最大の要素 空集合が与えられた場合はNot_foundを投げる *)\n    val max_elt : t -> elt\n  end\n \nmodule 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 1 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 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\n  end\n \nmodule IntMultiSet = MultiSet.Make (struct\n  type t = int\n  let compare = compare\nend)\n \n(*\n * 西=左 \n * 東=右\n *)\n \nlet () = Scanf.scanf \"%d\\n%s\\n\" @@ fun n s ->\n  let west, east =\n    Array.init (String.length s) (fun i -> (i, s.[i]))\n      |> Array.fold_left (fun (west, east) -> function\n        | (i, 'W') -> (IntMultiSet.add i 1 west, east)\n        | (i, 'E') -> (west, IntMultiSet.add i 1 east)) (IntMultiSet.empty, IntMultiSet.empty) in\n  Array.init (String.length s - 1) (fun i ->\n    IntMultiSet.count_lt i west + IntMultiSet.count_gt i east)\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1527385153, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03341.html", "problem_id": "p03341", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03341/input.txt", "sample_output_relpath": "derived/input_output/data/p03341/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03341/OCaml/s344345763.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s344345763", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module MultiSet = \n  struct\nmodule type OrderedType =\n  sig\n    type t\n    val compare: t -> t -> int\n  end\n \nmodule 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    (* 最小の要素 空集合が与えられた場合はNot_foundを投げる *)\n    val min_elt : t -> elt\n    (* 最大の要素 空集合が与えられた場合はNot_foundを投げる *)\n    val max_elt : t -> elt\n  end\n \nmodule 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 1 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 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\n  end\n \nmodule IntMultiSet = MultiSet.Make (struct\n  type t = int\n  let compare = compare\nend)\n \n(*\n * 西=左 \n * 東=右\n *)\n \nlet () = Scanf.scanf \"%d\\n%s\\n\" @@ fun n s ->\n  let west, east =\n    Array.init (String.length s) (fun i -> (i, s.[i]))\n      |> Array.fold_left (fun (west, east) -> function\n        | (i, 'W') -> (IntMultiSet.add i 1 west, east)\n        | (i, 'E') -> (west, IntMultiSet.add i 1 east)) (IntMultiSet.empty, IntMultiSet.empty) in\n  Array.init (String.length s - 1) (fun i ->\n    IntMultiSet.count_lt i west + IntMultiSet.count_gt i east)\n  |> Array.fold_left min max_int\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": "p03341", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6997, "cpu_time_ms": 472, "memory_kb": 40832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s280152764", "group_id": "codeNet:p03346", "input_text": "let _ =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let p = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let c = Array.make (n+1) 0 in\n  Array.fold_left (fun s x ->\n    c.(x) <- c.(x-1) + 1;\n    min s (n - c.(x))\n  ) n p\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1534966747, "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/s280152764.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s280152764", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let _ =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let p = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let c = Array.make (n+1) 0 in\n  Array.fold_left (fun s x ->\n    c.(x) <- c.(x-1) + 1;\n    min s (n - c.(x))\n  ) n p\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "sample_input": "4\n1\n3\n2\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03346", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 245, "cpu_time_ms": 56, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s052106538", "group_id": "codeNet:p03351", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun a b c d ->\n    print_endline @@\n        if abs (b - a) <= d && abs (c - b) <= d || abs (c - a) <= d then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1598585349, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s052106538.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052106538", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun a b c d ->\n    print_endline @@\n        if abs (b - a) <= d && abs (c - b) <= d || abs (c - a) <= d then \"Yes\" else \"No\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s510931793", "group_id": "codeNet:p03351", "input_text": "Scanf.scanf \"%d %d %d %d\" @@ fun a b c d -> print_endline @@ if abs (a - c) <= d || abs (a - b) <= d && abs (b - c) <= d then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1580968194, "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/s510931793.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s510931793", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" @@ fun a b c d -> print_endline @@ if abs (a - c) <= d || abs (a - b) <= d && abs (b - c) <= d then \"Yes\" else \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "sample_input": "4 7 9 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03351", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334354758", "group_id": "codeNet:p03351", "input_text": "let () = Scanf.scanf \"%d %d %d %d\" @@ fun a b c d ->\n  print_endline @@\n    if abs (a - c) <= d || abs (a - b) <= d && abs (b - c) <= d then \"Yes\"\n    else \"No\"\n", "language": "OCaml", "metadata": {"date": 1530507611, "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/s334354758.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334354758", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d\" @@ fun a b c d ->\n  print_endline @@\n    if abs (a - c) <= d || abs (a - b) <= d && abs (b - c) <= d then \"Yes\"\n    else \"No\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s177726288", "group_id": "codeNet:p03352", "input_text": "let exps_base_n_less_than x n =\n  let rec aux acc =\n    if acc <= x then acc :: (aux @@ ( * ) n acc)\n    else [] in\n  aux @@ ( * ) n n\n\nlet exp_less_than_dec x =\n  let rec exps n =\n    if n = 1 then [1]\n    else exps_base_n_less_than x n @ exps @@ pred n\n  in\n  List.filter (fun n -> n <= x) @@ exps x\n  |> List.sort compare\n  |> List.rev\n\nlet main () =\n  let x = Scanf.scanf \"%d\" (fun x -> x) in\n  exp_less_than_dec x\n  |> List.hd\n  |> print_int\n\nlet () = main ()\n", "language": "OCaml", "metadata": {"date": 1545846038, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/OCaml/s177726288.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177726288", "user_id": "u802614675"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let exps_base_n_less_than x n =\n  let rec aux acc =\n    if acc <= x then acc :: (aux @@ ( * ) n acc)\n    else [] in\n  aux @@ ( * ) n n\n\nlet exp_less_than_dec x =\n  let rec exps n =\n    if n = 1 then [1]\n    else exps_base_n_less_than x n @ exps @@ pred n\n  in\n  List.filter (fun n -> n <= x) @@ exps x\n  |> List.sort compare\n  |> List.rev\n\nlet main () =\n  let x = Scanf.scanf \"%d\" (fun x -> x) in\n  exp_less_than_dec x\n  |> List.hd\n  |> print_int\n\nlet () = main ()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s731682412", "group_id": "codeNet:p03352", "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\" @@ fun x ->\n  let a = Array.make (x+1) false in\n  a.(1) <- true;\n  iter 2 (x+1) (fun b ->\n    let rec loop v =\n      if v > x then ()\n      else (a.(v) <- true; loop (v*b))\n    in loop (b*b));\n  Array.mapi (fun i e -> i,e) a\n  |> Array.fold_left (fun v (i,t) -> if t then i else v) 1\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531254121, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/OCaml/s731682412.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731682412", "user_id": "u798181098"}, "prompt_components": {"gold_output": "9\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\" @@ fun x ->\n  let a = Array.make (x+1) false in\n  a.(1) <- true;\n  iter 2 (x+1) (fun b ->\n    let rec loop v =\n      if v > x then ()\n      else (a.(v) <- true; loop (v*b))\n    in loop (b*b));\n  Array.mapi (fun i e -> i,e) a\n  |> Array.fold_left (fun v (i,t) -> if t then i else v) 1\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s500263184", "group_id": "codeNet:p03352", "input_text": "let main () =\n  let x = Scanf.scanf \"%d\\n\" (fun a -> a) in\n  let ans = BatArray.make (x+1) false in\n  ans.(1) <- true;\n  for i = 2 to x do\n    let n = ref @@ i * i in\n    while !n <= x do\n      ans.(!n) <- true;\n      n := !n * i;\n    done;\n  done;\n  for i = x downto 1 do\n    if ans.(i) then (print_int i; exit 0)\n  done;;\n\nlet _ = main ()\n", "language": "OCaml", "metadata": {"date": 1526232781, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/OCaml/s500263184.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s500263184", "user_id": "u088955385"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let main () =\n  let x = Scanf.scanf \"%d\\n\" (fun a -> a) in\n  let ans = BatArray.make (x+1) false in\n  ans.(1) <- true;\n  for i = 2 to x do\n    let n = ref @@ i * i in\n    while !n <= x do\n      ans.(!n) <- true;\n      n := !n * i;\n    done;\n  done;\n  for i = x downto 1 do\n    if ans.(i) then (print_int i; exit 0)\n  done;;\n\nlet _ = main ()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s750925830", "group_id": "codeNet:p03352", "input_text": "let main () =\n  let rec expi a b = if b = 1 then a else expi (a*a) (b-1) in\n  let x = Scanf.scanf \"%d\\n\" (fun a -> a) in\n  let xs = ref [1] in\n  let rec minexp x i acc = if expi i acc <= x then minexp x i (acc+1) else expi i (acc-1) in\n  for i = 2 to int_of_float (sqrt (float_of_int x)) + 1 do\n    xs := minexp x i 2 :: !xs;\n  done;\n  xs := List.sort (fun a b -> (-1 * compare a b)) !xs;\n  print_int @@ List.hd !xs\n\nlet _ = main ()", "language": "OCaml", "metadata": {"date": 1526178250, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/OCaml/s750925830.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s750925830", "user_id": "u088955385"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let main () =\n  let rec expi a b = if b = 1 then a else expi (a*a) (b-1) in\n  let x = Scanf.scanf \"%d\\n\" (fun a -> a) in\n  let xs = ref [1] in\n  let rec minexp x i acc = if expi i acc <= x then minexp x i (acc+1) else expi i (acc-1) in\n  for i = 2 to int_of_float (sqrt (float_of_int x)) + 1 do\n    xs := minexp x i 2 :: !xs;\n  done;\n  xs := List.sort (fun a b -> (-1 * compare a b)) !xs;\n  print_int @@ List.hd !xs\n\nlet _ = main ()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s678549841", "group_id": "codeNet:p03353", "input_text": "Scanf.scanf \"%s %d\" (fun s k ->\n    let module S = Set.Make (struct type t = string let compare = compare end) in\n\n    let n = String.length s in\n\n    let rec loop st en set =\n        if st = n then set else\n            if en = n then loop (st + 1) (st + 1) set else\n                loop st (en + 1) (S.add (String.sub s st (en - st + 1)) set)\n    in\n    let set = loop 0 0 S.empty in\n\n    let rec loop i set =\n        let m = S.min_elt set in\n        if i = k then m else loop (i + 1) (S.remove m set)\n    in\n    loop 1 set |> print_endline\n)", "language": "OCaml", "metadata": {"date": 1598585872, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s678549841.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s678549841", "user_id": "u342443598"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "Scanf.scanf \"%s %d\" (fun s k ->\n    let module S = Set.Make (struct type t = string let compare = compare end) in\n\n    let n = String.length s in\n\n    let rec loop st en set =\n        if st = n then set else\n            if en = n then loop (st + 1) (st + 1) set else\n                loop st (en + 1) (S.add (String.sub s st (en - st + 1)) set)\n    in\n    let set = loop 0 0 S.empty in\n\n    let rec loop i set =\n        let m = S.min_elt set in\n        if i = k then m else loop (i + 1) (S.remove m set)\n    in\n    loop 1 set |> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2267, "memory_kb": 1697996}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s767487725", "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  print_endline (List.nth lst (k-1))\n\n", "language": "OCaml", "metadata": {"date": 1526190557, "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/s767487725.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s767487725", "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  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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2114, "memory_kb": 1703144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s410842217", "group_id": "codeNet:p03359", "input_text": "let () =\n  let a, b = Scanf.scanf \"%d %d\" (fun a b -> a, b) in\n  let result =\n    if a <= b then\n      a \n    else\n      a - 1\n  in\n  Printf.printf \"%d\\n\" result\n    \n      \n", "language": "OCaml", "metadata": {"date": 1528514728, "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/s410842217.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s410842217", "user_id": "u614063956"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () =\n  let a, b = Scanf.scanf \"%d %d\" (fun a b -> a, b) in\n  let result =\n    if a <= b then\n      a \n    else\n      a - 1\n  in\n  Printf.printf \"%d\\n\" result\n    \n      \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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s439297170", "group_id": "codeNet:p03359", "input_text": "let a = ref 0 and b = ref 0 in\n    Scanf.sscanf (read_line ()) \"%d %d\" (fun x y -> a := x; b := y);\n    if !b - !a >= 0 then print_string ((string_of_int !a) ^ \"\\n\") else print_string ((string_of_int (!a - 1)) ^ \"\\n\")", "language": "OCaml", "metadata": {"date": 1525658028, "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/s439297170.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439297170", "user_id": "u689344211"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let a = ref 0 and b = ref 0 in\n    Scanf.sscanf (read_line ()) \"%d %d\" (fun x y -> a := x; b := y);\n    if !b - !a >= 0 then print_string ((string_of_int !a) ^ \"\\n\") else print_string ((string_of_int (!a - 1)) ^ \"\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s211559526", "group_id": "codeNet:p03360", "input_text": "let () =\n  let x,  k = Scanf.scanf \"%d %d %d %d\" (fun a b c k -> [a;b;c], k) in\n  let x' = List.rev (List.sort (-) x) in\n  let y = (List.hd x') * 2 * k in\n  let res = y + List.fold_left (+) 0 (List.tl x') in\n  Printf.printf \"%d\\n\" res\n    \n      \n", "language": "OCaml", "metadata": {"date": 1528514632, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03360.html", "problem_id": "p03360", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03360/input.txt", "sample_output_relpath": "derived/input_output/data/p03360/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03360/OCaml/s211559526.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s211559526", "user_id": "u614063956"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "let () =\n  let x,  k = Scanf.scanf \"%d %d %d %d\" (fun a b c k -> [a;b;c], k) in\n  let x' = List.rev (List.sort (-) x) in\n  let y = (List.hd x') * 2 * k in\n  let res = y + List.fold_left (+) 0 (List.tl x') in\n  Printf.printf \"%d\\n\" res\n    \n      \n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "sample_input": "5 3 11\n1\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03360", "source_text": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s606889372", "group_id": "codeNet:p03361", "input_text": "Scanf.scanf \"%d %d\" (fun h w ->\n    let s = Array.init h (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n    let rec loop_y y =\n        let rec loop_x x =\n            if x = w then loop_y (y + 1) else\n                if s.(y).[x] = '.' then loop_x (x + 1) else (\n                    if x > 0     && s.(y).[x - 1] = '#' ||\n                       x < w - 1 && s.(y).[x + 1] = '#' ||\n                       y > 0     && s.(y - 1).[x] = '#' ||\n                       y < h - 1 && s.(y + 1).[x] = '#' then loop_x (x + 1) else false\n                )\n        in\n        if y = h then true else loop_x 0\n    in\n    print_endline @@ if loop_y 0 then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1598067736, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03361.html", "problem_id": "p03361", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03361/input.txt", "sample_output_relpath": "derived/input_output/data/p03361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03361/OCaml/s606889372.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s606889372", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun h w ->\n    let s = Array.init h (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n    let rec loop_y y =\n        let rec loop_x x =\n            if x = w then loop_y (y + 1) else\n                if s.(y).[x] = '.' then loop_x (x + 1) else (\n                    if x > 0     && s.(y).[x - 1] = '#' ||\n                       x < w - 1 && s.(y).[x + 1] = '#' ||\n                       y > 0     && s.(y - 1).[x] = '#' ||\n                       y < h - 1 && s.(y + 1).[x] = '#' then loop_x (x + 1) else false\n                )\n        in\n        if y = h then true else loop_x 0\n    in\n    print_endline @@ if loop_y 0 then \"Yes\" else \"No\"\n)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "sample_input": "3 3\n.#.\n###\n.#.\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03361", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 656, "cpu_time_ms": 9, "memory_kb": 3672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s513271032", "group_id": "codeNet:p03361", "input_text": "(* O(h w) *)\nlet h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet sss = Array.init h @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s\nlet _ =\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      if sss.(i).[j] = '#' then\n        let f (dy, dx) =\n          let y, x = i + dy, j + dx in\n          0 <= y && y < h && 0 <= x && x < w && sss.(y).[x] = '#' in\n        if not @@ List.exists f [-1, 0; 0, -1; 1, 0; 0, 1] then (print_endline \"No\"; exit 0)\n    done\n  done;\n  print_endline \"Yes\"", "language": "OCaml", "metadata": {"date": 1560056408, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03361.html", "problem_id": "p03361", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03361/input.txt", "sample_output_relpath": "derived/input_output/data/p03361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03361/OCaml/s513271032.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s513271032", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* O(h w) *)\nlet h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet sss = Array.init h @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s\nlet _ =\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      if sss.(i).[j] = '#' then\n        let f (dy, dx) =\n          let y, x = i + dy, j + dx in\n          0 <= y && y < h && 0 <= x && x < w && sss.(y).[x] = '#' in\n        if not @@ List.exists f [-1, 0; 0, -1; 1, 0; 0, 1] then (print_endline \"No\"; exit 0)\n    done\n  done;\n  print_endline \"Yes\"", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "sample_input": "3 3\n.#.\n###\n.#.\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03361", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s985669460", "group_id": "codeNet:p03361", "input_text": "let rec range a b = if a > b then [] else a :: range (a+1) b\nlet (>>=) x f = List.map f x |> List.concat\n\nlet () =\n  let h, w = Scanf.scanf \"%d %d\\n\" (fun h w -> h, w) in\n  let ss = Array.init h (fun _ ->\n               Scanf.scanf \"%s\\n\" (fun x -> x)) in\n             \n  (range 0 (h-1) >>= fun i ->\n   range 0 (w-1) >>= fun j -> [(i, j)])\n  |> List.for_all (fun (i, j) ->\n         ss.(i).[j] = '.'\n         || List.exists (fun (x, y) ->\n                try ss.(x).[y] = '#' with _ -> false)\n              [(i-1, j); (i+1, j); (i, j-1); (i, j+1)])\n  |> function\n    | true -> print_endline \"Yes\"\n    | false -> print_endline \"No\"\n  \n\n", "language": "OCaml", "metadata": {"date": 1528523030, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03361.html", "problem_id": "p03361", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03361/input.txt", "sample_output_relpath": "derived/input_output/data/p03361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03361/OCaml/s985669460.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985669460", "user_id": "u614063956"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let rec range a b = if a > b then [] else a :: range (a+1) b\nlet (>>=) x f = List.map f x |> List.concat\n\nlet () =\n  let h, w = Scanf.scanf \"%d %d\\n\" (fun h w -> h, w) in\n  let ss = Array.init h (fun _ ->\n               Scanf.scanf \"%s\\n\" (fun x -> x)) in\n             \n  (range 0 (h-1) >>= fun i ->\n   range 0 (w-1) >>= fun j -> [(i, j)])\n  |> List.for_all (fun (i, j) ->\n         ss.(i).[j] = '.'\n         || List.exists (fun (x, y) ->\n                try ss.(x).[y] = '#' with _ -> false)\n              [(i-1, j); (i+1, j); (i, j-1); (i, j+1)])\n  |> function\n    | true -> print_endline \"Yes\"\n    | false -> print_endline \"No\"\n  \n\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "sample_input": "3 3\n.#.\n###\n.#.\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03361", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 634, "cpu_time_ms": 1, "memory_kb": 1280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943034363", "group_id": "codeNet:p03361", "input_text": "let main () =\n  let flag = ref true in\n  let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b) in\n  let c = Array.make a \"\" in\n  for i = 0 to a - 1 do\n    c.(i) <- Scanf.scanf \"%s\\n\" (fun a -> a)\n  done;\n  for i = 0 to a - 1 do\n    for j = 0 to b - 1 do\n      if !flag = true && Char.compare (String.get c.(i) j) '#' = 0 then (\n        flag := false;\n        if i > 0 then (\n          if Char.compare (String.get c.(i - 1) j) '#' = 0 then flag := true\n        );\n        if i < a - 1 && not !flag then (\n          if Char.compare (String.get c.(i + 1) j) '#' = 0 then flag := true\n        );\n        if j > 0 && not !flag then (\n          if Char.compare (String.get c.(i) (j - 1)) '#' = 0 then flag := true\n        );\n        if j < b - 1 && not !flag then (\n          if Char.compare (String.get c.(i) (j + 1)) '#' = 0 then flag := true\n        );\n      )\n    done;\n  done;\n  Printf.printf \"%s\\n\" (if !flag then \"Yes\" else \"No\")\n\nlet _ = main ()\n", "language": "OCaml", "metadata": {"date": 1525571466, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03361.html", "problem_id": "p03361", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03361/input.txt", "sample_output_relpath": "derived/input_output/data/p03361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03361/OCaml/s943034363.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943034363", "user_id": "u088955385"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let main () =\n  let flag = ref true in\n  let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b) in\n  let c = Array.make a \"\" in\n  for i = 0 to a - 1 do\n    c.(i) <- Scanf.scanf \"%s\\n\" (fun a -> a)\n  done;\n  for i = 0 to a - 1 do\n    for j = 0 to b - 1 do\n      if !flag = true && Char.compare (String.get c.(i) j) '#' = 0 then (\n        flag := false;\n        if i > 0 then (\n          if Char.compare (String.get c.(i - 1) j) '#' = 0 then flag := true\n        );\n        if i < a - 1 && not !flag then (\n          if Char.compare (String.get c.(i + 1) j) '#' = 0 then flag := true\n        );\n        if j > 0 && not !flag then (\n          if Char.compare (String.get c.(i) (j - 1)) '#' = 0 then flag := true\n        );\n        if j < b - 1 && not !flag then (\n          if Char.compare (String.get c.(i) (j + 1)) '#' = 0 then flag := true\n        );\n      )\n    done;\n  done;\n  Printf.printf \"%s\\n\" (if !flag then \"Yes\" else \"No\")\n\nlet _ = main ()\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "sample_input": "3 3\n.#.\n###\n.#.\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03361", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 945, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s778345855", "group_id": "codeNet:p03362", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let arr = Array.init 55556 (fun i -> if i < 2 then 0 else i) in\n    let rec loop_i i =\n        let rec loop_j j =\n            if j <= 55555 then (arr.(j) <- 0; loop_j (j + i)) else loop_i (i + 1)\n        in\n        if i * i <= 55555 then loop_j (i * i)\n    in\n    loop_i 2;\n    let q = Array.fold_right (fun v acc -> if v = 0 then acc else v :: acc) arr [] in\n    let q = Array.of_list q in\n    let rec loop rest i =\n        if rest > 0 then (\n            if q.(i) mod 5 = 1 then (\n                Printf.printf \"%d \" q.(i);\n                loop (rest - 1) (i + 1)\n            ) else loop rest (i + 1)\n        )\n    in\n    loop n 0;\n    print_newline ()\n)", "language": "OCaml", "metadata": {"date": 1598067462, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03362.html", "problem_id": "p03362", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03362/input.txt", "sample_output_relpath": "derived/input_output/data/p03362/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03362/OCaml/s778345855.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778345855", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3 5 7 11 31\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let arr = Array.init 55556 (fun i -> if i < 2 then 0 else i) in\n    let rec loop_i i =\n        let rec loop_j j =\n            if j <= 55555 then (arr.(j) <- 0; loop_j (j + i)) else loop_i (i + 1)\n        in\n        if i * i <= 55555 then loop_j (i * i)\n    in\n    loop_i 2;\n    let q = Array.fold_right (fun v acc -> if v = 0 then acc else v :: acc) arr [] in\n    let q = Array.of_list q in\n    let rec loop rest i =\n        if rest > 0 then (\n            if q.(i) mod 5 = 1 then (\n                Printf.printf \"%d \" q.(i);\n                loop (rest - 1) (i + 1)\n            ) else loop rest (i + 1)\n        )\n    in\n    loop n 0;\n    print_newline ()\n)", "problem_context": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "sample_input": "5\n"}, "reference_outputs": ["3 5 7 11 31\n"], "source_document_id": "p03362", "source_text": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 4428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s975458923", "group_id": "codeNet:p03362", "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": 1525577349, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03362.html", "problem_id": "p03362", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03362/input.txt", "sample_output_relpath": "derived/input_output/data/p03362/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03362/OCaml/s975458923.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s975458923", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3 5 7 11 31\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: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "sample_input": "5\n"}, "reference_outputs": ["3 5 7 11 31\n"], "source_document_id": "p03362", "source_text": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 3840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s058693125", "group_id": "codeNet:p03363", "input_text": "open Batteries\nlet n = read_int ()\nlet a = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\nlet dp = Array.init n (fun _ -> 0)\n\nlet rec loop i =\n  if i >= n then () else (dp.(i) <- dp.(i-1) + a.(i); loop (i+1))\n\nlet _ = dp.(0) <- a.(0); loop 1\n\nlet rec i_loop i =\n  let rec j_loop j =\n    if j >= n then 0 else\n    (if dp.(j) - dp.(i) = 0 then 1 + (j_loop @@ j+1) else j_loop @@ j+1)\n  in if i >= n-1 then 0 else\n  (\n    (j_loop @@ i+1) + (i_loop @@ i+1)\n  )\n\nlet _ = Printf.printf \"%d\\n\" @@ i_loop 0", "language": "OCaml", "metadata": {"date": 1587681699, "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/s058693125.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s058693125", "user_id": "u511870776"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nlet n = read_int ()\nlet a = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\nlet dp = Array.init n (fun _ -> 0)\n\nlet rec loop i =\n  if i >= n then () else (dp.(i) <- dp.(i-1) + a.(i); loop (i+1))\n\nlet _ = dp.(0) <- a.(0); loop 1\n\nlet rec i_loop i =\n  let rec j_loop j =\n    if j >= n then 0 else\n    (if dp.(j) - dp.(i) = 0 then 1 + (j_loop @@ j+1) else j_loop @@ j+1)\n  in if i >= n-1 then 0 else\n  (\n    (j_loop @@ i+1) + (i_loop @@ i+1)\n  )\n\nlet _ = Printf.printf \"%d\\n\" @@ i_loop 0", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 508, "cpu_time_ms": 2104, "memory_kb": 18944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s457683337", "group_id": "codeNet:p03364", "input_text": "let () =\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 (2*n-1) (fun j -> s.(i mod n).[j mod n])) in\n  Array.init n (fun i ->\n      [(i, 0); (0, i)] |> List.sort_uniq compare |> List.fold_left (fun c (dx, dy) ->\n        let sym =\n          Array.init (n*n) (fun j ->\n            s.(dx + j/n).(dy + j mod n) = s.(dx + j mod n).(dy + j/n))\n          |> Array.fold_left (&&) true\n        in\n        c + if sym then n-i else 0) 0)\n  |> Array.fold_left (+) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1535127683, "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/s457683337.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s457683337", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\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 (2*n-1) (fun j -> s.(i mod n).[j mod n])) in\n  Array.init n (fun i ->\n      [(i, 0); (0, i)] |> List.sort_uniq compare |> List.fold_left (fun c (dx, dy) ->\n        let sym =\n          Array.init (n*n) (fun j ->\n            s.(dx + j/n).(dy + j mod n) = s.(dx + j mod n).(dy + j/n))\n          |> Array.fold_left (&&) true\n        in\n        c + if sym then n-i else 0) 0)\n  |> Array.fold_left (+) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 2104, "memory_kb": 13352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s029332339", "group_id": "codeNet:p03369", "input_text": "let () =\n    read_line ()\n    |> Str.split (Str.regexp \"\")\n    |> List.filter ((=) \"o\")\n    |> List.length\n    |> (( * ) 100)\n    |> (( + ) 700)\n    |> string_of_int\n    |> print_endline\n", "language": "OCaml", "metadata": {"date": 1525139949, "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/s029332339.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029332339", "user_id": "u420267469"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "let () =\n    read_line ()\n    |> Str.split (Str.regexp \"\")\n    |> List.filter ((=) \"o\")\n    |> List.length\n    |> (( * ) 100)\n    |> (( + ) 700)\n    |> string_of_int\n    |> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s802206817", "group_id": "codeNet:p03369", "input_text": "open Scanf\nopen Printf\n    \nlet ($) f x = f x\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\n\nlet rec ocaunt = function\n    [] -> 0\n  | x::xs -> if x=='o' then 1+ocaunt xs else ocaunt xs;;\n\nprintf \"%d\" $ 700 + 100 * ocaunt (string2charlist $ read_line ()) ;;\n", "language": "OCaml", "metadata": {"date": 1524933880, "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/s802206817.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802206817", "user_id": "u470717435"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "open Scanf\nopen Printf\n    \nlet ($) f x = f x\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\n\nlet rec ocaunt = function\n    [] -> 0\n  | x::xs -> if x=='o' then 1+ocaunt xs else ocaunt xs;;\n\nprintf \"%d\" $ 700 + 100 * ocaunt (string2charlist $ read_line ()) ;;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s605978857", "group_id": "codeNet:p03370", "input_text": "(* O(n) *)\nScanf.scanf \"%d %d\" @@ fun n x ->\n  let ms = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0 in\n  let x' = x - Array.fold_left (+) 0 ms in\n  n + x' / Array.fold_left min max_int ms |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1558207198, "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/s605978857.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605978857", "user_id": "u732304692"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(* O(n) *)\nScanf.scanf \"%d %d\" @@ fun n x ->\n  let ms = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0 in\n  let x' = x - Array.fold_left (+) 0 ms in\n  n + x' / Array.fold_left min max_int ms |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s892871916", "group_id": "codeNet:p03371", "input_text": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet (a,b,c,x,y) = scan \"%d %d %d %d %d\" Tuple.Tuple5.make\n\nlet () =\n  let n = min x y in\n  let m = max x y in\n  List.min [2*n*c+a*(x-n)+b*(y-n); a*x+b*y; 2*c*m]\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1586722755, "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/s892871916.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892871916", "user_id": "u802614675"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet (a,b,c,x,y) = scan \"%d %d %d %d %d\" Tuple.Tuple5.make\n\nlet () =\n  let n = min x y in\n  let m = max x y in\n  List.min [2*n*c+a*(x-n)+b*(y-n); a*x+b*y; 2*c*m]\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 670, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s236152537", "group_id": "codeNet:p03371", "input_text": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet (a,b,c,x,y) = scan \"%d %d %d %d %d\" Tuple.Tuple5.make\n\nlet () =\n  let n = min x y in\n  List.min [2*n*c+a*(x-n)+b*(y-n); a*x+b*y]\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1586722684, "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/s236152537.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s236152537", "user_id": "u802614675"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "open Batteries\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_array n m e conv =\n  let arr = Array.make_matrix n m e in\n  Enum.Labels.iter (0 --^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\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 dbg x = Printf.printf \"%s\\n\" @@ dump x; x\n\nlet (a,b,c,x,y) = scan \"%d %d %d %d %d\" Tuple.Tuple5.make\n\nlet () =\n  let n = min x y in\n  List.min [2*n*c+a*(x-n)+b*(y-n); a*x+b*y]\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 642, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s939493555", "group_id": "codeNet:p03371", "input_text": "let () =\n  let a, b, c, x, y = Scanf.scanf \"%d %d %d %d %d\" (fun a b c x y -> a, b, c, x, y) in\n  Array.init 100001 (fun x -> x)\n  |> Array.map (fun i -> a *  (max 0 (x-i)) +  b * (max 0 (y-i))  + 2 * c * i)\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1528701510, "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/s939493555.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939493555", "user_id": "u614063956"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "let () =\n  let a, b, c, x, y = Scanf.scanf \"%d %d %d %d %d\" (fun a b c x y -> a, b, c, x, y) in\n  Array.init 100001 (fun x -> x)\n  |> Array.map (fun i -> a *  (max 0 (x-i)) +  b * (max 0 (y-i))  + 2 * c * i)\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 7, "memory_kb": 3840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s417496812", "group_id": "codeNet:p03372", "input_text": "Scanf.scanf \"%d %d\" (fun n c ->\n    let xv = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x v -> x, v)) in\n    Array.sort compare xv;\n    let as1 = Array.make n 0 in\n    let as2 = Array.make n 0 in\n    let rec loop i cur mxdiff =\n        if i < n then (\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let mxdiff = max mxdiff (cur - x) in\n            as1.(i) <- mxdiff;\n            loop (i + 1) cur mxdiff\n        )\n    in\n    loop 0 0 0;\n    let rec loop i cur mxdiff =\n        if i >= 0 then (\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let mxdiff = max mxdiff (cur - (c - x)) in\n            as2.(i) <- mxdiff;\n            loop (i - 1) cur mxdiff\n        )\n    in\n    loop (n - 1) 0 0;\n\n    let rec loop i cur mx =\n        if i = n then mx else\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let cost = cur - x * 2 + (if i = n - 1 then x else as2.(i + 1)) in\n            loop (i + 1) cur (max mx cost)\n    in\n    let a1 = loop 0 0 as2.(0) in\n\n    let rec loop i cur mx =\n        if i < 0 then mx else\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let cost = cur - (c - x) * 2 + (if i = 0 then c - x else as1.(i - 1)) in\n            loop (i - 1) cur (max mx cost)\n    in\n    let a2 = loop (n - 1) 0 as1.(n - 1) in\n    Printf.printf \"%d\\n\" @@ max a1 a2\n)", "language": "OCaml", "metadata": {"date": 1590911639, "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/s417496812.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417496812", "user_id": "u342443598"}, "prompt_components": {"gold_output": "191\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n c ->\n    let xv = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x v -> x, v)) in\n    Array.sort compare xv;\n    let as1 = Array.make n 0 in\n    let as2 = Array.make n 0 in\n    let rec loop i cur mxdiff =\n        if i < n then (\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let mxdiff = max mxdiff (cur - x) in\n            as1.(i) <- mxdiff;\n            loop (i + 1) cur mxdiff\n        )\n    in\n    loop 0 0 0;\n    let rec loop i cur mxdiff =\n        if i >= 0 then (\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let mxdiff = max mxdiff (cur - (c - x)) in\n            as2.(i) <- mxdiff;\n            loop (i - 1) cur mxdiff\n        )\n    in\n    loop (n - 1) 0 0;\n\n    let rec loop i cur mx =\n        if i = n then mx else\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let cost = cur - x * 2 + (if i = n - 1 then x else as2.(i + 1)) in\n            loop (i + 1) cur (max mx cost)\n    in\n    let a1 = loop 0 0 as2.(0) in\n\n    let rec loop i cur mx =\n        if i < 0 then mx else\n            let (x, v) = xv.(i) in\n            let cur = cur + v in\n            let cost = cur - (c - x) * 2 + (if i = 0 then c - x else as1.(i - 1)) in\n            loop (i - 1) cur (max mx cost)\n    in\n    let a2 = loop (n - 1) 0 as1.(n - 1) in\n    Printf.printf \"%d\\n\" @@ max a1 a2\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 163, "memory_kb": 8448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334868914", "group_id": "codeNet:p03373", "input_text": "let a, b, c, x, y = Scanf.sscanf (read_line ()) \"%d %d %d %d %d\" @@ fun a b c x y -> (a, b, c, x, y)\n\nlet buy_a n = if c * 2 < a then n * c * 2 else n * a\nlet buy_b n = if c * 2 < b then n * c * 2 else n * b\n\nlet () = Printf.printf \"%d\\n\" @@\n  if a + b >= c * 2 then \n    2 * c * (min x y) + if x > y then buy_a (x - y) else buy_b (y - x)\n  else buy_a x + buy_b y", "language": "OCaml", "metadata": {"date": 1593873509, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03373.html", "problem_id": "p03373", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03373/input.txt", "sample_output_relpath": "derived/input_output/data/p03373/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03373/OCaml/s334868914.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334868914", "user_id": "u811309788"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "let a, b, c, x, y = Scanf.sscanf (read_line ()) \"%d %d %d %d %d\" @@ fun a b c x y -> (a, b, c, x, y)\n\nlet buy_a n = if c * 2 < a then n * c * 2 else n * a\nlet buy_b n = if c * 2 < b then n * c * 2 else n * b\n\nlet () = Printf.printf \"%d\\n\" @@\n  if a + b >= c * 2 then \n    2 * c * (min x y) + if x > y then buy_a (x - y) else buy_b (y - x)\n  else buy_a x + buy_b y", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03373", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s487168172", "group_id": "codeNet:p03377", "input_text": "let f a b x = if a <= x && x <= a+b then \"YES\" else \"NO\";;\nlet () = Scanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1561263645, "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/s487168172.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s487168172", "user_id": "u635974378"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let f a b x = if a <= x && x <= a+b then \"YES\" else \"NO\";;\nlet () = Scanf.scanf \"%d %d %d\" f\n|> Printf.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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s650052348", "group_id": "codeNet:p03377", "input_text": "let () =\nlet a, b, x = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\nPrintf.printf \"%s\\n\" (if a <= x && x <= a+b then \"YES\" else \"NO\")", "language": "OCaml", "metadata": {"date": 1559511541, "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/s650052348.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s650052348", "user_id": "u307426615"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () =\nlet a, b, x = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\nPrintf.printf \"%s\\n\" (if a <= x && x <= a+b then \"YES\" else \"NO\")", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s995542893", "group_id": "codeNet:p03377", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b x ->\n  print_endline @@\n    if a <= x && x <= a + b then \"YES\" else \"NO\"\n", "language": "OCaml", "metadata": {"date": 1530509610, "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/s995542893.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s995542893", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b x ->\n  print_endline @@\n    if a <= x && x <= a + b then \"YES\" else \"NO\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s626673256", "group_id": "codeNet:p03378", "input_text": "let n, m, x = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet a_s = Array.init m @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ans = Array.make 2 0\nlet _ =\n  for i = 0 to m - 1 do\n    if a_s.(i) < x then ans.(0) <- ans.(0) + 1\n    else ans.(1) <- ans.(1) + 1 done;\n  min ans.(0) ans.(1) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561942912, "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/s626673256.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626673256", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, m, x = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet a_s = Array.init m @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ans = Array.make 2 0\nlet _ =\n  for i = 0 to m - 1 do\n    if a_s.(i) < x then ans.(0) <- ans.(0) + 1\n    else ans.(1) <- ans.(1) + 1 done;\n  min ans.(0) ans.(1) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "sample_input": "5 3 3\n1 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03378", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s271889596", "group_id": "codeNet:p03378", "input_text": "let () =\nlet n, m, x = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\nlet lst = Array.to_list (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\nlet head = List.length (List.filter (fun a -> a < x) lst) in\nlet tail = List.length (List.filter (fun a -> a > x) lst) in\nPrintf.printf \"%d\\n\" (min head tail)", "language": "OCaml", "metadata": {"date": 1559569446, "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/s271889596.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271889596", "user_id": "u307426615"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\nlet n, m, x = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\nlet lst = Array.to_list (Array.init m (fun _ -> Scanf.scanf \"%d \" (fun x -> x))) in\nlet head = List.length (List.filter (fun a -> a < x) lst) in\nlet tail = List.length (List.filter (fun a -> a > x) lst) in\nPrintf.printf \"%d\\n\" (min head tail)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s584106939", "group_id": "codeNet:p03378", "input_text": "let () =\n  let n, m, x = Scanf.scanf \"%d %d %d\" (fun n m x -> n, m, x) in\n  let a = Array.init m (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n  let (l, r) =  Array.fold_left (fun (l, r) ai  -> if ai < x then (l+1, r) else (l, r+1)) (0,0)  a in\n  Printf.printf \"%d\\n\" (if r < l then r else l) ", "language": "OCaml", "metadata": {"date": 1528702885, "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/s584106939.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584106939", "user_id": "u614063956"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  let n, m, x = Scanf.scanf \"%d %d %d\" (fun n m x -> n, m, x) in\n  let a = Array.init m (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n  let (l, r) =  Array.fold_left (fun (l, r) ai  -> if ai < x then (l+1, r) else (l, r+1)) (0,0)  a in\n  Printf.printf \"%d\\n\" (if r < l then r else l) ", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s163709344", "group_id": "codeNet:p03379", "input_text": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n  let a' = Array.init n (fun i -> a.(i)) in\n  Array.sort (-) a';\n  let m1, m2 = a'.(n/2-1), a'.(n/2) in\n  Array.iter (fun e ->\n    Printf.printf \"%d\\n\" @@ if e <= m1 then m2 else m1) a", "language": "OCaml", "metadata": {"date": 1531254007, "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/s163709344.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s163709344", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n3\n3\n4\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n  let a' = Array.init n (fun i -> a.(i)) in\n  Array.sort (-) a';\n  let m1, m2 = a'.(n/2-1), a'.(n/2) in\n  Array.iter (fun e ->\n    Printf.printf \"%d\\n\" @@ if e <= m1 then m2 else m1) a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWhen l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.\n\nYou are given N numbers X_1, X_2, ..., X_N, where N is an even number.\nFor each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.\n\nFind B_i for each i = 1, 2, ..., N.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n1 \\leq X_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain B_i.\n\nSample Input 1\n\n4\n2 4 4 3\n\nSample Output 1\n\n4\n3\n3\n4\n\nSince the median of X_2, X_3, X_4 is 4, B_1 = 4.\n\nSince the median of X_1, X_3, X_4 is 3, B_2 = 3.\n\nSince the median of X_1, X_2, X_4 is 3, B_3 = 3.\n\nSince the median of X_1, X_2, X_3 is 4, B_4 = 4.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n2\n1\n\nSample Input 3\n\n6\n5 5 4 4 3 3\n\nSample Output 3\n\n4\n4\n4\n4\n4\n4", "sample_input": "4\n2 4 4 3\n"}, "reference_outputs": ["4\n3\n3\n4\n"], "source_document_id": "p03379", "source_text": "Score : 300 points\n\nProblem Statement\n\nWhen l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.\n\nYou are given N numbers X_1, X_2, ..., X_N, where N is an even number.\nFor each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.\n\nFind B_i for each i = 1, 2, ..., N.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n1 \\leq X_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain B_i.\n\nSample Input 1\n\n4\n2 4 4 3\n\nSample Output 1\n\n4\n3\n3\n4\n\nSince the median of X_2, X_3, X_4 is 4, B_1 = 4.\n\nSince the median of X_1, X_3, X_4 is 3, B_2 = 3.\n\nSince the median of X_1, X_2, X_4 is 3, B_3 = 3.\n\nSince the median of X_1, X_2, X_3 is 4, B_4 = 4.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n2\n1\n\nSample Input 3\n\n6\n5 5 4 4 3 3\n\nSample Output 3\n\n4\n4\n4\n4\n4\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 173, "memory_kb": 8320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s592874850", "group_id": "codeNet:p03380", "input_text": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) a;\n  let m = a.(n-1) in\n  let r = Array.fold_left (fun r e ->\n    if abs (m-2*e) < abs (m-2*r) then e else r) a.(0) a in\n  Printf.printf \"%d %d\\n\" m r", "language": "OCaml", "metadata": {"date": 1532774065, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03380.html", "problem_id": "p03380", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03380/input.txt", "sample_output_relpath": "derived/input_output/data/p03380/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03380/OCaml/s592874850.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s592874850", "user_id": "u798181098"}, "prompt_components": {"gold_output": "11 6\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) a;\n  let m = a.(n-1) in\n  let r = Array.fold_left (fun r e ->\n    if abs (m-2*e) < abs (m-2*r) then e else r) a.(0) a in\n  Printf.printf \"%d %d\\n\" m r", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "sample_input": "5\n6 9 4 2 11\n"}, "reference_outputs": ["11 6\n"], "source_document_id": "p03380", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 63, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s649518980", "group_id": "codeNet:p03385", "input_text": "let () =\n    let s = read_line () |> Str.split (Str.regexp \"\") in\n    let ans = List.fold_left (fun (a, b, c) elt ->\n            match elt with\n            | \"a\" -> (a + 1, b, c)\n            | \"b\" -> (a, b + 1, c)\n            |  _  -> (a, b, c + 1)\n        ) (0, 0, 0) s\n    in\n    if ans = (1, 1, 1) then print_endline \"Yes\"\n    else print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1524024523, "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/s649518980.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649518980", "user_id": "u420267469"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n    let s = read_line () |> Str.split (Str.regexp \"\") in\n    let ans = List.fold_left (fun (a, b, c) elt ->\n            match elt with\n            | \"a\" -> (a + 1, b, c)\n            | \"b\" -> (a, b + 1, c)\n            |  _  -> (a, b, c + 1)\n        ) (0, 0, 0) s\n    in\n    if ans = (1, 1, 1) then print_endline \"Yes\"\n    else print_endline \"No\"\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s164235468", "group_id": "codeNet:p03393", "input_text": "let s = read_line ()\nlet n = String.length s\nlet us = Array.make 26 false\nlet j = ref ~-1\nlet _ = Char.(String.(iteri (fun i c -> if n < 26 || !j = -1 then us.(code c - code 'a') <- true; if i < n - 1 && s.[i] < s.[i + 1] then j := i) s; if n = 26 && !j = -1 then (print_endline \"-1\"; exit 0); let m, t = if n < 26 then 0, s else code s.[!j] - code 'a' + 1, sub s 0 !j in for i = m to 25 do if not us.(i) then (Printf.printf \"%s%c\\n\" t (chr (i + code 'a')); exit 0) done))", "language": "OCaml", "metadata": {"date": 1582684967, "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/s164235468.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s164235468", "user_id": "u732304692"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "let s = read_line ()\nlet n = String.length s\nlet us = Array.make 26 false\nlet j = ref ~-1\nlet _ = Char.(String.(iteri (fun i c -> if n < 26 || !j = -1 then us.(code c - code 'a') <- true; if i < n - 1 && s.[i] < s.[i + 1] then j := i) s; if n = 26 && !j = -1 then (print_endline \"-1\"; exit 0); let m, t = if n < 26 then 0, s else code s.[!j] - code 'a' + 1, sub s 0 !j in for i = m to 25 do if not us.(i) then (Printf.printf \"%s%c\\n\" t (chr (i + code 'a')); exit 0) done))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "sample_input": "atcoder\n"}, "reference_outputs": ["atcoderb\n"], "source_document_id": "p03393", "source_text": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s431383072", "group_id": "codeNet:p03393", "input_text": "let rec f c s =\n  try let _ = String.index s (char_of_int c) in f (c+1) s\n  with _ -> char_of_int c\nlet _ = Scanf.scanf \"%s\" @@ fun s ->\n  let l = String.length s in\n  let rec g i = if s.[i-1] < s.[i] then i-1 else g (i-1) in\n  let rec h t c i = if i >= l then c else\n    if t >= s.[i] then h t c (i+1) else h t (min c s.[i]) (i+1) in\n  if s = \"zyxwvutsrqponmlkjihgfedcba\" then print_endline \"-1\"\n  else if l < 26 then\n    Printf.printf \"%s%c\\n\" s (f 97 s)\n  else\n    let j = g (l-1) in\n    Printf.printf \"%s%c\\n\" (String.sub s 0 j) (h s.[j] 'z' (j+1))\n", "language": "OCaml", "metadata": {"date": 1534491963, "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/s431383072.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s431383072", "user_id": "u798181098"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "let rec f c s =\n  try let _ = String.index s (char_of_int c) in f (c+1) s\n  with _ -> char_of_int c\nlet _ = Scanf.scanf \"%s\" @@ fun s ->\n  let l = String.length s in\n  let rec g i = if s.[i-1] < s.[i] then i-1 else g (i-1) in\n  let rec h t c i = if i >= l then c else\n    if t >= s.[i] then h t c (i+1) else h t (min c s.[i]) (i+1) in\n  if s = \"zyxwvutsrqponmlkjihgfedcba\" then print_endline \"-1\"\n  else if l < 26 then\n    Printf.printf \"%s%c\\n\" s (f 97 s)\n  else\n    let j = g (l-1) in\n    Printf.printf \"%s%c\\n\" (String.sub s 0 j) (h s.[j] 'z' (j+1))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "sample_input": "atcoder\n"}, "reference_outputs": ["atcoderb\n"], "source_document_id": "p03393", "source_text": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s630816308", "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 25 (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 -> Char.code s.[j])\n        |> Array.to_list\n        |> List.for_all (( <> ) (Char.code s.[i] + 1)))\n    |> (fun i -> String.sub s 0 i ^ String.make 1 (Char.chr (1 + Char.code s.[i])))\n  else \"hoge\"\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": 1531414812, "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/s630816308.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s630816308", "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 25 (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 -> Char.code s.[j])\n        |> Array.to_list\n        |> List.for_all (( <> ) (Char.code s.[i] + 1)))\n    |> (fun i -> String.sub s 0 i ^ String.make 1 (Char.chr (1 + Char.code s.[i])))\n  else \"hoge\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 746, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s148877797", "group_id": "codeNet:p03399", "input_text": "open Scanf\nopen Printf\n\nlet fare a b c d = min a b + min c d\nlet (a, b, c, d) = (read_int (), read_int (), read_int (), read_int ())\n\nlet () = printf \"%d\\n\" (fare a b c d)", "language": "OCaml", "metadata": {"date": 1595888135, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/OCaml/s148877797.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s148877797", "user_id": "u272377260"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet fare a b c d = min a b + min c d\nlet (a, b, c, d) = (read_int (), read_int (), read_int (), read_int ())\n\nlet () = printf \"%d\\n\" (fare a b c d)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 8, "memory_kb": 3680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s402629481", "group_id": "codeNet:p03399", "input_text": "let () =\n  Scanf.scanf \"%d %d %d %d\" (fun a b c d -> min a b + min c d)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531253867, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/OCaml/s402629481.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s402629481", "user_id": "u798181098"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d %d\" (fun a b c d -> min a b + min c d)\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 97, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s314249343", "group_id": "codeNet:p03399", "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 \"%d\\n\" @@ (min a b) + (min c d)", "language": "OCaml", "metadata": {"date": 1527664610, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/OCaml/s314249343.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314249343", "user_id": "u139013163"}, "prompt_components": {"gold_output": "520\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 \"%d\\n\" @@ (min a b) + (min c d)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 133, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s816277101", "group_id": "codeNet:p03400", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let d,x = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n  let a_lst = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n\n  let l = List.map (fun a -> 1+ (d-1) / a) a_lst in\n  let sum = List.fold_left (+) 0 l in\n\n  Printf.printf \"%d\\n\" @@ sum + x\n", "language": "OCaml", "metadata": {"date": 1529578819, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s816277101.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816277101", "user_id": "u139013163"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let d,x = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n  let a_lst = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n\n  let l = List.map (fun a -> 1+ (d-1) / a) a_lst in\n  let sum = List.fold_left (+) 0 l in\n\n  Printf.printf \"%d\\n\" @@ sum + x\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s398550610", "group_id": "codeNet:p03400", "input_text": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet d, x = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\n\nlet eat freq =\n  let rec aux day sum =\n    if d < day then sum else aux (day + freq) (sum + 1)\n  in\n  aux 1 0\n\nlet solve n = \n  let rec aux i sum =\n    if i = 0 then sum\n    else aux (i - 1) (sum + eat (Scanf.scanf \"%d\\n\" id))\n  in\n  aux n 0\n\nlet () = solve n |> (+) x |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1523140014, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s398550610.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s398550610", "user_id": "u987869509"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet d, x = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\n\nlet eat freq =\n  let rec aux day sum =\n    if d < day then sum else aux (day + freq) (sum + 1)\n  in\n  aux 1 0\n\nlet solve n = \n  let rec aux i sum =\n    if i = 0 then sum\n    else aux (i - 1) (sum + eat (Scanf.scanf \"%d\\n\" id))\n  in\n  aux n 0\n\nlet () = solve n |> (+) x |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s298465985", "group_id": "codeNet:p03401", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet s = Array.fold_left (fun (s, p) a -> s + abs (p - a), a) (abs a_s.(n - 1), 0) a_s |> fst\nlet f i = if i < 0 || i = n then 0 else a_s.(i)\nlet g i = s - abs (f (i - 1) - f i) - abs (f i - f (i + 1)) + abs (f (i - 1) - f (i + 1))\nlet _ = Array.iteri (fun i a -> Printf.printf \"%d\\n\" @@ g i) a_s", "language": "OCaml", "metadata": {"date": 1570461554, "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/s298465985.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s298465985", "user_id": "u732304692"}, "prompt_components": {"gold_output": "12\n8\n10\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 (fun (s, p) a -> s + abs (p - a), a) (abs a_s.(n - 1), 0) a_s |> fst\nlet f i = if i < 0 || i = n then 0 else a_s.(i)\nlet g i = s - abs (f (i - 1) - f i) - abs (f i - f (i + 1)) + abs (f (i - 1) - f (i + 1))\nlet _ = Array.iteri (fun i a -> Printf.printf \"%d\\n\" @@ g i) a_s", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (1 \\leq i \\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "sample_input": "3\n3 5 -1\n"}, "reference_outputs": ["12\n8\n10\n"], "source_document_id": "p03401", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (1 \\leq i \\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 386, "cpu_time_ms": 53, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s288471750", "group_id": "codeNet:p03407", "input_text": "let () =\n  let a, b, c = Scanf.scanf \"%d %d %d \" (fun a b c -> a, b, c) in\n  print_endline (if (a + b < c) then \"No\" else \"Yes\")", "language": "OCaml", "metadata": {"date": 1526171288, "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/s288471750.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288471750", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let a, b, c = Scanf.scanf \"%d %d %d \" (fun a b c -> a, b, c) in\n  print_endline (if (a + b < c) then \"No\" else \"Yes\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s626561319", "group_id": "codeNet:p03408", "input_text": "(* O(k^2) (k = max n m) *)\nScanf.scanf \" %d\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s in\n  let m = Scanf.scanf \" %d\" @@ (+) 0 in\n  let ts = Array.init m @@ fun _ -> Scanf.scanf \" %s\" @@ fun t -> t in\n  let ans = ref 0 in\n  for i = 0 to n - 1 do\n    let c = ref 0 in\n    let s = ss.(i) in\n    for j = 0 to n - 1 do\n      if s = ss.(j) then incr c\n    done;\n    for j = 0 to m - 1 do\n      if s = ts.(j) then decr c\n    done;\n    ans := max !ans !c\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1559217036, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03408.html", "problem_id": "p03408", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03408/input.txt", "sample_output_relpath": "derived/input_output/data/p03408/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03408/OCaml/s626561319.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626561319", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(k^2) (k = max n m) *)\nScanf.scanf \" %d\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s in\n  let m = Scanf.scanf \" %d\" @@ (+) 0 in\n  let ts = Array.init m @@ fun _ -> Scanf.scanf \" %s\" @@ fun t -> t in\n  let ans = ref 0 in\n  for i = 0 to n - 1 do\n    let c = ref 0 in\n    let s = ss.(i) in\n    for j = 0 to n - 1 do\n      if s = ss.(j) then incr c\n    done;\n    for j = 0 to m - 1 do\n      if s = ts.(j) then decr c\n    done;\n    ans := max !ans !c\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N blue cards and M red cards.\nA string is written on each card. The string written on the i-th blue card is s_i, and the string written on the i-th red card is t_i.\n\nTakahashi will now announce a string, and then check every card. Each time he finds a blue card with the string announced by him, he will earn 1 yen (the currency of Japan); each time he finds a red card with that string, he will lose 1 yen.\n\nHere, we only consider the case where the string announced by Takahashi and the string on the card are exactly the same. For example, if he announces atcoder, he will not earn money even if there are blue cards with atcoderr, atcode, btcoder, and so on. (On the other hand, he will not lose money even if there are red cards with such strings, either.)\n\nAt most how much can he earn on balance?\n\nNote that the same string may be written on multiple cards.\n\nConstraints\n\nN and M are integers.\n\n1 \\leq N, M \\leq 100\n\ns_1, s_2, ..., s_N, t_1, t_2, ..., t_M are all strings of lengths between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\nM\nt_1\nt_2\n:\nt_M\n\nOutput\n\nIf Takahashi can earn at most X yen on balance, print X.\n\nSample Input 1\n\n3\napple\norange\napple\n1\ngrape\n\nSample Output 1\n\n2\n\nHe can earn 2 yen by announcing apple.\n\nSample Input 2\n\n3\napple\norange\napple\n5\napple\napple\napple\napple\napple\n\nSample Output 2\n\n1\n\nIf he announces apple, he will lose 3 yen. If he announces orange, he can earn 1 yen.\n\nSample Input 3\n\n1\nvoldemort\n10\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\n\nSample Output 3\n\n0\n\nIf he announces voldemort, he will lose 9 yen. If he announces orange, for example, he can avoid losing a yen.\n\nSample Input 4\n\n6\nred\nred\nblue\nyellow\nyellow\nred\n5\nred\nred\nyellow\ngreen\nblue\n\nSample Output 4\n\n1", "sample_input": "3\napple\norange\napple\n1\ngrape\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03408", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N blue cards and M red cards.\nA string is written on each card. The string written on the i-th blue card is s_i, and the string written on the i-th red card is t_i.\n\nTakahashi will now announce a string, and then check every card. Each time he finds a blue card with the string announced by him, he will earn 1 yen (the currency of Japan); each time he finds a red card with that string, he will lose 1 yen.\n\nHere, we only consider the case where the string announced by Takahashi and the string on the card are exactly the same. For example, if he announces atcoder, he will not earn money even if there are blue cards with atcoderr, atcode, btcoder, and so on. (On the other hand, he will not lose money even if there are red cards with such strings, either.)\n\nAt most how much can he earn on balance?\n\nNote that the same string may be written on multiple cards.\n\nConstraints\n\nN and M are integers.\n\n1 \\leq N, M \\leq 100\n\ns_1, s_2, ..., s_N, t_1, t_2, ..., t_M are all strings of lengths between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\nM\nt_1\nt_2\n:\nt_M\n\nOutput\n\nIf Takahashi can earn at most X yen on balance, print X.\n\nSample Input 1\n\n3\napple\norange\napple\n1\ngrape\n\nSample Output 1\n\n2\n\nHe can earn 2 yen by announcing apple.\n\nSample Input 2\n\n3\napple\norange\napple\n5\napple\napple\napple\napple\napple\n\nSample Output 2\n\n1\n\nIf he announces apple, he will lose 3 yen. If he announces orange, he can earn 1 yen.\n\nSample Input 3\n\n1\nvoldemort\n10\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\n\nSample Output 3\n\n0\n\nIf he announces voldemort, he will lose 9 yen. If he announces orange, for example, he can avoid losing a yen.\n\nSample Input 4\n\n6\nred\nred\nblue\nyellow\nyellow\nred\n5\nred\nred\nyellow\ngreen\nblue\n\nSample Output 4\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 521, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s057048648", "group_id": "codeNet:p03416", "input_text": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f n = let s = string_of_int n in s.[0] = s.[4] && s.[1] = s.[3]\nlet ans = ref 0\nlet _ = for i = a to b do if f i then incr ans done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1563948639, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03416.html", "problem_id": "p03416", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03416/input.txt", "sample_output_relpath": "derived/input_output/data/p03416/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03416/OCaml/s057048648.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s057048648", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f n = let s = string_of_int n in s.[0] = s.[4] && s.[1] = s.[3]\nlet ans = ref 0\nlet _ = for i = a to b do if f i then incr ans done; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "sample_input": "11009 11332\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03416", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 15, "memory_kb": 1792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s001142919", "group_id": "codeNet:p03416", "input_text": "(* O(b log b) *)\nScanf.scanf \"%d %d\" @@ fun a b ->\n  let string_rev s = let n = String.length s in String.init n @@ fun i -> s.[n - i - 1] in\n  let ans = ref 0 in\n  for n = a to b do\n    let s = string_of_int n in\n    if string_rev s = s then incr ans\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1558563527, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03416.html", "problem_id": "p03416", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03416/input.txt", "sample_output_relpath": "derived/input_output/data/p03416/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03416/OCaml/s001142919.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s001142919", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(* O(b log b) *)\nScanf.scanf \"%d %d\" @@ fun a b ->\n  let string_rev s = let n = String.length s in String.init n @@ fun i -> s.[n - i - 1] in\n  let ans = ref 0 in\n  for n = a to b do\n    let s = string_of_int n in\n    if string_rev s = s then incr ans\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "sample_input": "11009 11332\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03416", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 287, "cpu_time_ms": 18, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s424908050", "group_id": "codeNet:p03417", "input_text": "let () =\n    let answer = Scanf.scanf \"%d %d\" (fun n m ->\n        match n, m with\n        | 1, 1 -> 1\n        | 1, _ -> m - 2\n        | _, 1 -> n - 2\n        | _, _ -> (n - 2) * (m - 2)\n    )\n    in Printf.printf \"%d\\n\" answer\n", "language": "OCaml", "metadata": {"date": 1520819395, "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/s424908050.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424908050", "user_id": "u420267469"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let () =\n    let answer = Scanf.scanf \"%d %d\" (fun n m ->\n        match n, m with\n        | 1, 1 -> 1\n        | 1, _ -> m - 2\n        | _, 1 -> n - 2\n        | _, _ -> (n - 2) * (m - 2)\n    )\n    in Printf.printf \"%d\\n\" answer\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03417", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s047193887", "group_id": "codeNet:p03419", "input_text": "let m, n = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun m n -> (m, n)\n\nlet () = Printf.printf \"%d\\n\" @@\n  match m, n with \n    | 1, 1 -> 1\n    | 1, a | a, 1 -> a - 2\n    | n, m -> (n - 2) * (m - 2)\n  ", "language": "OCaml", "metadata": {"date": 1593912681, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03419.html", "problem_id": "p03419", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03419/input.txt", "sample_output_relpath": "derived/input_output/data/p03419/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03419/OCaml/s047193887.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s047193887", "user_id": "u811309788"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let m, n = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun m n -> (m, n)\n\nlet () = Printf.printf \"%d\\n\" @@\n  match m, n with \n    | 1, 1 -> 1\n    | 1, a | a, 1 -> a - 2\n    | n, m -> (n - 2) * (m - 2)\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": "p03419", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s731675947", "group_id": "codeNet:p03420", "input_text": "let () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" (fun n k ->\n  Array.init n (( + ) 1)\n  |> Array.map (fun b ->\n      max 0 (b - k) * (n / b)\n    + min (n mod b) (max 0 (n mod b - k + 1)))\n  |> Array.fold_left ( + ) 0)", "language": "OCaml", "metadata": {"date": 1520818689, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03420.html", "problem_id": "p03420", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03420/input.txt", "sample_output_relpath": "derived/input_output/data/p03420/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03420/OCaml/s731675947.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731675947", "user_id": "u504158101"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" (fun n k ->\n  Array.init n (( + ) 1)\n  |> Array.map (fun b ->\n      max 0 (b - k) * (n / b)\n    + min (n mod b) (max 0 (n mod b - k + 1)))\n  |> Array.fold_left ( + ) 0)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "sample_input": "5 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03420", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 11, "memory_kb": 3968}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s120827595", "group_id": "codeNet:p03423", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  Printf.printf \"%d\\n\" (n/3);\n", "language": "OCaml", "metadata": {"date": 1528700746, "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/s120827595.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s120827595", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  Printf.printf \"%d\\n\" (n/3);\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "sample_input": "8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03423", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s017950101", "group_id": "codeNet:p03423", "input_text": "let () = read_int () / 3 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1523237995, "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/s017950101.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s017950101", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = read_int () / 3 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "sample_input": "8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03423", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 48, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751103653", "group_id": "codeNet:p03424", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet ss = Array.init n @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet _ = Array.iter (fun s -> if s = 'Y' then (print_endline \"Four\"; exit 0)) ss; print_endline \"Three\"", "language": "OCaml", "metadata": {"date": 1564655724, "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/s751103653.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751103653", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet ss = Array.init n @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet _ = Array.iter (fun s -> if s = 'Y' then (print_endline \"Four\"; exit 0)) ss; print_endline \"Three\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s508576183", "group_id": "codeNet:p03424", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet ss = Array.to_list @@ Array.init n @@ fun _ -> Scanf.scanf \" %c\" (=) 'Y'\nlet _ = print_endline @@ if List.mem true ss then \"Four\" else \"Three\"", "language": "OCaml", "metadata": {"date": 1561980949, "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/s508576183.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s508576183", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet ss = Array.to_list @@ Array.init n @@ fun _ -> Scanf.scanf \" %c\" (=) 'Y'\nlet _ = print_endline @@ if List.mem true ss then \"Four\" else \"Three\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 178, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s282708550", "group_id": "codeNet:p03424", "input_text": "let n = Scanf.scanf \" %d\" @@ (+) 0\nlet ss = Array.init n @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet _ =\n  for i = 0 to n - 1 do if ss.(i) = 'Y' then (print_endline \"Four\"; exit 0) done;\n  print_endline \"Three\"", "language": "OCaml", "metadata": {"date": 1561979063, "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/s282708550.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s282708550", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" @@ (+) 0\nlet ss = Array.init n @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet _ =\n  for i = 0 to n - 1 do if ss.(i) = 'Y' then (print_endline \"Four\"; exit 0) done;\n  print_endline \"Three\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s116325935", "group_id": "codeNet:p03425", "input_text": "open Batteries;;\n  \nlet rec combination n r =\n  if n = r || r = 0 then 1\n  else (combination n (r - 1)) * (n - r + 1) / r\n;;\n  \nlet () =\n  let n = read_int () in\n  let l = Array.to_list @@\n      Array.init n\n                 (fun _ -> read_line ()) in\n  let lhd = List.map (fun x -> String.get x 0) l in\n  let m = List.length @@ List.filter (fun x -> 'M'=x) lhd in\n  let a = List.length @@ List.filter (fun x -> 'A'=x) lhd in \n  let r = List.length @@ List.filter (fun x -> 'R'=x) lhd in\n  let c = List.length @@ List.filter (fun x -> 'C'=x) lhd in\n  let h = List.length @@ List.filter (fun x -> 'H'=x) lhd in\n  let x = List.length (List.filter (fun x -> x<>0) [m;a;r;c;h]) in\n  let ans = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h\n            + a*r*c + a*r*h + a*c*h\n            + r*c*h in\n          \n  let mc = combination m 1 in\n  let ac = combination a 1 in\n  let rc = combination r 1 in\n  let cc = combination c 1 in\n  let hc = combination h 1 in\n  print_int ans\n;;\n\n", "language": "OCaml", "metadata": {"date": 1520219788, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03425.html", "problem_id": "p03425", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03425/input.txt", "sample_output_relpath": "derived/input_output/data/p03425/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03425/OCaml/s116325935.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116325935", "user_id": "u161156777"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries;;\n  \nlet rec combination n r =\n  if n = r || r = 0 then 1\n  else (combination n (r - 1)) * (n - r + 1) / r\n;;\n  \nlet () =\n  let n = read_int () in\n  let l = Array.to_list @@\n      Array.init n\n                 (fun _ -> read_line ()) in\n  let lhd = List.map (fun x -> String.get x 0) l in\n  let m = List.length @@ List.filter (fun x -> 'M'=x) lhd in\n  let a = List.length @@ List.filter (fun x -> 'A'=x) lhd in \n  let r = List.length @@ List.filter (fun x -> 'R'=x) lhd in\n  let c = List.length @@ List.filter (fun x -> 'C'=x) lhd in\n  let h = List.length @@ List.filter (fun x -> 'H'=x) lhd in\n  let x = List.length (List.filter (fun x -> x<>0) [m;a;r;c;h]) in\n  let ans = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h\n            + a*r*c + a*r*h + a*c*h\n            + r*c*h in\n          \n  let mc = combination m 1 in\n  let ac = combination a 1 in\n  let rc = combination r 1 in\n  let cc = combination c 1 in\n  let hc = combination h 1 in\n  print_int ans\n;;\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "sample_input": "5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03425", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 975, "cpu_time_ms": 30, "memory_kb": 11648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s271753164", "group_id": "codeNet:p03427", "input_text": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%s\" @@ fun s ->\n  let t = Array.init (String.length s) (fun i -> s.[i]) in\n  let x = Array.fold_left (fun z c -> z + (int_of_char c - 48) mod 10) 0 t in\n  (int_of_char s.[0] - 49) + (9 * (String.length s - 1)) |> max x", "language": "OCaml", "metadata": {"date": 1534487289, "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/s271753164.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271753164", "user_id": "u798181098"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%s\" @@ fun s ->\n  let t = Array.init (String.length s) (fun i -> s.[i]) in\n  let x = Array.fold_left (fun z c -> z + (int_of_char c - 48) mod 10) 0 t in\n  (int_of_char s.[0] - 49) + (9 * (String.length s - 1)) |> max x", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s495541940", "group_id": "codeNet:p03428", "input_text": "let () = 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 convex =\n    Array.of_list @@\n    let h, t =\n      match\n        Array.fold_left (fun stack (x, y, i) ->\n          let rec drop = 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 rest in (x, y, i) :: drop stack) [] xys\n      with\n      | [] -> [], []\n      | h :: t -> [h], t in\n    Array.fold_right (fun (x, y, i) stack ->\n      let rec drop = 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 rest in (x, y, i) :: drop stack) (Array.sub xys 0 (n - 1)) h @ t in\n  let convex = Array.sub convex 0 (Array.length convex - 1) 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": 1537334220, "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/s495541940.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s495541940", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0.5\n0.5\n", "input_to_evaluate": "let () = 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 convex =\n    Array.of_list @@\n    let h, t =\n      match\n        Array.fold_left (fun stack (x, y, i) ->\n          let rec drop = 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 rest in (x, y, i) :: drop stack) [] xys\n      with\n      | [] -> [], []\n      | h :: t -> [h], t in\n    Array.fold_right (fun (x, y, i) stack ->\n      let rec drop = 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 rest in (x, y, i) :: drop stack) (Array.sub xys 0 (n - 1)) h @ t in\n  let convex = Array.sub convex 0 (Array.length convex - 1) 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1644, "cpu_time_ms": 6, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s280377335", "group_id": "codeNet:p03433", "input_text": "let () =\n  let (n, a) = Scanf.scanf \"%d %d\" (fun x y -> (x, y)) in\n  let remainder = n mod 500 in\n  let ans = if remainder < a\n            then \"Yes\"\n            else \"No\" in\n  Printf.printf \"%s\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1592110243, "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/s280377335.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s280377335", "user_id": "u589100520"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let (n, a) = Scanf.scanf \"%d %d\" (fun x y -> (x, y)) in\n  let remainder = n mod 500 in\n  let ans = if remainder < a\n            then \"Yes\"\n            else \"No\" in\n  Printf.printf \"%s\\n\" ans\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s504296093", "group_id": "codeNet:p03433", "input_text": "let n = read_int ()\nlet a = read_int ()\nlet _ = (if n mod 500 > a then \"No\" else \"Yes\") |> print_endline", "language": "OCaml", "metadata": {"date": 1584054471, "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/s504296093.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s504296093", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n = read_int ()\nlet a = read_int ()\nlet _ = (if n mod 500 > a then \"No\" else \"Yes\") |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s340679055", "group_id": "codeNet:p03433", "input_text": "open Printf\nopen Scanf\n\nlet solve n a =\n  let r = n mod 500 in\n  if r <= a then \"Yes\" else \"No\"\n  \nlet () =\n  scanf \"%d %d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582745106, "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/s340679055.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340679055", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve n a =\n  let r = n mod 500 in\n  if r <= a then \"Yes\" else \"No\"\n  \nlet () =\n  scanf \"%d %d \" solve |> printf \"%s\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s903717856", "group_id": "codeNet:p03434", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ss = Array.make 2 0\nlet _ = Array.sort (fun x y -> y - x) a_s;\n  Array.iteri (fun i a -> ss.(i mod 2) <- ss.(i mod 2) + a) a_s;\n  Printf.printf \"%d\\n\" @@ ss.(0) - ss.(1)", "language": "OCaml", "metadata": {"date": 1562771583, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03434.html", "problem_id": "p03434", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03434/input.txt", "sample_output_relpath": "derived/input_output/data/p03434/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03434/OCaml/s903717856.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s903717856", "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 ss = Array.make 2 0\nlet _ = Array.sort (fun x y -> y - x) a_s;\n  Array.iteri (fun i a -> ss.(i mod 2) <- ss.(i mod 2) + a) a_s;\n  Printf.printf \"%d\\n\" @@ ss.(0) - ss.(1)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have N cards. A number a_i is written on the i-th card.\n\nAlice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first.\n\nThe game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\na_i \\ (1 \\leq i \\leq N) is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint Alice's score minus Bob's score when both players take the optimal strategy to maximize their scores.\n\nSample Input 1\n\n2\n3 1\n\nSample Output 1\n\n2\n\nFirst, Alice will take the card with 3. Then, Bob will take the card with 1.\nThe difference of their scores will be 3 - 1 = 2.\n\nSample Input 2\n\n3\n2 7 4\n\nSample Output 2\n\n5\n\nFirst, Alice will take the card with 7. Then, Bob will take the card with 4. Lastly, Alice will take the card with 2. The difference of their scores will be 7 - 4 + 2 = 5. The difference of their scores will be 3 - 1 = 2.\n\nSample Input 3\n\n4\n20 18 2 18\n\nSample Output 3\n\n18", "sample_input": "2\n3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03434", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have N cards. A number a_i is written on the i-th card.\n\nAlice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first.\n\nThe game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\na_i \\ (1 \\leq i \\leq N) is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint Alice's score minus Bob's score when both players take the optimal strategy to maximize their scores.\n\nSample Input 1\n\n2\n3 1\n\nSample Output 1\n\n2\n\nFirst, Alice will take the card with 3. Then, Bob will take the card with 1.\nThe difference of their scores will be 3 - 1 = 2.\n\nSample Input 2\n\n3\n2 7 4\n\nSample Output 2\n\n5\n\nFirst, Alice will take the card with 7. Then, Bob will take the card with 4. Lastly, Alice will take the card with 2. The difference of their scores will be 7 - 4 + 2 = 5. The difference of their scores will be 3 - 1 = 2.\n\nSample Input 3\n\n4\n20 18 2 18\n\nSample Output 3\n\n18", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s871331703", "group_id": "codeNet:p03436", "input_text": "(* O(h w) *)\nlet h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet b = ref 0\nlet sss = Array.init h @@ fun _ ->\n  Array.init w @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> if c = '#' then incr b; c\nlet ds = Array.make_matrix h w @@ -1\nlet _ =\n  let q = Queue.create () in\n  ds.(0).(0) <- 0;\n  Queue.push (0, 0) q;\n  while not @@ Queue.is_empty q do\n    let y0, x0 = Queue.pop q in\n    let f (dy, dx) =\n      let y, x = y0 + dy, x0 + dx in\n      if 0 <= y && y < h && 0 <= x && x < w && ds.(y).(x) = -1 && sss.(y).(x) <> '#' then\n        (ds.(y).(x) <- ds.(y0).(x0) + 1;\n        Queue.push (y, x) q) in\n    List.iter f [0, -1; -1, 0; 0, 1; 1, 0]\n  done;\n  let g = ds.(h - 1).(w - 1) in\n  Printf.printf \"%d\\n\" @@ if g = -1 then -1 else h * w - !b - g - 1", "language": "OCaml", "metadata": {"date": 1560247775, "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/s871331703.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s871331703", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(h w) *)\nlet h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet b = ref 0\nlet sss = Array.init h @@ fun _ ->\n  Array.init w @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> if c = '#' then incr b; c\nlet ds = Array.make_matrix h w @@ -1\nlet _ =\n  let q = Queue.create () in\n  ds.(0).(0) <- 0;\n  Queue.push (0, 0) q;\n  while not @@ Queue.is_empty q do\n    let y0, x0 = Queue.pop q in\n    let f (dy, dx) =\n      let y, x = y0 + dy, x0 + dx in\n      if 0 <= y && y < h && 0 <= x && x < w && ds.(y).(x) = -1 && sss.(y).(x) <> '#' then\n        (ds.(y).(x) <- ds.(y0).(x0) + 1;\n        Queue.push (y, x) q) in\n    List.iter f [0, -1; -1, 0; 0, 1; 1, 0]\n  done;\n  let g = ds.(h - 1).(w - 1) in\n  Printf.printf \"%d\\n\" @@ if g = -1 then -1 else h * w - !b - g - 1", "problem_context": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1}s_{1, 2}s_{1, 3} ... s_{1, W}\ns_{2, 1}s_{2, 2}s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1}s_{H, 2}s_{H, 3} ... s_{H, W}\n\nOutput\n\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "sample_input": "3 3\n..#\n#..\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03436", "source_text": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1}s_{1, 2}s_{1, 3} ... s_{1, W}\ns_{2, 1}s_{2, 2}s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1}s_{H, 2}s_{H, 3} ... s_{H, W}\n\nOutput\n\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 2, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s744171963", "group_id": "codeNet:p03437", "input_text": "Scanf.scanf \"%d %d\" (fun x y ->\n    Printf.printf \"%d\\n\" @@ if x mod y = 0 then -1 else x\n)", "language": "OCaml", "metadata": {"date": 1594345940, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s744171963.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744171963", "user_id": "u342443598"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun x y ->\n    Printf.printf \"%d\\n\" @@ if x mod y = 0 then -1 else x\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 91, "cpu_time_ms": 7, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s453274472", "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": 1517734787, "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/s453274472.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s453274472", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s002447800", "group_id": "codeNet:p03447", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun x a b ->\n  Printf.printf \"%d\\n\" @@ (x - a) mod b", "language": "OCaml", "metadata": {"date": 1530565699, "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/s002447800.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s002447800", "user_id": "u504158101"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun x a b ->\n  Printf.printf \"%d\\n\" @@ (x - a) mod b", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s404496748", "group_id": "codeNet:p03449", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_ss = Array.init 2 @@ fun _ -> Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 1 do\n    let sum = ref 0 in\n    for j = 0 to i do sum := !sum + a_ss.(0).(j) done;\n    for j = i to n - 1 do sum := !sum + a_ss.(1).(j) done;\n    ans := max !ans !sum done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562936688, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03449.html", "problem_id": "p03449", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03449/input.txt", "sample_output_relpath": "derived/input_output/data/p03449/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03449/OCaml/s404496748.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404496748", "user_id": "u732304692"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_ss = Array.init 2 @@ fun _ -> Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 1 do\n    let sum = ref 0 in\n    for j = 0 to i do sum := !sum + a_ss.(0).(j) done;\n    for j = i to n - 1 do sum := !sum + a_ss.(1).(j) done;\n    ans := max !ans !sum done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "sample_input": "5\n3 2 2 4 1\n1 2 2 2 1\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03449", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 360, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s145150621", "group_id": "codeNet:p03449", "input_text": "let get_input () =\n    read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet () =\n    let _ = read_int () in\n    let upper = get_input () in\n    let lower = get_input () in\n    List.fold_left2 (fun (usum, lsum) uelem lelem ->\n        (usum + uelem, max (lsum + lelem) (usum + uelem + lelem))\n    ) (0, 0) upper lower\n    |> (fun (x, y) -> max x y)\n    |> string_of_int\n    |> print_endline\n", "language": "OCaml", "metadata": {"date": 1520305025, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03449.html", "problem_id": "p03449", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03449/input.txt", "sample_output_relpath": "derived/input_output/data/p03449/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03449/OCaml/s145150621.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s145150621", "user_id": "u420267469"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "let get_input () =\n    read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet () =\n    let _ = read_int () in\n    let upper = get_input () in\n    let lower = get_input () in\n    List.fold_left2 (fun (usum, lsum) uelem lelem ->\n        (usum + uelem, max (lsum + lelem) (usum + uelem + lelem))\n    ) (0, 0) upper lower\n    |> (fun (x, y) -> max x y)\n    |> string_of_int\n    |> print_endline\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "sample_input": "5\n3 2 2 4 1\n1 2 2 2 1\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03449", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 410, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s917448482", "group_id": "codeNet:p03449", "input_text": "\nopen Scanf\nopen Printf\n\nlet rec for_iter a b f = if a >= b then () else (f a; for_iter (a+1) b f)\nlet rec for_iterr a b f = if a <= b then () else (f a; for_iter (a-1) b f)\nlet rec for_iters a b s f = if (a-b >= 0) <> (s >= 0) then () else (f a; for_iter (a+s) b f)\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)\nlet read_ints_arr n = Array.init n (fun _ -> read_int ())\nlet read_ints_arr_ref n = Array.init n (fun _ -> ref (read_int ()))\n\nlet accum xs =\n  let rec f ys ac =\n    match ys with\n    | [] -> []\n    | (y::ys') -> (y+ac) :: f ys' (y+ac)\n  in f xs 0\n\nlet () =\n  let n = read_int () in\n  let x0 = read_ints n |> accum in\n  let x1 = read_ints n |> List.rev |> accum |> List.rev in\n  let ans = List.fold_left2 (fun c a b -> max c (a+b)) 0 x0 x1 in\n  printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1519033665, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03449.html", "problem_id": "p03449", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03449/input.txt", "sample_output_relpath": "derived/input_output/data/p03449/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03449/OCaml/s917448482.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s917448482", "user_id": "u798181098"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet rec for_iter a b f = if a >= b then () else (f a; for_iter (a+1) b f)\nlet rec for_iterr a b f = if a <= b then () else (f a; for_iter (a-1) b f)\nlet rec for_iters a b s f = if (a-b >= 0) <> (s >= 0) then () else (f a; for_iter (a+s) b f)\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)\nlet read_ints_arr n = Array.init n (fun _ -> read_int ())\nlet read_ints_arr_ref n = Array.init n (fun _ -> ref (read_int ()))\n\nlet accum xs =\n  let rec f ys ac =\n    match ys with\n    | [] -> []\n    | (y::ys') -> (y+ac) :: f ys' (y+ac)\n  in f xs 0\n\nlet () =\n  let n = read_int () in\n  let x0 = read_ints n |> accum in\n  let x1 = read_ints n |> List.rev |> accum |> List.rev in\n  let ans = List.fold_left2 (fun c a b -> max c (a+b)) 0 x0 x1 in\n  printf \"%d\\n\" ans\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "sample_input": "5\n3 2 2 4 1\n1 2 2 2 1\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03449", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 862, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s243869398", "group_id": "codeNet:p03456", "input_text": "let cat a b = float_of_string (a ^ b)\n\nlet is_square n =\n  let root = sqrt n |> floor in n = (root ** 2.)\n\nlet p b = (if b then \"Yes\" else \"No\") |> print_endline\n\nlet () =\n  Scanf.scanf \"%s %s\" cat |> is_square |> p", "language": "OCaml", "metadata": {"date": 1523486910, "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/s243869398.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s243869398", "user_id": "u987869509"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let cat a b = float_of_string (a ^ b)\n\nlet is_square n =\n  let root = sqrt n |> floor in n = (root ** 2.)\n\nlet p b = (if b then \"Yes\" else \"No\") |> print_endline\n\nlet () =\n  Scanf.scanf \"%s %s\" cat |> is_square |> p", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s602591334", "group_id": "codeNet:p03457", "input_text": "open Core\n\nlet n = Scanf.scanf \"%d\" ident\n\nlet plans =\n  List.init n (fun _ -> Scanf.scanf \" %d %d %d\" (fun t x y -> (t, x, y)))\n  |> List.rev\n\nlet reachable np p =\n  let nt, nx, ny = np in\n  let t, x, y = p in\n  let d1 = abs (nx - x) + abs (ny - y) in\n  let dt = nt - t in\n  if d1 <= dt && d1 mod 2 = dt mod 2 then true else false\n\nlet rec solve p = function\n  | [] ->\n      true\n  | np :: rest ->\n      if reachable np p then solve np rest else false\n\nlet str = if solve (0, 0, 0) plans then \"Yes\" else \"No\"\n\nlet () = print_endline str\n", "language": "OCaml", "metadata": {"date": 1592670600, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s602591334.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602591334", "user_id": "u573744781"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Core\n\nlet n = Scanf.scanf \"%d\" ident\n\nlet plans =\n  List.init n (fun _ -> Scanf.scanf \" %d %d %d\" (fun t x y -> (t, x, y)))\n  |> List.rev\n\nlet reachable np p =\n  let nt, nx, ny = np in\n  let t, x, y = p in\n  let d1 = abs (nx - x) + abs (ny - y) in\n  let dt = nt - t in\n  if d1 <= dt && d1 mod 2 = dt mod 2 then true else false\n\nlet rec solve p = function\n  | [] ->\n      true\n  | np :: rest ->\n      if reachable np p then solve np rest else false\n\nlet str = if solve (0, 0, 0) plans then \"Yes\" else \"No\"\n\nlet () = print_endline str\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "sample_input": "2\n3 1 2\n6 1 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03457", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 538, "cpu_time_ms": 73, "memory_kb": 21752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s171411519", "group_id": "codeNet:p03457", "input_text": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet ls =\n  let rec aux n tmp =\n    if n = 0 then List.rev tmp\n    else\n      let line = Scanf.scanf \"%d %d %d\\n\" (fun t x y -> (t, x, y)) in\n      aux (n - 1) (line :: tmp)\n  in\n  aux n [(0, 0, 0)]\n\n\nlet rec solve = function\n  | [] | [_] -> \"Yes\"\n  | pre :: now :: t ->\n    let pt, px, py = pre and nt, nx, ny = now in\n    let dift = nt - pt and difd = abs (nx - px) + abs (ny - py) in\n    if difd <= dift && (dift + difd) mod 2 = 0 then solve (now :: t)\n    else \"No\"\n\n\nlet () = solve ls |> print_endline", "language": "OCaml", "metadata": {"date": 1523502218, "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/s171411519.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171411519", "user_id": "u987869509"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet ls =\n  let rec aux n tmp =\n    if n = 0 then List.rev tmp\n    else\n      let line = Scanf.scanf \"%d %d %d\\n\" (fun t x y -> (t, x, y)) in\n      aux (n - 1) (line :: tmp)\n  in\n  aux n [(0, 0, 0)]\n\n\nlet rec solve = function\n  | [] | [_] -> \"Yes\"\n  | pre :: now :: t ->\n    let pt, px, py = pre and nt, nx, ny = now in\n    let dift = nt - pt and difd = abs (nx - px) + abs (ny - py) in\n    if difd <= dift && (dift + difd) mod 2 = 0 then solve (now :: t)\n    else \"No\"\n\n\nlet () = solve ls |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 546, "cpu_time_ms": 80, "memory_kb": 11008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s326129410", "group_id": "codeNet:p03466", "input_text": "let () =\n  let q = Scanf.scanf \"%d\\n\" (fun q -> q) in\n  let abcds = Array.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" (fun a b c d -> a, b, c, d)) in\n  Array.iter (fun (a, b, c, d) ->\n    begin match compare a b with\n    | -1 ->\n        for i = c to d do\n          (a + b - i) mod ((b + a) / (a + 1) + 1) < (a + b) / (a + 1)\n          |> (function true -> 'B' | false -> 'A')\n          |> print_char\n        done\n    | 0 ->\n        for i = c to d do\n          i mod 2 = 1\n          |> (function true -> 'A' | false -> 'B')\n          |> print_char\n        done\n    | 1 ->\n        for i = c to d do\n          (i - 1) mod ((a + b) / (b + 1) + 1) < (a + b) / (b + 1)\n          |> (function true -> 'A' | false -> 'B')\n          |> print_char\n        done\n    end;\n    print_newline ()) abcds", "language": "OCaml", "metadata": {"date": 1515987348, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03466.html", "problem_id": "p03466", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03466/input.txt", "sample_output_relpath": "derived/input_output/data/p03466/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03466/OCaml/s326129410.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s326129410", "user_id": "u504158101"}, "prompt_components": {"gold_output": "BABAB\nAABAABAABB\nA\nBAABA\nABAB\n", "input_to_evaluate": "let () =\n  let q = Scanf.scanf \"%d\\n\" (fun q -> q) in\n  let abcds = Array.init q (fun _ -> Scanf.scanf \"%d %d %d %d\\n\" (fun a b c d -> a, b, c, d)) in\n  Array.iter (fun (a, b, c, d) ->\n    begin match compare a b with\n    | -1 ->\n        for i = c to d do\n          (a + b - i) mod ((b + a) / (a + 1) + 1) < (a + b) / (a + 1)\n          |> (function true -> 'B' | false -> 'A')\n          |> print_char\n        done\n    | 0 ->\n        for i = c to d do\n          i mod 2 = 1\n          |> (function true -> 'A' | false -> 'B')\n          |> print_char\n        done\n    | 1 ->\n        for i = c to d do\n          (i - 1) mod ((a + b) / (b + 1) + 1) < (a + b) / (b + 1)\n          |> (function true -> 'A' | false -> 'B')\n          |> print_char\n        done\n    end;\n    print_newline ()) abcds", "problem_context": "Score : 1100 points\n\nProblem Statement\n\nLet f(A, B), where A and B are positive integers, be the string satisfying the following conditions:\n\nf(A, B) has length A + B;\n\nf(A, B) contains exactly A letters A and exactly B letters B;\n\nThe length of the longest substring of f(A, B) consisting of equal letters (ex., AAAAA or BBBB) is as small as possible under the conditions above;\n\nf(A, B) is the lexicographically smallest string satisfying the conditions above.\n\nFor example, f(2, 3) = BABAB, and f(6, 4) = AABAABAABB.\n\nAnswer Q queries: find the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nConstraints\n\n1 \\leq Q \\leq 10^3\n\n1 \\leq A_i, B_i \\leq 5 \\times 10^8\n\n1 \\leq C_i \\leq D_i \\leq A_i + B_i\n\nD_i - C_i + 1 \\leq 100\n\nAll input values are integers.\n\nPartial Score\n\n500 points will be awarded for passing the testset satisfying 1 \\leq A_i, B_i \\leq 10^3.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_Q B_Q C_Q D_Q\n\nOutput\n\nFor each query i in order of input, print a line containing the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nSample Input 1\n\n5\n2 3 1 5\n6 4 1 10\n2 3 4 4\n6 4 3 7\n8 10 5 8\n\nSample Output 1\n\nBABAB\nAABAABAABB\nA\nBAABA\nABAB", "sample_input": "5\n2 3 1 5\n6 4 1 10\n2 3 4 4\n6 4 3 7\n8 10 5 8\n"}, "reference_outputs": ["BABAB\nAABAABAABB\nA\nBAABA\nABAB\n"], "source_document_id": "p03466", "source_text": "Score : 1100 points\n\nProblem Statement\n\nLet f(A, B), where A and B are positive integers, be the string satisfying the following conditions:\n\nf(A, B) has length A + B;\n\nf(A, B) contains exactly A letters A and exactly B letters B;\n\nThe length of the longest substring of f(A, B) consisting of equal letters (ex., AAAAA or BBBB) is as small as possible under the conditions above;\n\nf(A, B) is the lexicographically smallest string satisfying the conditions above.\n\nFor example, f(2, 3) = BABAB, and f(6, 4) = AABAABAABB.\n\nAnswer Q queries: find the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nConstraints\n\n1 \\leq Q \\leq 10^3\n\n1 \\leq A_i, B_i \\leq 5 \\times 10^8\n\n1 \\leq C_i \\leq D_i \\leq A_i + B_i\n\nD_i - C_i + 1 \\leq 100\n\nAll input values are integers.\n\nPartial Score\n\n500 points will be awarded for passing the testset satisfying 1 \\leq A_i, B_i \\leq 10^3.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_Q B_Q C_Q D_Q\n\nOutput\n\nFor each query i in order of input, print a line containing the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nSample Input 1\n\n5\n2 3 1 5\n6 4 1 10\n2 3 4 4\n6 4 3 7\n8 10 5 8\n\nSample Output 1\n\nBABAB\nAABAABAABB\nA\nBAABA\nABAB", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 788, "cpu_time_ms": 8, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s690189601", "group_id": "codeNet:p03469", "input_text": "open Printf\nopen Scanf\n\nlet solve s =\n  Bytes.set s 3 '8' ; s\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582750854, "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/s690189601.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690189601", "user_id": "u388783188"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s =\n  Bytes.set s 3 '8' ; s\n\nlet () =\n  scanf \"%s \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "sample_input": "2017/01/07\n"}, "reference_outputs": ["2018/01/07\n"], "source_document_id": "p03469", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s704234148", "group_id": "codeNet:p03469", "input_text": "let () =\n  let s = read_line () in\n  print_string @@ String.concat \"\" [\"2018\"; String.sub s 4 (String.length s - 4); \"\\n\"]\n", "language": "OCaml", "metadata": {"date": 1519100699, "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/s704234148.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s704234148", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  print_string @@ String.concat \"\" [\"2018\"; String.sub s 4 (String.length s - 4); \"\\n\"]\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "sample_input": "2017/01/07\n"}, "reference_outputs": ["2018/01/07\n"], "source_document_id": "p03469", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s341133651", "group_id": "codeNet:p03470", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let d = Array.to_list (Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun d -> d) in\n  let ans = List.length (List.sort_uniq compare d) in\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1600887416, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s341133651.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s341133651", "user_id": "u307426615"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let d = Array.to_list (Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun d -> d) in\n  let ans = List.length (List.sort_uniq compare d) in\n  Printf.printf \"%d\\n\" ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 10, "memory_kb": 3868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s758274125", "group_id": "codeNet:p03470", "input_text": "(* O(n) *)\nlet list_to_array n a xs =\n  let res = Array.make n a in\n  List.iteri (fun i x -> res.(i) <- x) xs;\n  res\n\n(* O(n * log(n)) (n = |xs|) *)\nlet unique_info n xs =\n  if n <= 0 then\n    [], 0\n  else\n    let sorted_xs = list_to_array n 0 xs in\n    Array.sort compare sorted_xs;\n    let last = sorted_xs.(n - 1) in\n    let sofar, count, _ = Array.fold_right\n      (fun x (sofar, count, prev) ->\n        if x <> prev then\n          x :: sofar, count + 1, x\n        else\n          sofar, count, x)\n      sorted_xs\n      ([last], 1, last)\n    in\n      sofar, count\n\n(* O(n * log(n)) (n = |xs|) *)\nlet unique_count n xs = snd (unique_info n xs)\n\n(* O(n * log(n)) *)\nlet solve n ds = unique_count n ds\n\nlet fold_int f a n =\n  let rec fold f a i n =\n    if i >= n then\n      a\n    else\n      fold f (f a i) (i + 1) n\n  in\n    fold f a 0 n\n\nlet read_ints n =\n  fold_int\n    (fun sofar _ -> read_int () :: sofar)\n    []\n    n |> List.rev\n\nlet _ =\n  let n = read_int () in\n  let ds = read_ints n in\n  solve n ds |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1557232071, "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/s758274125.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s758274125", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(* O(n) *)\nlet list_to_array n a xs =\n  let res = Array.make n a in\n  List.iteri (fun i x -> res.(i) <- x) xs;\n  res\n\n(* O(n * log(n)) (n = |xs|) *)\nlet unique_info n xs =\n  if n <= 0 then\n    [], 0\n  else\n    let sorted_xs = list_to_array n 0 xs in\n    Array.sort compare sorted_xs;\n    let last = sorted_xs.(n - 1) in\n    let sofar, count, _ = Array.fold_right\n      (fun x (sofar, count, prev) ->\n        if x <> prev then\n          x :: sofar, count + 1, x\n        else\n          sofar, count, x)\n      sorted_xs\n      ([last], 1, last)\n    in\n      sofar, count\n\n(* O(n * log(n)) (n = |xs|) *)\nlet unique_count n xs = snd (unique_info n xs)\n\n(* O(n * log(n)) *)\nlet solve n ds = unique_count n ds\n\nlet fold_int f a n =\n  let rec fold f a i n =\n    if i >= n then\n      a\n    else\n      fold f (f a i) (i + 1) n\n  in\n    fold f a 0 n\n\nlet read_ints n =\n  fold_int\n    (fun sofar _ -> read_int () :: sofar)\n    []\n    n |> List.rev\n\nlet _ =\n  let n = read_int () in\n  let ds = read_ints n in\n  solve n ds |> string_of_int |> print_endline", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1041, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s802339405", "group_id": "codeNet:p03470", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n -> \n  Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x -> x))\n  |> Array.to_list\n  |> List.sort_uniq (-)\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1550812133, "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/s802339405.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802339405", "user_id": "u957084285"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n -> \n  Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x -> x))\n  |> Array.to_list\n  |> List.sort_uniq (-)\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s642607925", "group_id": "codeNet:p03473", "input_text": "let m = read_int ()\nlet () = print_int (48 - m)", "language": "OCaml", "metadata": {"date": 1588182306, "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/s642607925.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s642607925", "user_id": "u307426615"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let m = read_int ()\nlet () = print_int (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s493814143", "group_id": "codeNet:p03473", "input_text": "\nlet calc h =\n    48 - h\n\nlet main =\n    let x = read_line () |> int_of_string |> calc in\n        print_endline (Printf.sprintf \"%d\" x)\n\n", "language": "OCaml", "metadata": {"date": 1575950775, "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/s493814143.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s493814143", "user_id": "u912845774"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "\nlet calc h =\n    48 - h\n\nlet main =\n    let x = read_line () |> int_of_string |> calc in\n        print_endline (Printf.sprintf \"%d\" x)\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s922739934", "group_id": "codeNet:p03473", "input_text": "let solve () = \n    let m = int_of_string (read_line ())\n    in print_int (24 - m + 24); print_newline ()\n\nlet _ = solve ()", "language": "OCaml", "metadata": {"date": 1519103474, "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/s922739934.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s922739934", "user_id": "u219949952"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let solve () = \n    let m = int_of_string (read_line ())\n    in print_int (24 - m + 24); print_newline ()\n\nlet _ = solve ()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s560762103", "group_id": "codeNet:p03474", "input_text": "Scanf.scanf \"%d %d %s\" (fun a b s ->\n    let rec loop i =\n        if i = a + b + 1 then true else\n        if i = a then (if s.[i] = '-' then loop (i + 1) else false) else\n            if s.[i] >= '0' && s.[i] <= '9' then loop (i + 1) else false\n    in\n    print_endline @@ if loop 0 then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1601350966, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s560762103.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s560762103", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d %d %s\" (fun a b s ->\n    let rec loop i =\n        if i = a + b + 1 then true else\n        if i = a then (if s.[i] = '-' then loop (i + 1) else false) else\n            if s.[i] >= '0' && s.[i] <= '9' then loop (i + 1) else false\n    in\n    print_endline @@ if loop 0 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s978186359", "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 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 sums = Array.make (!rmax + 1) 0\nlet f n = if n mod 2 = 1 && is_prime n && is_prime @@ (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 f (l, r) =\n    Printf.printf \"%d\\n\" @@ sums.(r) - sums.(l - 1)\n  in\n  Array.iter f lrs", "language": "OCaml", "metadata": {"date": 1560597082, "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/s978186359.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978186359", "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 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 sums = Array.make (!rmax + 1) 0\nlet f n = if n mod 2 = 1 && is_prime n && is_prime @@ (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 f (l, r) =\n    Printf.printf \"%d\\n\" @@ sums.(r) - sums.(l - 1)\n  in\n  Array.iter f 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 610, "cpu_time_ms": 107, "memory_kb": 8064}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s835068100", "group_id": "codeNet:p03477", "input_text": "let l, r = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a + b, c + d\nlet _ = print_endline @@ if l > r then \"Left\" else if l = r then \"Balanced\" else \"Right\"", "language": "OCaml", "metadata": {"date": 1562768197, "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/s835068100.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s835068100", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "let l, r = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a + b, c + d\nlet _ = print_endline @@ if l > r then \"Left\" else if l = r then \"Balanced\" else \"Right\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s613452578", "group_id": "codeNet:p03477", "input_text": "let (a,b,c,d) = Scanf.scanf \"%d %d %d %d\\n\" (fun x y z w -> (x,y,z,w))\n\nlet () = let tmp = a + b - c - d in\n         if tmp > 0 then print_endline \"Left\"\n         else if tmp = 0 then print_endline \"Balanced\"\n         else print_endline \"Right\"", "language": "OCaml", "metadata": {"date": 1514133404, "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/s613452578.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613452578", "user_id": "u459801769"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "let (a,b,c,d) = Scanf.scanf \"%d %d %d %d\\n\" (fun x y z w -> (x,y,z,w))\n\nlet () = let tmp = a + b - c - d in\n         if tmp > 0 then print_endline \"Left\"\n         else if tmp = 0 then print_endline \"Balanced\"\n         else print_endline \"Right\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s299257003", "group_id": "codeNet:p03479", "input_text": "let solve x y =\n  let rec search n last =\n    if last <= y then search (n + 1) (2 * last)\n    else n\n  in search 0 x\n\nlet () = Scanf.scanf \"%d %d\" solve |> print_int\n", "language": "OCaml", "metadata": {"date": 1514085040, "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/s299257003.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s299257003", "user_id": "u508294160"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let solve x y =\n  let rec search n last =\n    if last <= y then search (n + 1) (2 * last)\n    else n\n  in search 0 x\n\nlet () = Scanf.scanf \"%d %d\" solve |> print_int\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s362168172", "group_id": "codeNet:p03479", "input_text": "let (x,y) = Scanf.scanf \"%d %d\\n\" (fun x y -> (x,y))\n\nlet pr x = print_endline (string_of_int x)\n\nlet z = (log (float_of_int y)) -. (log (float_of_int x))\n\nlet w = (z /. (log 2.0)) +. 1.\n\nlet () = w\n         |> int_of_float\n         |> pr\n", "language": "OCaml", "metadata": {"date": 1514083345, "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/s362168172.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s362168172", "user_id": "u459801769"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let (x,y) = Scanf.scanf \"%d %d\\n\" (fun x y -> (x,y))\n\nlet pr x = print_endline (string_of_int x)\n\nlet z = (log (float_of_int y)) -. (log (float_of_int x))\n\nlet w = (z /. (log 2.0)) +. 1.\n\nlet () = w\n         |> int_of_float\n         |> pr\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 3, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s452776609", "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-1) (fun i ->\n    if s.[i] <> s.[i+1] then max (i+1) (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": 1519114821, "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/s452776609.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s452776609", "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-1) (fun i ->\n    if s.[i] <> s.[i+1] then max (i+1) (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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 13, "memory_kb": 11136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s016716156", "group_id": "codeNet:p03480", "input_text": "let pr x = print_endline (string_of_int x)\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 solve seq =\n  let len = List.length seq in\n  let (_,_,res) = List.fold_left (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)) (0,List.hd seq,len) seq in res\n\nlet () = input_line stdin\n         |> explode \n         |> solve\n         |> pr\n", "language": "OCaml", "metadata": {"date": 1514126187, "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/s016716156.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s016716156", "user_id": "u459801769"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let pr x = print_endline (string_of_int x)\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 solve seq =\n  let len = List.length seq in\n  let (_,_,res) = List.fold_left (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)) (0,List.hd seq,len) seq in res\n\nlet () = input_line stdin\n         |> explode \n         |> solve\n         |> pr\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 523, "cpu_time_ms": 8, "memory_kb": 6144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s083530435", "group_id": "codeNet:p03485", "input_text": "let () = Scanf.scanf \"%d %d\" (fun a b -> (a + b) / 2 ) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595902169, "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/s083530435.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s083530435", "user_id": "u272377260"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" (fun a b -> (a + b) / 2 ) |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 7, "memory_kb": 3752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s764384724", "group_id": "codeNet:p03485", "input_text": "let f a b = int_of_float ((a +. b) /. 2.0);;\nScanf.scanf \"%f %f\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561097338, "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/s764384724.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s764384724", "user_id": "u635974378"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let f a b = int_of_float ((a +. b) /. 2.0);;\nScanf.scanf \"%f %f\" f\n|> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s671529810", "group_id": "codeNet:p03486", "input_text": "let s = read_line () in\nlet t = read_line () in\nlet sa = Array.init (String.length s) (fun i -> s.[i]) in\nlet ta = Array.init (String.length t) (fun i -> t.[i]) in\nlet () = Array.sort (fun a b -> compare a b) sa in\nlet () = Array.sort (fun a b -> compare b a) ta in\nlet s = String.init (String.length s) (fun i -> sa.(i)) in\nlet t = String.init (String.length t) (fun i -> ta.(i)) in\nprint_endline @@ if s < t then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1586139872, "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/s671529810.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s671529810", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line () in\nlet t = read_line () in\nlet sa = Array.init (String.length s) (fun i -> s.[i]) in\nlet ta = Array.init (String.length t) (fun i -> t.[i]) in\nlet () = Array.sort (fun a b -> compare a b) sa in\nlet () = Array.sort (fun a b -> compare b a) ta in\nlet s = String.init (String.length s) (fun i -> sa.(i)) in\nlet t = String.init (String.length t) (fun i -> ta.(i)) in\nprint_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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s873851892", "group_id": "codeNet:p03486", "input_text": "let array_of_string str = Array.init (String.length str) (fun i -> str.[i])\nlet string_of_array arr = String.init (Array.length arr) (fun i -> arr.(i))\n\nlet () =\n  let s = read_line () |> array_of_string in\n  let t = read_line () |> array_of_string in\n  Array.sort (fun x y -> int_of_char x - int_of_char y) s;\n  Array.sort (fun x y -> int_of_char y - int_of_char x) t;\n  print_endline @@\n    if string_of_array s < string_of_array t then \"Yes\" else \"No\"\n\n\n", "language": "OCaml", "metadata": {"date": 1519116319, "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/s873851892.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873851892", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let array_of_string str = Array.init (String.length str) (fun i -> str.[i])\nlet string_of_array arr = String.init (Array.length arr) (fun i -> arr.(i))\n\nlet () =\n  let s = read_line () |> array_of_string in\n  let t = read_line () |> array_of_string in\n  Array.sort (fun x y -> int_of_char x - int_of_char y) s;\n  Array.sort (fun x y -> int_of_char y - int_of_char x) t;\n  print_endline @@\n    if string_of_array s < string_of_array t then \"Yes\" else \"No\"\n\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s508974998", "group_id": "codeNet:p03487", "input_text": "let ans, a_s = ref 0, Array.init (read_int ()) @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet f (p, c) a = a, if a <> p then (ans := !ans + if p > c then c else min c @@ c - p; 1) else c + 1\nlet _ = Array.(sort (-) a_s; f (fold_left f (a_s.(0), 0) a_s) 0) |> ignore; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1576418330, "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/s508974998.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s508974998", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let ans, a_s = ref 0, Array.init (read_int ()) @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet f (p, c) a = a, if a <> p then (ans := !ans + if p > c then c else min c @@ c - p; 1) else c + 1\nlet _ = Array.(sort (-) a_s; f (fold_left f (a_s.(0), 0) a_s) 0) |> ignore; 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 63, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s655594214", "group_id": "codeNet:p03488", "input_text": "Scanf.scanf \"%s %d %d\" (fun s x y ->\n    let len = String.length s in\n    let rec loop i dir first cur xl yl =\n        if i = len then (\n            if cur > 0 then (\n                if first < 0 then cur, xl, yl else\n                if dir then first, (cur :: xl), yl\n                       else first, xl, (cur :: yl)\n            ) else first, xl, yl\n        ) else (\n            if s.[i] = 'F' then loop (i + 1) dir first (cur + 1) xl yl else\n                let first, xl, yl =\n                    if cur > 0 then (\n                        if first < 0 then cur, xl, yl else\n                        if dir then first, (cur :: xl), yl\n                               else first, xl, (cur :: yl)\n                    ) else max first cur, xl, yl\n                in\n                loop (i + 1) (not dir) first 0 xl yl\n        )\n    in\n    let fx, xl, yl = loop 0 true (-1) 0 [] [] in\n    let judge p l =\n        let a = Array.make 8192 false in\n        a.(0) <- true;\n        List.iter (fun v ->\n            for j = 8191 downto v do\n                a.(j) <- a.(j) || a.(j - v)\n            done\n        ) l;\n        let sum = List.fold_left (+) 0 l in\n        let rec loop i =\n            if i = 8192 then false else\n                if a.(i) && abs (sum - i * 2) = abs p then true else loop (i + 1)\n        in\n        loop 0\n    in\n    print_endline @@ if judge (x - fx) xl && judge y yl then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1586142240, "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/s655594214.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s655594214", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%s %d %d\" (fun s x y ->\n    let len = String.length s in\n    let rec loop i dir first cur xl yl =\n        if i = len then (\n            if cur > 0 then (\n                if first < 0 then cur, xl, yl else\n                if dir then first, (cur :: xl), yl\n                       else first, xl, (cur :: yl)\n            ) else first, xl, yl\n        ) else (\n            if s.[i] = 'F' then loop (i + 1) dir first (cur + 1) xl yl else\n                let first, xl, yl =\n                    if cur > 0 then (\n                        if first < 0 then cur, xl, yl else\n                        if dir then first, (cur :: xl), yl\n                               else first, xl, (cur :: yl)\n                    ) else max first cur, xl, yl\n                in\n                loop (i + 1) (not dir) first 0 xl yl\n        )\n    in\n    let fx, xl, yl = loop 0 true (-1) 0 [] [] in\n    let judge p l =\n        let a = Array.make 8192 false in\n        a.(0) <- true;\n        List.iter (fun v ->\n            for j = 8191 downto v do\n                a.(j) <- a.(j) || a.(j - v)\n            done\n        ) l;\n        let sum = List.fold_left (+) 0 l in\n        let rec loop i =\n            if i = 8192 then false else\n                if a.(i) && abs (sum - i * 2) = abs p then true else loop (i + 1)\n        in\n        loop 0\n    in\n    print_endline @@ if judge (x - fx) xl && judge y yl then \"Yes\" else \"No\"\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\n\nNo", "sample_input": "FTFFTFFF\n4 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1409, "cpu_time_ms": 64, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s530055869", "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 is =\n    if (abs (x - ix) + abs (y - iy)) > m then false\n    else match is with\n      | [] -> (ix = x) && (iy = y)\n      | 'F' :: rest -> 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": 1513481872, "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/s530055869.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s530055869", "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 is =\n    if (abs (x - ix) + abs (y - iy)) > m then false\n    else match is with\n      | [] -> (ix = x) && (iy = y)\n      | 'F' :: rest -> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 868, "cpu_time_ms": 2107, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s516721375", "group_id": "codeNet:p03494", "input_text": "(* O(n * log(max a_s)) *)\nlet _ = Scanf.scanf \"%d\" @@ fun n ->\n  let a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0 in\n  let rec count m =\n    for i = 0 to n - 1 do\n      if a_s.(i) mod 2 = 1 then (Printf.printf \"%d\\n\" m; exit 0);\n      a_s.(i) <- a_s.(i) / 2\n    done;\n    count (m + 1) in\n  count 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1558388594, "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/s516721375.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s516721375", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(n * log(max a_s)) *)\nlet _ = Scanf.scanf \"%d\" @@ fun n ->\n  let a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0 in\n  let rec count m =\n    for i = 0 to n - 1 do\n      if a_s.(i) mod 2 = 1 then (Printf.printf \"%d\\n\" m; exit 0);\n      a_s.(i) <- a_s.(i) / 2\n    done;\n    count (m + 1) in\n  count 0 |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s925115918", "group_id": "codeNet:p03494", "input_text": "let rec count_factor_2 x =\n  if x mod 2 = 0 then 1 + count_factor_2 (x/2)\n  else 0\n\nlet () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  Array.init n (fun _ -> Scanf.scanf \"%d \" count_factor_2)\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1550635234, "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/s925115918.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s925115918", "user_id": "u957084285"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec count_factor_2 x =\n  if x mod 2 = 0 then 1 + count_factor_2 (x/2)\n  else 0\n\nlet () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  Array.init n (fun _ -> Scanf.scanf \"%d \" count_factor_2)\n  |> Array.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s582184205", "group_id": "codeNet:p03497", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n, k = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n k -> (n, k)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nmodule IntMap = Map.Make(struct type t = int let compare = compare end)\n\nlet map = List.fold_left (fun map i ->\n  let cnt = try IntMap.find i map with Not_found -> 0 in\n  IntMap.add i (cnt + 1) map\n) IntMap.empty a\n\nlet rec drop n acc = match (n, acc) with\n  | (0, acc) -> acc\n  | (_, []) -> []\n  | (n, x :: xs) -> drop (n - 1) xs\n\nlet () =\n  IntMap.bindings map\n  |> List.sort (fun (_, a) (_, b) -> b - a)\n  |> drop k\n  |> List.map snd\n  |> List.fold_left (+) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1594085787, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03497.html", "problem_id": "p03497", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03497/input.txt", "sample_output_relpath": "derived/input_output/data/p03497/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03497/OCaml/s582184205.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s582184205", "user_id": "u811309788"}, "prompt_components": {"gold_output": "1\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, k)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nmodule IntMap = Map.Make(struct type t = int let compare = compare end)\n\nlet map = List.fold_left (fun map i ->\n  let cnt = try IntMap.find i map with Not_found -> 0 in\n  IntMap.add i (cnt + 1) map\n) IntMap.empty a\n\nlet rec drop n acc = match (n, acc) with\n  | (0, acc) -> acc\n  | (_, []) -> []\n  | (n, x :: xs) -> drop (n - 1) xs\n\nlet () =\n  IntMap.bindings map\n  |> List.sort (fun (_, a) (_, b) -> b - a)\n  |> drop k\n  |> List.map snd\n  |> List.fold_left (+) 0\n  |> Printf.printf \"%d\\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": "p03497", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 698, "cpu_time_ms": 478, "memory_kb": 60040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s279706084", "group_id": "codeNet:p03498", "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 m mi =\n        if i = n then mi else\n            if abs a.(i) > abs m then loop (i + 1) a.(i) i\n                                 else loop (i + 1) m mi\n    in\n    let mi = loop 0 0 0 in\n    let m = a.(mi) in\n    let adjust = Array.fold_left (fun acc v -> if v * m < 0 then acc + 1 else acc) 0 a in\n    Printf.printf \"%d\\n\" (adjust + n - 1);\n    Array.iteri (fun i v ->\n        if v * m < 0 then Printf.printf \"%d %d\\n\" (mi + 1) (i + 1)) a;\n    if m > 0 then for i = 0 to n - 2     do Printf.printf \"%d %d\\n\" i (i + 1) done\n             else for i = n - 1 downto 1 do Printf.printf \"%d %d\\n\" i (i - 1) done\n\n)", "language": "OCaml", "metadata": {"date": 1589594058, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03498.html", "problem_id": "p03498", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03498/input.txt", "sample_output_relpath": "derived/input_output/data/p03498/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03498/OCaml/s279706084.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s279706084", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n2 3\n3 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\n    let rec loop i m mi =\n        if i = n then mi else\n            if abs a.(i) > abs m then loop (i + 1) a.(i) i\n                                 else loop (i + 1) m mi\n    in\n    let mi = loop 0 0 0 in\n    let m = a.(mi) in\n    let adjust = Array.fold_left (fun acc v -> if v * m < 0 then acc + 1 else acc) 0 a in\n    Printf.printf \"%d\\n\" (adjust + n - 1);\n    Array.iteri (fun i v ->\n        if v * m < 0 then Printf.printf \"%d %d\\n\" (mi + 1) (i + 1)) a;\n    if m > 0 then for i = 0 to n - 2     do Printf.printf \"%d %d\\n\" i (i + 1) done\n             else for i = n - 1 downto 1 do Printf.printf \"%d %d\\n\" i (i - 1) done\n\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.\n\nHe can perform the following operation any number of times:\n\nOperation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.\n\nHe would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations.\nIt can be proved that such a sequence of operations always exists under the constraints in this problem.\n\nCondition: a_1 \\leq a_2 \\leq ... \\leq a_{N}\n\nConstraints\n\n2 \\leq N \\leq 50\n\n-10^{6} \\leq a_i \\leq 10^{6}\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\nLet m be the number of operations in your solution. In the first line, print m.\nIn the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between.\nThe output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.\n\nSample Input 1\n\n3\n-2 5 -1\n\nSample Output 1\n\n2\n2 3\n3 3\n\nAfter the first operation, a = (-2,5,4).\n\nAfter the second operation, a = (-2,5,8), and the condition is now satisfied.\n\nSample Input 2\n\n2\n-1 -3\n\nSample Output 2\n\n1\n2 1\n\nAfter the first operation, a = (-4,-3) and the condition is now satisfied.\n\nSample Input 3\n\n5\n0 0 0 0 0\n\nSample Output 3\n\n0\n\nThe condition is satisfied already in the beginning.", "sample_input": "3\n-2 5 -1\n"}, "reference_outputs": ["2\n2 3\n3 3\n"], "source_document_id": "p03498", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.\n\nHe can perform the following operation any number of times:\n\nOperation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.\n\nHe would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations.\nIt can be proved that such a sequence of operations always exists under the constraints in this problem.\n\nCondition: a_1 \\leq a_2 \\leq ... \\leq a_{N}\n\nConstraints\n\n2 \\leq N \\leq 50\n\n-10^{6} \\leq a_i \\leq 10^{6}\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\nLet m be the number of operations in your solution. In the first line, print m.\nIn the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between.\nThe output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.\n\nSample Input 1\n\n3\n-2 5 -1\n\nSample Output 1\n\n2\n2 3\n3 3\n\nAfter the first operation, a = (-2,5,4).\n\nAfter the second operation, a = (-2,5,8), and the condition is now satisfied.\n\nSample Input 2\n\n2\n-1 -3\n\nSample Output 2\n\n1\n2 1\n\nAfter the first operation, a = (-4,-3) and the condition is now satisfied.\n\nSample Input 3\n\n5\n0 0 0 0 0\n\nSample Output 3\n\n0\n\nThe condition is satisfied already in the beginning.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 725, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s693892671", "group_id": "codeNet:p03501", "input_text": "open Batteries\nlet () =\n  let n,a,b = Scanf.scanf \"%d %d %d \" (fun a b c -> a,b,c) in\n  Printf.printf \"%d\\n\" @@\n  min (a*n) b\n", "language": "OCaml", "metadata": {"date": 1529238474, "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/s693892671.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s693892671", "user_id": "u139013163"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "open Batteries\nlet () =\n  let n,a,b = Scanf.scanf \"%d %d %d \" (fun a b c -> a,b,c) in\n  Printf.printf \"%d\\n\" @@\n  min (a*n) b\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s455422400", "group_id": "codeNet:p03501", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun n a b -> min (a*n) b) |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519660505, "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/s455422400.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455422400", "user_id": "u798181098"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun n a b -> min (a*n) b) |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s729334952", "group_id": "codeNet:p03502", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec sum n i len =\n    if i > len then 0 else (n / (int_of_float (10. ** float_of_int (i-1)))) mod 10 + sum n (i+1) len in\n  Printf.printf \"%s\\n\" (if n mod (sum n 1 (String.length (string_of_int n))) = 0 then \"Yes\" else \"No\")\n", "language": "OCaml", "metadata": {"date": 1600889135, "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/s729334952.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s729334952", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec sum n i len =\n    if i > len then 0 else (n / (int_of_float (10. ** float_of_int (i-1)))) mod 10 + sum n (i+1) len in\n  Printf.printf \"%s\\n\" (if n mod (sum n 1 (String.length (string_of_int n))) = 0 then \"Yes\" else \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 9, "memory_kb": 4188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s736770307", "group_id": "codeNet:p03502", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n = scanf \"%d\" id\n\nlet () =\n    let r = ref 0 in\n    let s = string_of_int n in\n    String.iter (fun c -> r := !r + (int_of_char c - int_of_char '0')) s;\n    if n mod !r = 0 then\n        print_endline \"Yes\"\n    else\n        print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1535242893, "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/s736770307.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s736770307", "user_id": "u450300828"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n = scanf \"%d\" id\n\nlet () =\n    let r = ref 0 in\n    let s = string_of_int n in\n    String.iter (fun c -> r := !r + (int_of_char c - int_of_char '0')) s;\n    if n mod !r = 0 then\n        print_endline \"Yes\"\n    else\n        print_endline \"No\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s449196907", "group_id": "codeNet:p03503", "input_text": "\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let fss =\n    Array.to_list @@ Array.init n @@ fun _ ->\n      Array.init 10 @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun f -> f in\n  let pss =\n    Array.to_list @@ Array.init n @@ fun _ ->\n      Array.init 11 @@ fun _ -> Scanf.scanf \"%d \" @@ fun p -> p in\n  Array.init 1023 (fun opening ->\n    let opening = opening + 1 in\n    List.map2 (fun fs ps ->\n      ps.(Array.fold_left ( + ) 0\n        (Array.mapi (fun i f ->\n          if f = 1 && (opening land (1 lsl i)) <> 0 then 1 else 0) fs))) fss pss\n    |> List.fold_left ( + ) 0)\n  |> Array.fold_left max min_int\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1530768014, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03503.html", "problem_id": "p03503", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03503/input.txt", "sample_output_relpath": "derived/input_output/data/p03503/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03503/OCaml/s449196907.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s449196907", "user_id": "u504158101"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let fss =\n    Array.to_list @@ Array.init n @@ fun _ ->\n      Array.init 10 @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun f -> f in\n  let pss =\n    Array.to_list @@ Array.init n @@ fun _ ->\n      Array.init 11 @@ fun _ -> Scanf.scanf \"%d \" @@ fun p -> p in\n  Array.init 1023 (fun opening ->\n    let opening = opening + 1 in\n    List.map2 (fun fs ps ->\n      ps.(Array.fold_left ( + ) 0\n        (Array.mapi (fun i f ->\n          if f = 1 && (opening land (1 lsl i)) <> 0 then 1 else 0) fs))) fss pss\n    |> List.fold_left ( + ) 0)\n  |> Array.fold_left max min_int\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nJoisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods.\n\nThere are already N stores in the street, numbered 1 through N.\n\nYou are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2.\n\nLet c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.\n\nFind the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.\n\nConstraints\n\n1≤N≤100\n\n0≤F_{i,j,k}≤1\n\nFor every integer i such that 1≤i≤N, there exists at least one pair (j,k) such that F_{i,j,k}=1.\n\n-10^7≤P_{i,j}≤10^7\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nF_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}\n:\nF_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}\nP_{1,0} ... P_{1,10}\n:\nP_{N,0} ... P_{N,10}\n\nOutput\n\nPrint the maximum possible profit of Joisino's shop.\n\nSample Input 1\n\n1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n\nSample Output 1\n\n8\n\nIf her shop is open only during the periods when Shop 1 is opened, the profit will be 8, which is the maximum possible profit.\n\nSample Input 2\n\n2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n\nSample Output 2\n\n-2\n\nNote that a shop must be open during at least one period, and the profit may be negative.\n\nSample Input 3\n\n3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 0 1 0\n1 0 1 1 0 1 0 1 0 1\n-8 6 -2 -8 -8 4 8 7 -6 2 2\n-9 2 0 1 7 -5 0 -2 -6 5 5\n6 -6 7 -9 6 -5 8 0 -9 -7 -7\n\nSample Output 3\n\n23", "sample_input": "1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03503", "source_text": "Score : 300 points\n\nProblem Statement\n\nJoisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods.\n\nThere are already N stores in the street, numbered 1 through N.\n\nYou are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2.\n\nLet c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.\n\nFind the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.\n\nConstraints\n\n1≤N≤100\n\n0≤F_{i,j,k}≤1\n\nFor every integer i such that 1≤i≤N, there exists at least one pair (j,k) such that F_{i,j,k}=1.\n\n-10^7≤P_{i,j}≤10^7\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nF_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}\n:\nF_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}\nP_{1,0} ... P_{1,10}\n:\nP_{N,0} ... P_{N,10}\n\nOutput\n\nPrint the maximum possible profit of Joisino's shop.\n\nSample Input 1\n\n1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n\nSample Output 1\n\n8\n\nIf her shop is open only during the periods when Shop 1 is opened, the profit will be 8, which is the maximum possible profit.\n\nSample Input 2\n\n2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n\nSample Output 2\n\n-2\n\nNote that a shop must be open during at least one period, and the profit may be negative.\n\nSample Input 3\n\n3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 0 1 0\n1 0 1 1 0 1 0 1 0 1\n-8 6 -2 -8 -8 4 8 7 -6 2 2\n-9 2 0 1 7 -5 0 -2 -6 5 5\n6 -6 7 -9 6 -5 8 0 -9 -7 -7\n\nSample Output 3\n\n23", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 22, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s346068647", "group_id": "codeNet:p03505", "input_text": "open Printf\nopen Scanf\n\nlet solve k a b =\n  if a <= b && a >= k then 1\n  else if a <= b then -1\n  else let i = (k - b + a - b - 1) / (a - b) in max 1 (2 * i - 1)\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1594232327, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03505.html", "problem_id": "p03505", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03505/input.txt", "sample_output_relpath": "derived/input_output/data/p03505/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03505/OCaml/s346068647.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346068647", "user_id": "u388783188"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve k a b =\n  if a <= b && a >= k then 1\n  else if a <= b then -1\n  else let i = (k - b + a - b - 1) / (a - b) in max 1 (2 * i - 1)\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nButCoder Inc. runs a programming competition site called ButCoder. In this site, a user is given an integer value called rating that represents his/her skill, which changes each time he/she participates in a contest. The initial value of a new user's rating is 0, and a user whose rating reaches K or higher is called Kaiden (\"total transmission\"). Note that a user's rating may become negative.\n\nHikuhashi is a new user in ButCoder. It is estimated that, his rating increases by A in each of his odd-numbered contests (first, third, fifth, ...), and decreases by B in each of his even-numbered contests (second, fourth, sixth, ...).\n\nAccording to this estimate, after how many contests will he become Kaiden for the first time, or will he never become Kaiden?\n\nConstraints\n\n1 ≤ K, A, B ≤ 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nIf it is estimated that Hikuhashi will never become Kaiden, print -1. Otherwise, print the estimated number of contests before he become Kaiden for the first time.\n\nSample Input 1\n\n4000 2000 500\n\nSample Output 1\n\n5\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 2000 → 1500 → 3500 → 3000 → 5000 → … After his fifth contest, his rating will reach 4000 or higher for the first time.\n\nSample Input 2\n\n4000 500 2000\n\nSample Output 2\n\n-1\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 500 → -1500 → -1000 → -3000 → -2500 → … He will never become Kaiden.\n\nSample Input 3\n\n1000000000000000000 2 1\n\nSample Output 3\n\n1999999999999999997\n\nThe input and output values may not fit into 32-bit integers.", "sample_input": "4000 2000 500\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03505", "source_text": "Score : 100 points\n\nProblem Statement\n\nButCoder Inc. runs a programming competition site called ButCoder. In this site, a user is given an integer value called rating that represents his/her skill, which changes each time he/she participates in a contest. The initial value of a new user's rating is 0, and a user whose rating reaches K or higher is called Kaiden (\"total transmission\"). Note that a user's rating may become negative.\n\nHikuhashi is a new user in ButCoder. It is estimated that, his rating increases by A in each of his odd-numbered contests (first, third, fifth, ...), and decreases by B in each of his even-numbered contests (second, fourth, sixth, ...).\n\nAccording to this estimate, after how many contests will he become Kaiden for the first time, or will he never become Kaiden?\n\nConstraints\n\n1 ≤ K, A, B ≤ 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nIf it is estimated that Hikuhashi will never become Kaiden, print -1. Otherwise, print the estimated number of contests before he become Kaiden for the first time.\n\nSample Input 1\n\n4000 2000 500\n\nSample Output 1\n\n5\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 2000 → 1500 → 3500 → 3000 → 5000 → … After his fifth contest, his rating will reach 4000 or higher for the first time.\n\nSample Input 2\n\n4000 500 2000\n\nSample Output 2\n\n-1\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 500 → -1500 → -1000 → -3000 → -2500 → … He will never become Kaiden.\n\nSample Input 3\n\n1000000000000000000 2 1\n\nSample Output 3\n\n1999999999999999997\n\nThe input and output values may not fit into 32-bit integers.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s257051093", "group_id": "codeNet:p03506", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ function\n  | 1 -> fun q ->\n      for i = 0 to q - 1 do\n        Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\\n\" min\n      done\n  | n -> fun q ->\n      let up v = (v - 1) / n in\n      let rec upn v = function\n        | 0 -> v\n        | n -> upn (up v) (n - 1) in\n      let rec depth acc = function\n        | 0 -> acc\n        | v -> depth (1 + acc) (up v) in\n      let depth = depth 0 in\n      let rec lca v w =\n        if v = w then v\n        else lca (up v) (up w) in\n      let lca v w =\n        let dv = depth v in\n        let dw = depth w in\n        if dv <= dw\n        then lca v (upn w (dw - dv))\n        else lca (upn v (dv - dw)) w in\n      for i = 0 to q - 1 do\n        Scanf.scanf \"%d %d\\n\" @@ fun v w ->\n          Printf.printf \"%d\\n\" @@ succ @@ lca (v - 1) (w - 1)\n      done\n", "language": "OCaml", "metadata": {"date": 1537584464, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03506.html", "problem_id": "p03506", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03506/input.txt", "sample_output_relpath": "derived/input_output/data/p03506/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03506/OCaml/s257051093.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s257051093", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n1\n3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ function\n  | 1 -> fun q ->\n      for i = 0 to q - 1 do\n        Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\\n\" min\n      done\n  | n -> fun q ->\n      let up v = (v - 1) / n in\n      let rec upn v = function\n        | 0 -> v\n        | n -> upn (up v) (n - 1) in\n      let rec depth acc = function\n        | 0 -> acc\n        | v -> depth (1 + acc) (up v) in\n      let depth = depth 0 in\n      let rec lca v w =\n        if v = w then v\n        else lca (up v) (up w) in\n      let lca v w =\n        let dv = depth v in\n        let dw = depth w in\n        if dv <= dw\n        then lca v (upn w (dw - dv))\n        else lca (upn v (dv - dw)) w in\n      for i = 0 to q - 1 do\n        Scanf.scanf \"%d %d\\n\" @@ fun v w ->\n          Printf.printf \"%d\\n\" @@ succ @@ lca (v - 1) (w - 1)\n      done\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N. Consider an infinite N-ary tree as shown below:\n\nFigure: an infinite N-ary tree for the case N = 3\n\nAs shown in the figure, each vertex is indexed with a unique positive integer, and for every positive integer there is a vertex indexed with it. The root of the tree has the index 1. For the remaining vertices, vertices in the upper row have smaller indices than those in the lower row. Among the vertices in the same row, a vertex that is more to the left has a smaller index.\n\nRegarding this tree, process Q queries. The i-th query is as follows:\n\nFind the index of the lowest common ancestor (see Notes) of Vertex v_i and w_i.\n\nNotes\n\nIn a rooted tree, the lowest common ancestor (LCA) of Vertex v and w is the farthest vertex from the root that is an ancestor of both Vertex v and w. Here, a vertex is considered to be an ancestor of itself. For example, in the tree shown in Problem Statement, the LCA of Vertex 5 and 7 is Vertex 2, the LCA of Vertex 8 and 11 is Vertex 1, and the LCA of Vertex 3 and 9 is Vertex 3.\n\nConstraints\n\n1 ≤ N ≤ 10^9\n\n1 ≤ Q ≤ 10^5\n\n1 ≤ v_i < w_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nv_1 w_1\n:\nv_Q w_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 ≤ i ≤ Q) must contain the index of the lowest common ancestor of Vertex v_i and w_i.\n\nSample Input 1\n\n3 3\n5 7\n8 11\n3 9\n\nSample Output 1\n\n2\n1\n3\n\nThe queries in this case correspond to the examples shown in Notes.\n\nSample Input 2\n\n100000 2\n1 2\n3 4\n\nSample Output 2\n\n1\n1", "sample_input": "3 3\n5 7\n8 11\n3 9\n"}, "reference_outputs": ["2\n1\n3\n"], "source_document_id": "p03506", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N. Consider an infinite N-ary tree as shown below:\n\nFigure: an infinite N-ary tree for the case N = 3\n\nAs shown in the figure, each vertex is indexed with a unique positive integer, and for every positive integer there is a vertex indexed with it. The root of the tree has the index 1. For the remaining vertices, vertices in the upper row have smaller indices than those in the lower row. Among the vertices in the same row, a vertex that is more to the left has a smaller index.\n\nRegarding this tree, process Q queries. The i-th query is as follows:\n\nFind the index of the lowest common ancestor (see Notes) of Vertex v_i and w_i.\n\nNotes\n\nIn a rooted tree, the lowest common ancestor (LCA) of Vertex v and w is the farthest vertex from the root that is an ancestor of both Vertex v and w. Here, a vertex is considered to be an ancestor of itself. For example, in the tree shown in Problem Statement, the LCA of Vertex 5 and 7 is Vertex 2, the LCA of Vertex 8 and 11 is Vertex 1, and the LCA of Vertex 3 and 9 is Vertex 3.\n\nConstraints\n\n1 ≤ N ≤ 10^9\n\n1 ≤ Q ≤ 10^5\n\n1 ≤ v_i < w_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nv_1 w_1\n:\nv_Q w_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 ≤ i ≤ Q) must contain the index of the lowest common ancestor of Vertex v_i and w_i.\n\nSample Input 1\n\n3 3\n5 7\n8 11\n3 9\n\nSample Output 1\n\n2\n1\n3\n\nThe queries in this case correspond to the examples shown in Notes.\n\nSample Input 2\n\n100000 2\n1 2\n3 4\n\nSample Output 2\n\n1\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 817, "cpu_time_ms": 233, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s772690178", "group_id": "codeNet:p03507", "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 %d\\n\" @@ fun n k ->\n  let wds = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun w d -> w, d in\n  Printf.printf \"%d\\n\" @@ lower_bound 0 (1 lsl 61) @@ fun x ->\n    ( <= ) k @@ Array.fold_right (fun (w, d) -> ( + ) @@\n      if x < w then 0\n      else 1 + (x - w) / d) wds 0\n", "language": "OCaml", "metadata": {"date": 1537337163, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03507.html", "problem_id": "p03507", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03507/input.txt", "sample_output_relpath": "derived/input_output/data/p03507/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03507/OCaml/s772690178.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772690178", "user_id": "u504158101"}, "prompt_components": {"gold_output": "50\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 %d\\n\" @@ fun n k ->\n  let wds = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun w d -> w, d in\n  Printf.printf \"%d\\n\" @@ lower_bound 0 (1 lsl 61) @@ fun x ->\n    ( <= ) k @@ Array.fold_right (fun (w, d) -> ( + ) @@\n      if x < w then 0\n      else 1 + (x - w) / d) wds 0\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn your garden, there is a long and narrow flowerbed that stretches infinitely to the east. You have decided to plant N kinds of flowers in this empty flowerbed. For convenience, we will call these N kinds of flowers Flower 1, 2, …, N. Also, we will call the position that is p centimeters from the west end of the flowerbed Position p.\n\nYou will plant Flower i (1 ≤ i ≤ N) as follows: first, plant one at Position w_i, then plant one every d_i centimeters endlessly toward the east. That is, Flower i will be planted at the positions w_i, w_i + d_i, w_i + 2 d_i, … Note that more than one flower may be planted at the same position.\n\nFind the position at which the K-th flower from the west is planted. If more than one flower is planted at the same position, they are counted individually.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^9\n\n1 ≤ w_i ≤ 10^{18}\n\n1 ≤ d_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nw_1 d_1\n:\nw_N d_N\n\nOutput\n\nWhen the K-th flower from the west is planted at Position X, print the value of X. (The westmost flower is counted as the 1-st flower.)\n\nSample Input 1\n\n2 6\n20 10\n25 15\n\nSample Output 1\n\n50\n\nTwo kinds of flowers are planted at the following positions:\n\nFlower 1: Position 20, 30, 40, 50, 60, …\n\nFlower 2: Position 25, 40, 55, 70, 85, …\n\nThe sixth flower from the west is the Flower 1 planted at Position 50. Note that the two flowers planted at Position 40 are counted individually.\n\nSample Input 2\n\n3 9\n10 10\n10 10\n10 10\n\nSample Output 2\n\n30\n\nThree flowers are planted at each of the positions 10, 20, 30, … Thus, the ninth flower from the west is planted at Position 30.\n\nSample Input 3\n\n1 1000000000\n1000000000000000000 1000000000\n\nSample Output 3\n\n1999999999000000000", "sample_input": "2 6\n20 10\n25 15\n"}, "reference_outputs": ["50\n"], "source_document_id": "p03507", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn your garden, there is a long and narrow flowerbed that stretches infinitely to the east. You have decided to plant N kinds of flowers in this empty flowerbed. For convenience, we will call these N kinds of flowers Flower 1, 2, …, N. Also, we will call the position that is p centimeters from the west end of the flowerbed Position p.\n\nYou will plant Flower i (1 ≤ i ≤ N) as follows: first, plant one at Position w_i, then plant one every d_i centimeters endlessly toward the east. That is, Flower i will be planted at the positions w_i, w_i + d_i, w_i + 2 d_i, … Note that more than one flower may be planted at the same position.\n\nFind the position at which the K-th flower from the west is planted. If more than one flower is planted at the same position, they are counted individually.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^9\n\n1 ≤ w_i ≤ 10^{18}\n\n1 ≤ d_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nw_1 d_1\n:\nw_N d_N\n\nOutput\n\nWhen the K-th flower from the west is planted at Position X, print the value of X. (The westmost flower is counted as the 1-st flower.)\n\nSample Input 1\n\n2 6\n20 10\n25 15\n\nSample Output 1\n\n50\n\nTwo kinds of flowers are planted at the following positions:\n\nFlower 1: Position 20, 30, 40, 50, 60, …\n\nFlower 2: Position 25, 40, 55, 70, 85, …\n\nThe sixth flower from the west is the Flower 1 planted at Position 50. Note that the two flowers planted at Position 40 are counted individually.\n\nSample Input 2\n\n3 9\n10 10\n10 10\n10 10\n\nSample Output 2\n\n30\n\nThree flowers are planted at each of the positions 10, 20, 30, … Thus, the ninth flower from the west is planted at Position 30.\n\nSample Input 3\n\n1 1000000000\n1000000000000000000 1000000000\n\nSample Output 3\n\n1999999999000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 182, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s762199305", "group_id": "codeNet:p03523", "input_text": "let s = read_line ()\nlet _ = print_endline @@ if Str.string_match (Str.regexp \"^A?KIHA?BA?RA?$\") s 0 then \"YES\" else \"NO\"", "language": "OCaml", "metadata": {"date": 1565889829, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/OCaml/s762199305.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762199305", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let s = read_line ()\nlet _ = print_endline @@ if Str.string_match (Str.regexp \"^A?KIHA?BA?RA?$\") s 0 then \"YES\" else \"NO\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s390496869", "group_id": "codeNet:p03543", "input_text": "let id x = x\nlet n = Scanf.scanf \"%s\\n\" id\n\nlet ans = if (n.[0] = n.[1] && n.[0] = n.[2]) || (n.[0] = n.[1] && n.[0] = n.[3]) || (n.[0] = n.[2] && n.[2] = n.[3]) || (n.[1] = n.[2] && n.[2] = n.[3]) then \"Yes\" else \"No\"\n\nlet () =\n  Printf.printf \"%s\\n\" ans", "language": "OCaml", "metadata": {"date": 1511057243, "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/s390496869.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s390496869", "user_id": "u735499035"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let id x = x\nlet n = Scanf.scanf \"%s\\n\" id\n\nlet ans = if (n.[0] = n.[1] && n.[0] = n.[2]) || (n.[0] = n.[1] && n.[0] = n.[3]) || (n.[0] = n.[2] && n.[2] = n.[3]) || (n.[1] = n.[2] && n.[2] = n.[3]) then \"Yes\" else \"No\"\n\nlet () =\n  Printf.printf \"%s\\n\" ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "sample_input": "1118\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03543", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 255, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s402665739", "group_id": "codeNet:p03544", "input_text": "open Batteries\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let n_bonacci nn n =\n    let rec fib_aux n res prevs =\n      if n <= 0 then (prevs, 0) else\n      if n = 1 then (prevs, res)\n      else \n        let tl = List.tl prevs in\n        let sum = List.fold_left (+) 0 prevs in\n        fib_aux (n-1) (res+sum) (tl @ [res])\n    in\n    let n = n-nn+1 in\n    fib_aux n 1 [2]\n  in\n  let lucas = n_bonacci 1 in\n  let _, ans = lucas n in\n\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1529240328, "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/s402665739.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s402665739", "user_id": "u139013163"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "open Batteries\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let n_bonacci nn n =\n    let rec fib_aux n res prevs =\n      if n <= 0 then (prevs, 0) else\n      if n = 1 then (prevs, res)\n      else \n        let tl = List.tl prevs in\n        let sum = List.fold_left (+) 0 prevs in\n        fib_aux (n-1) (res+sum) (tl @ [res])\n    in\n    let n = n-nn+1 in\n    fib_aux n 1 [2]\n  in\n  let lucas = n_bonacci 1 in\n  let _, ans = lucas n in\n\n  Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s866970202", "group_id": "codeNet:p03544", "input_text": "let luca = let rec f a b n = if n = 0 then a else f b (a+b) (n-1) in f 2 1\nlet () = Scanf.scanf \"%d\" luca |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519794650, "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/s866970202.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s866970202", "user_id": "u798181098"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let luca = let rec f a b n = if n = 0 then a else f b (a+b) (n-1) in f 2 1\nlet () = Scanf.scanf \"%d\" luca |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 130, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s477334627", "group_id": "codeNet:p03545", "input_text": "let words = Str.split (Str.regexp \" \")\nlet chars s = List.init (String.length s) (String.get s)\nlet (>>) f g x = g (f x)\n\nlet [a; b; c; d] = read_line () |> chars |> List.map (Char.escaped >> int_of_string)\n\nlet ans =\n  let rec solve bits =\n    let sign = List.init 3 (fun i -> if bits land (1 lsl i) <> 0 then 1 else -1) in\n    let x =\n      List.combine sign [b; c; d]\n      |> List.fold_left (fun acc pair -> acc + fst pair * snd pair) a\n    in\n    if x = 7 then bits else solve (bits + 1)\n  in solve 0\n\nlet () =\n  print_int a;\n  print_string (if ans land 1 <> 0 then \"+\" else \"-\");\n  print_int b;\n  print_string (if ans land 2 <> 0 then \"+\" else \"-\");\n  print_int c;\n  print_string (if ans land 4 <> 0 then \"+\" else \"-\");\n  print_int d;\n  print_string \"=7\";\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1595099430, "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/s477334627.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s477334627", "user_id": "u630185395"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "let words = Str.split (Str.regexp \" \")\nlet chars s = List.init (String.length s) (String.get s)\nlet (>>) f g x = g (f x)\n\nlet [a; b; c; d] = read_line () |> chars |> List.map (Char.escaped >> int_of_string)\n\nlet ans =\n  let rec solve bits =\n    let sign = List.init 3 (fun i -> if bits land (1 lsl i) <> 0 then 1 else -1) in\n    let x =\n      List.combine sign [b; c; d]\n      |> List.fold_left (fun acc pair -> acc + fst pair * snd pair) a\n    in\n    if x = 7 then bits else solve (bits + 1)\n  in solve 0\n\nlet () =\n  print_int a;\n  print_string (if ans land 1 <> 0 then \"+\" else \"-\");\n  print_int b;\n  print_string (if ans land 2 <> 0 then \"+\" else \"-\");\n  print_int c;\n  print_string (if ans land 4 <> 0 then \"+\" else \"-\");\n  print_int d;\n  print_string \"=7\";\n  print_newline ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s471529865", "group_id": "codeNet:p03545", "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\n\nlet int_to_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\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\n\nlet abcd = read_line () |> explode |> List.map Char.escaped |> List.map int_of_string\n\nlet rec eval nums ops =\n  match nums with\n  | [] -> 0\n  | first :: rest -> \n    match ops with\n    | [] -> first\n    | f :: r -> if f = \"+\" then first + eval rest r else first - eval rest r\n\nlet rec get_eval_text nums ops =\n  match nums with\n  | [] -> \"\"\n  | first :: rest -> \n    match ops with\n    | [] -> string_of_int first\n    | f :: r -> if f = \"+\" then string_of_int first ^ \"+\" ^ get_eval_text rest r else string_of_int first ^ \"-\" ^ get_eval_text rest r\n\nlet get_ops bit n =\n  let rec get i =\n    match i with \n    | i when i = n -> []\n    | _ -> if is_bit_one bit i then \"+\" :: get (i+1) else \"-\" :: get (i+1)\n  in get 0\n\nlet rec ans bit =\n  match bit with\n  | bit when bit >= 3 * 3 -> \"\"\n  | _ -> if eval abcd (get_ops bit 3) = 7 then get_eval_text abcd (get_ops bit 3) else ans (bit+1)\n\nlet _ = print_endline @@ (ans 0) ^ \"=7\"", "language": "OCaml", "metadata": {"date": 1585083955, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s471529865.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s471529865", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1+2+2+2=7\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\n\nlet int_to_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\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\n\nlet abcd = read_line () |> explode |> List.map Char.escaped |> List.map int_of_string\n\nlet rec eval nums ops =\n  match nums with\n  | [] -> 0\n  | first :: rest -> \n    match ops with\n    | [] -> first\n    | f :: r -> if f = \"+\" then first + eval rest r else first - eval rest r\n\nlet rec get_eval_text nums ops =\n  match nums with\n  | [] -> \"\"\n  | first :: rest -> \n    match ops with\n    | [] -> string_of_int first\n    | f :: r -> if f = \"+\" then string_of_int first ^ \"+\" ^ get_eval_text rest r else string_of_int first ^ \"-\" ^ get_eval_text rest r\n\nlet get_ops bit n =\n  let rec get i =\n    match i with \n    | i when i = n -> []\n    | _ -> if is_bit_one bit i then \"+\" :: get (i+1) else \"-\" :: get (i+1)\n  in get 0\n\nlet rec ans bit =\n  match bit with\n  | bit when bit >= 3 * 3 -> \"\"\n  | _ -> if eval abcd (get_ops bit 3) = 7 then get_eval_text abcd (get_ops bit 3) else ans (bit+1)\n\nlet _ = print_endline @@ (ans 0) ^ \"=7\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1347, "cpu_time_ms": 5, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s417902888", "group_id": "codeNet:p03545", "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 read n = 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 rec search vals str sum goal =\n  match vals with\n  | [] ->\n     if sum = goal\n     then Some str\n     else None\n  | x :: xs ->\n     (* case + *)\n     let case_plus = search xs (str ^ \"+\" ^ string_of_int x) (sum + x) goal in\n     ( match case_plus with\n       | None -> search xs (str ^ \"-\" ^ string_of_int x) (sum - x) goal\n       | _ -> case_plus )\n\nlet () =\n  let s = read_str () in\n  let vals = S.to_array s |> A.map int_of_char |> A.to_list in\n  let vals = L.map (fun x -> x - int_of_char '0') vals in\n  let head = L.hd vals in\n  let tail = L.tl vals in\n  let res = search tail (string_of_int head) head 7 in\n  match res with\n  | None -> ()\n  | Some x -> pf \"%s=7\\n\" x\n  \n", "language": "OCaml", "metadata": {"date": 1514970271, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s417902888.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417902888", "user_id": "u748871552"}, "prompt_components": {"gold_output": "1+2+2+2=7\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 read n = 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 rec search vals str sum goal =\n  match vals with\n  | [] ->\n     if sum = goal\n     then Some str\n     else None\n  | x :: xs ->\n     (* case + *)\n     let case_plus = search xs (str ^ \"+\" ^ string_of_int x) (sum + x) goal in\n     ( match case_plus with\n       | None -> search xs (str ^ \"-\" ^ string_of_int x) (sum - x) goal\n       | _ -> case_plus )\n\nlet () =\n  let s = read_str () in\n  let vals = S.to_array s |> A.map int_of_char |> A.to_list in\n  let vals = L.map (fun x -> x - int_of_char '0') vals in\n  let head = L.hd vals in\n  let tail = L.tl vals in\n  let res = search tail (string_of_int head) head 7 in\n  match res with\n  | None -> ()\n  | Some x -> pf \"%s=7\\n\" x\n  \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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1368, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s912443218", "group_id": "codeNet:p03546", "input_text": "Scanf.scanf \"%d %d\" (fun h w ->\n    let c = Array.init 10 (fun _ ->\n        Array.init 10 (fun _ -> Scanf.scanf \" %d\" (fun c -> c)))\n    in\n    let d = Array.make 10 0 in\n    for i = 1 to h do\n        for j = 1 to w do\n            Scanf.scanf \" %d\" (fun a ->\n                if a >= 0 then d.(a) <- d.(a) + 1\n            )\n        done\n    done;\n    for k = 0 to 9 do\n        for i = 0 to 9 do\n            for j = 0 to 9 do\n                c.(i).(j) <- min c.(i).(j) (c.(i).(k) + c.(k).(j))\n            done\n        done\n    done;\n    let rec loop i acc =\n        if i = 10 then acc else loop (i + 1) (acc + d.(i) * c.(i).(1))\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1599104289, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s912443218.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s912443218", "user_id": "u342443598"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun h w ->\n    let c = Array.init 10 (fun _ ->\n        Array.init 10 (fun _ -> Scanf.scanf \" %d\" (fun c -> c)))\n    in\n    let d = Array.make 10 0 in\n    for i = 1 to h do\n        for j = 1 to w do\n            Scanf.scanf \" %d\" (fun a ->\n                if a >= 0 then d.(a) <- d.(a) + 1\n            )\n        done\n    done;\n    for k = 0 to 9 do\n        for i = 0 to 9 do\n            for j = 0 to 9 do\n                c.(i).(j) <- min c.(i).(j) (c.(i).(k) + c.(k).(j))\n            done\n        done\n    done;\n    let rec loop i acc =\n        if i = 10 then acc else loop (i + 1) (acc + d.(i) * c.(i).(1))\n    in\n    loop 0 0 |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 22, "memory_kb": 5932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s313111302", "group_id": "codeNet:p03546", "input_text": "let () =\n  Scanf.scanf \"%d %d\" @@ fun h w ->\n\n  let c = Array.init 10 (fun _ -> Array.init 10 (fun _ -> Scanf.scanf \" %d\" ((+) 0))) in\n  for k = 0 to 9 do\n    for i = 0 to 9 do\n      for j = 0 to 9 do\n        c.(i).(j) <- min c.(i).(j) (c.(i).(k) + c.(k).(j))\n  done done done;\n\n  Array.init (h*w) (fun _ -> Scanf.scanf \" %d\" ((+) 0))\n  |> Array.fold_left (fun s e ->\n      if e = -1 then s else s + c.(e).(1)) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1532752870, "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/s313111302.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s313111302", "user_id": "u798181098"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" @@ fun h w ->\n\n  let c = Array.init 10 (fun _ -> Array.init 10 (fun _ -> Scanf.scanf \" %d\" ((+) 0))) in\n  for k = 0 to 9 do\n    for i = 0 to 9 do\n      for j = 0 to 9 do\n        c.(i).(j) <- min c.(i).(j) (c.(i).(k) + c.(k).(j))\n  done done done;\n\n  Array.init (h*w) (fun _ -> Scanf.scanf \" %d\" ((+) 0))\n  |> Array.fold_left (fun s e ->\n      if e = -1 then s else s + c.(e).(1)) 0\n  |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 10, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s243989682", "group_id": "codeNet:p03547", "input_text": "let x, y = Scanf.scanf \"%s %s\" @@ fun a b -> a, b\nlet ans  = if x > y then \">\" else if x = y then \"=\" else \"<\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588007593, "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/s243989682.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s243989682", "user_id": "u307426615"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "let x, y = Scanf.scanf \"%s %s\" @@ fun a b -> a, b\nlet ans  = if x > y then \">\" else if x = y then \"=\" else \"<\"\nlet () = print_endline ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s876288323", "group_id": "codeNet:p03547", "input_text": "let () = Scanf.scanf \"%x %x\" @@ fun x y ->\n  print_endline @@\n  match compare x y with\n  | -1 -> \"<\"\n  | 0  -> \"=\"\n  | 1  -> \">\"", "language": "OCaml", "metadata": {"date": 1530667045, "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/s876288323.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s876288323", "user_id": "u504158101"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "let () = Scanf.scanf \"%x %x\" @@ fun x y ->\n  print_endline @@\n  match compare x y with\n  | -1 -> \"<\"\n  | 0  -> \"=\"\n  | 1  -> \">\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s777230102", "group_id": "codeNet:p03550", "input_text": "Scanf.scanf \"%d %d %d\" (fun n z w ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let a1 = abs (w - a.(n - 1)) in\n    let a2 = if n = 1 then a1 else abs (a.(n - 1) - a.(n - 2)) in\n    Printf.printf \"%d\\n\" @@ max a1 a2\n)", "language": "OCaml", "metadata": {"date": 1589612753, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03550.html", "problem_id": "p03550", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03550/input.txt", "sample_output_relpath": "derived/input_output/data/p03550/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03550/OCaml/s777230102.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777230102", "user_id": "u342443598"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n z w ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let a1 = abs (w - a.(n - 1)) in\n    let a2 = if n = 1 then a1 else abs (a.(n - 1) - a.(n - 2)) in\n    Printf.printf \"%d\\n\" @@ max a1 a2\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03550", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 3, "memory_kb": 2944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s457883907", "group_id": "codeNet:p03552", "input_text": "let memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x =\n    try Hashtbl.find dp x with\n    | Not_found ->\n        let result = f get x in\n        Hashtbl.add dp x result;\n        result in\n  get\n\nlet () =\n  let n, z, w = Scanf.scanf \"%d %d %d\\n\" (fun n z w -> n, z, w) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let as' = Array.init (n + 2) (function 0 -> z | 1 -> w | i -> as_.(i - 2)) in\n  let solve = memoize (n * n) (fun self (i, j) ->\n    if j = n + 1 then abs (as'.(i) - as'.(j)), abs (as'.(i) - as'.(j))\n    else\n      Array.init (n - j + 1) (fun k -> self (j, 1 + k + j))\n      |> Array.fold_left (fun (z, w) (x, y) -> (max z x, min w y)) (min_int, max_int)) in\n  Printf.printf \"%d\\n\" @@ fst @@ solve (0, 1)", "language": "OCaml", "metadata": {"date": 1510462360, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03552.html", "problem_id": "p03552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03552/input.txt", "sample_output_relpath": "derived/input_output/data/p03552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03552/OCaml/s457883907.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s457883907", "user_id": "u504158101"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "let memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x =\n    try Hashtbl.find dp x with\n    | Not_found ->\n        let result = f get x in\n        Hashtbl.add dp x result;\n        result in\n  get\n\nlet () =\n  let n, z, w = Scanf.scanf \"%d %d %d\\n\" (fun n z w -> n, z, w) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let as' = Array.init (n + 2) (function 0 -> z | 1 -> w | i -> as_.(i - 2)) in\n  let solve = memoize (n * n) (fun self (i, j) ->\n    if j = n + 1 then abs (as'.(i) - as'.(j)), abs (as'.(i) - as'.(j))\n    else\n      Array.init (n - j + 1) (fun k -> self (j, 1 + k + j))\n      |> Array.fold_left (fun (z, w) (x, y) -> (max z x, min w y)) (min_int, max_int)) in\n  Printf.printf \"%d\\n\" @@ fst @@ solve (0, 1)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03552", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 758, "cpu_time_ms": 2105, "memory_kb": 66816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s371731607", "group_id": "codeNet:p03555", "input_text": "let a = Scanf.scanf \"%s %s %s\" @@ fun a b c -> Array.of_list [a; b; c]\nlet b = Scanf.scanf \"%s %s %s\" @@ fun a b c -> Array.of_list [a; b; c]\nlet ans = if a.(0) = b.(2) && a.(1) = b.(1) && a.(2) = b.(0) then \"YES\" else \"NO\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588007171, "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/s371731607.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s371731607", "user_id": "u307426615"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let a = Scanf.scanf \"%s %s %s\" @@ fun a b c -> Array.of_list [a; b; c]\nlet b = Scanf.scanf \"%s %s %s\" @@ fun a b c -> Array.of_list [a; b; c]\nlet ans = if a.(0) = b.(2) && a.(1) = b.(1) && a.(2) = b.(0) then \"YES\" else \"NO\"\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "sample_input": "pot\ntop\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03555", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s379710075", "group_id": "codeNet:p03555", "input_text": "let string_rev s =\n  let len = String.length s in\n  String.init len (fun i -> s.[len - 1 - i]);;\nlet str_eq s1 s2 = s1=s2;;\nlet f s1 s2 = if s1=(string_rev s2) then \"YES\" else \"NO\";;\nlet () = Scanf.scanf \"%s %s\" f |> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1561096271, "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/s379710075.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379710075", "user_id": "u635974378"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let string_rev s =\n  let len = String.length s in\n  String.init len (fun i -> s.[len - 1 - i]);;\nlet str_eq s1 s2 = s1=s2;;\nlet f s1 s2 = if s1=(string_rev s2) then \"YES\" else \"NO\";;\nlet () = Scanf.scanf \"%s %s\" f |> Printf.printf \"%s\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s633325565", "group_id": "codeNet:p03556", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc077/tasks/abc077_b\n * implementation, math\n * *)\nScanf.scanf \"%f\\n\" (fun x -> x)\n|> sqrt\n|> int_of_float\n|> (fun x -> x * x)\n|> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1593913205, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s633325565.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633325565", "user_id": "u737840172"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc077/tasks/abc077_b\n * implementation, math\n * *)\nScanf.scanf \"%f\\n\" (fun x -> x)\n|> sqrt\n|> int_of_float\n|> (fun x -> x * x)\n|> Printf.printf \"%d\\n\"\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03556", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s562941675", "group_id": "codeNet:p03556", "input_text": "let n, k = read_int (), ref 1\nlet _ = while (!k + 1) * (!k + 1) <= n do incr k done; Printf.printf \"%d\\n\" @@ !k * !k", "language": "OCaml", "metadata": {"date": 1575775054, "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/s562941675.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s562941675", "user_id": "u732304692"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let n, k = read_int (), ref 1\nlet _ = while (!k + 1) * (!k + 1) <= n do incr k done; Printf.printf \"%d\\n\" @@ !k * !k", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03556", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s923116940", "group_id": "codeNet:p03557", "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\nlet n = scan \"%d\" id\nlet a = scan_array ~sep: ' ' Int.of_string\nlet b = scan_array ~sep: ' ' Int.of_string\nlet c = scan_array ~sep: ' ' Int.of_string\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  ArrayL.map b ~f:(fun v ->\n      let i = lower_bound (Array.length a) (fun i -> v <= a.(i)) in\n      let j = lower_bound (Array.length c) (fun i -> v <= c.(i)) in\n      i * (Array.length c - j))\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1591482511, "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/s923116940.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s923116940", "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 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 = scan \"%d\" id\nlet a = scan_array ~sep: ' ' Int.of_string\nlet b = scan_array ~sep: ' ' Int.of_string\nlet c = scan_array ~sep: ' ' Int.of_string\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  ArrayL.map b ~f:(fun v ->\n      let i = lower_bound (Array.length a) (fun i -> v <= a.(i)) in\n      let j = lower_bound (Array.length c) (fun i -> v <= c.(i)) in\n      i * (Array.length c - j))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2285, "cpu_time_ms": 218, "memory_kb": 19100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s322371963", "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 lena = Array.length a in\n  let lenb = Array.length b in\n  let lenc = Array.length c in\n  let d = Array.of_list @@\n    ListL.map (0 ++^ lenb) ~f:(fun i ->\n        match Array.bsearch Int.ord c b.(i) with\n        | `At i | `Just_after i -> lenc - (succ i)\n        | `All_bigger -> lenc\n        | _ -> 0) in\n  ListL.iter (List.rev @@ 0 ++^ Array.length d) ~f:(fun i ->\n      if i - 1 >= 0 then\n        d.(i-1) <- d.(i-1) + d.(i));\n  ListL.map (0 ++^ lena) ~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": 1587267296, "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/s322371963.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s322371963", "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 lena = Array.length a in\n  let lenb = Array.length b in\n  let lenc = Array.length c in\n  let d = Array.of_list @@\n    ListL.map (0 ++^ lenb) ~f:(fun i ->\n        match Array.bsearch Int.ord c b.(i) with\n        | `At i | `Just_after i -> lenc - (succ i)\n        | `All_bigger -> lenc\n        | _ -> 0) in\n  ListL.iter (List.rev @@ 0 ++^ Array.length d) ~f:(fun i ->\n      if i - 1 >= 0 then\n        d.(i-1) <- d.(i-1) + d.(i));\n  ListL.map (0 ++^ lena) ~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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2389, "cpu_time_ms": 267, "memory_kb": 19132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s332425714", "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 lena = Array.length a in\n  let lenb = Array.length b in\n  let lenc = Array.length c in\n  ListL.map (0 ++^ lena) ~f:(fun i ->\n      match match Array.bsearch Int.ord b a.(i) with\n        | `At i | `Just_after i -> Some (succ i)\n        | `All_bigger -> Some 0\n        | _ -> None\n      with\n      | Some i ->\n        ListL.map (i ++^ lenb) ~f:(fun j ->\n            match Array.bsearch Int.ord c b.(j) with\n            | `At i | `Just_after i ->\n              lenc - i - 1\n            | `All_bigger -> lenc\n            | _ -> 0)\n        |> List.sum\n      | None -> 0\n    )\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1587266695, "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/s332425714.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s332425714", "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 lena = Array.length a in\n  let lenb = Array.length b in\n  let lenc = Array.length c in\n  ListL.map (0 ++^ lena) ~f:(fun i ->\n      match match Array.bsearch Int.ord b a.(i) with\n        | `At i | `Just_after i -> Some (succ i)\n        | `All_bigger -> Some 0\n        | _ -> None\n      with\n      | Some i ->\n        ListL.map (i ++^ lenb) ~f:(fun j ->\n            match Array.bsearch Int.ord c b.(j) with\n            | `At i | `Just_after i ->\n              lenc - i - 1\n            | `All_bigger -> lenc\n            | _ -> 0)\n        |> List.sum\n      | None -> 0\n    )\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2358, "cpu_time_ms": 2105, "memory_kb": 25460}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s684984074", "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\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  let lenb = Array.length b in\n  let lenc = Array.length c in\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 (pred lenb))\n          ~f:(fun vb ->\n              match Array.bsearch Int.ord c vb with\n              | `At i | `Just_after i ->\n                lenc - i - 1\n              | `All_bigger -> lenc\n              | _ -> 0)\n        |> Array.sum\n      | None -> 0)\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1587266129, "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/s684984074.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s684984074", "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\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  let lenb = Array.length b in\n  let lenc = Array.length c in\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 (pred lenb))\n          ~f:(fun vb ->\n              match Array.bsearch Int.ord c vb with\n              | `At i | `Just_after i ->\n                lenc - i - 1\n              | `All_bigger -> lenc\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2336, "cpu_time_ms": 2104, "memory_kb": 23984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s724911621", "group_id": "codeNet:p03557", "input_text": "open Scanf\nlet id x = x\nlet read_int _ = scanf \" %d\" id\nlet () =\n  let n = scanf \" %d\" id in\n  let a = Array.init n read_int in\n  let b = Array.init n read_int in\n  let c = Array.init n read_int in\n  Array.sort (-) a; Array.sort (-) b; Array.sort (-) c;\n  let f u v =\n    let res = Array.make n 0 in\n    let rec g a i =\n      if i >= n then ()\n      else if a = n then (\n        res.(i) <- n; g n (i+1)\n      ) else if v.(i) <= u.(a) then (\n        res.(i) <- a; g a (i+1)\n      ) else g (a+1) i in\n    g 0 0; res in\n  let ab = f a b in\n  let bc = f b c in\n  Array.iteri (fun i e -> if i > 0 then ab.(i) <- e + ab.(i-1)) ab;\n  Array.map (fun e -> if e = 0 then 0 else ab.(e-1)) bc\n  |> Array.fold_left (+) 0 |> Printf.printf \"%d\\n\"\n\n\n", "language": "OCaml", "metadata": {"date": 1519632966, "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/s724911621.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s724911621", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Scanf\nlet id x = x\nlet read_int _ = scanf \" %d\" id\nlet () =\n  let n = scanf \" %d\" id in\n  let a = Array.init n read_int in\n  let b = Array.init n read_int in\n  let c = Array.init n read_int in\n  Array.sort (-) a; Array.sort (-) b; Array.sort (-) c;\n  let f u v =\n    let res = Array.make n 0 in\n    let rec g a i =\n      if i >= n then ()\n      else if a = n then (\n        res.(i) <- n; g n (i+1)\n      ) else if v.(i) <= u.(a) then (\n        res.(i) <- a; g a (i+1)\n      ) else g (a+1) i in\n    g 0 0; res in\n  let ab = f a b in\n  let bc = f b c in\n  Array.iteri (fun i e -> if i > 0 then ab.(i) <- e + ab.(i-1)) ab;\n  Array.map (fun e -> if e = 0 then 0 else ab.(e-1)) bc\n  |> Array.fold_left (+) 0 |> Printf.printf \"%d\\n\"\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 734, "cpu_time_ms": 193, "memory_kb": 7936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s640395726", "group_id": "codeNet:p03559", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init (n + 1) (fun i -> if i = n then max_int else Scanf.scanf \" %d\" (fun a -> a)) in\n    let b = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun b -> b)) in\n    let c = Array.init (n + 1) (fun i -> if i = n then max_int else Scanf.scanf \" %d\" (fun c -> c)) in\n    Array.sort compare a;\n    Array.sort compare b;\n    Array.sort compare c;\n    let lower arr target =\n        let rec bin left right =\n            if left = right then left else\n                let m = (left + right) / 2 in\n                if arr.(m) < target then bin (m + 1) right\n                                    else bin left m\n        in\n        bin 0 n\n    in\n    let rec loop i acc =\n        if i = n then acc else\n            let acc = acc + lower a b.(i) * (n - lower c (b.(i) + 1)) in\n            loop (i + 1) acc\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1584086380, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03559.html", "problem_id": "p03559", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03559/input.txt", "sample_output_relpath": "derived/input_output/data/p03559/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03559/OCaml/s640395726.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s640395726", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init (n + 1) (fun i -> if i = n then max_int else Scanf.scanf \" %d\" (fun a -> a)) in\n    let b = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun b -> b)) in\n    let c = Array.init (n + 1) (fun i -> if i = n then max_int else Scanf.scanf \" %d\" (fun c -> c)) in\n    Array.sort compare a;\n    Array.sort compare b;\n    Array.sort compare c;\n    let lower arr target =\n        let rec bin left right =\n            if left = right then left else\n                let m = (left + right) / 2 in\n                if arr.(m) < target then bin (m + 1) right\n                                    else bin left m\n        in\n        bin 0 n\n    in\n    let rec loop i acc =\n        if i = n then acc else\n            let acc = acc + lower a b.(i) * (n - lower c (b.(i) + 1)) in\n            loop (i + 1) acc\n    in\n    loop 0 0 |> 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": "p03559", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 878, "cpu_time_ms": 273, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s295385867", "group_id": "codeNet:p03559", "input_text": "(** val add : int -> int -> int **)\n\nlet rec add = ( + )\n\n(** val sub : int -> int -> int **)\n\nlet rec sub = ( - )\n\nmodule Nat =\n struct\n  (** val div2 : int -> int **)\n\n  let rec div2 = (fun x -> x / 2)\n end\n\n(** val lower_bound_aux : (int -> bool) -> int -> int -> int **)\n\nlet rec lower_bound_aux p_dec x x0 =\n  (fun fO fS n -> if n = 0 then fO () else fS (n-1))\n    (fun _ ->\n    x)\n    (fun n0 ->\n    if p_dec (add x (Nat.div2 (succ n0)))\n    then lower_bound_aux p_dec x (Nat.div2 (succ n0))\n    else lower_bound_aux p_dec (add (succ (Nat.div2 (succ n0))) x)\n           (sub (succ n0) (succ (Nat.div2 (succ n0)))))\n    x0\n\n(** val lower_bound : (int -> bool) -> int -> int -> int **)\n\nlet lower_bound p_dec alpha beta =\n  lower_bound_aux p_dec alpha (sub beta alpha)\n\n(** val upper_bound_obligation_1 : (int -> bool) -> int -> bool **)\n\nlet upper_bound_obligation_1 p_dec n =\n  let s = p_dec (succ n) in if s then false else true\n\n(** val upper_bound : (int -> bool) -> int -> int -> int **)\n\nlet upper_bound p_dec =\n  lower_bound (upper_bound_obligation_1 p_dec)\n\n(** val upper_bound : (int -> bool) -> int -> int -> int **)\n\nlet upper_bound p_dec =\n  lower_bound (upper_bound_obligation_1 p_dec)\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let bs = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun b -> b)) in\n  let cs = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun c -> c)) in\n  Array.sort compare as_;\n  Array.sort compare bs;\n  Array.sort compare cs;\n  let cbs = Array.map (fun c -> lower_bound (fun j -> try c < bs.(j) with _ -> true) 0 n) cs in\n  let bas = Array.map (fun b -> lower_bound (fun i -> try b < as_.(i) with _ -> true) 0 n) bs in\n  let sum_ba = Array.make n 0 in\n  sum_ba.(0) <- bas.(0);\n  for i = 1 to n - 1 do\n    sum_ba.(i) <- bas.(i) - bas.(i - 1) + sum_ba.(i - 1)\n  done;\n  let sum_cb = Array.make n 0 in\n  for i = 0 to cbs.(0) - 1 do\n    sum_cb.(0) <- sum_ba.(i) + sum_cb.(0)\n  done;\n  for i = 1 to n - 1 do\n    for j = cbs.(i - 1) to cbs.(i) - 1 do\n      sum_cb.(i) <- sum_ba.(j) + sum_cb.(i)\n    done;\n    sum_cb.(i) <- sum_cb.(i - 1) + sum_cb.(i)\n  done;\n  for i = 1 to n - 1 do\n    sum_cb.(i) <- sum_cb.(i - 1) + sum_cb.(i);\n  done;\n  Printf.printf \"%d\\n\" sum_cb.(n - 1)", "language": "OCaml", "metadata": {"date": 1509854707, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03559.html", "problem_id": "p03559", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03559/input.txt", "sample_output_relpath": "derived/input_output/data/p03559/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03559/OCaml/s295385867.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s295385867", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(** val add : int -> int -> int **)\n\nlet rec add = ( + )\n\n(** val sub : int -> int -> int **)\n\nlet rec sub = ( - )\n\nmodule Nat =\n struct\n  (** val div2 : int -> int **)\n\n  let rec div2 = (fun x -> x / 2)\n end\n\n(** val lower_bound_aux : (int -> bool) -> int -> int -> int **)\n\nlet rec lower_bound_aux p_dec x x0 =\n  (fun fO fS n -> if n = 0 then fO () else fS (n-1))\n    (fun _ ->\n    x)\n    (fun n0 ->\n    if p_dec (add x (Nat.div2 (succ n0)))\n    then lower_bound_aux p_dec x (Nat.div2 (succ n0))\n    else lower_bound_aux p_dec (add (succ (Nat.div2 (succ n0))) x)\n           (sub (succ n0) (succ (Nat.div2 (succ n0)))))\n    x0\n\n(** val lower_bound : (int -> bool) -> int -> int -> int **)\n\nlet lower_bound p_dec alpha beta =\n  lower_bound_aux p_dec alpha (sub beta alpha)\n\n(** val upper_bound_obligation_1 : (int -> bool) -> int -> bool **)\n\nlet upper_bound_obligation_1 p_dec n =\n  let s = p_dec (succ n) in if s then false else true\n\n(** val upper_bound : (int -> bool) -> int -> int -> int **)\n\nlet upper_bound p_dec =\n  lower_bound (upper_bound_obligation_1 p_dec)\n\n(** val upper_bound : (int -> bool) -> int -> int -> int **)\n\nlet upper_bound p_dec =\n  lower_bound (upper_bound_obligation_1 p_dec)\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let bs = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun b -> b)) in\n  let cs = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun c -> c)) in\n  Array.sort compare as_;\n  Array.sort compare bs;\n  Array.sort compare cs;\n  let cbs = Array.map (fun c -> lower_bound (fun j -> try c < bs.(j) with _ -> true) 0 n) cs in\n  let bas = Array.map (fun b -> lower_bound (fun i -> try b < as_.(i) with _ -> true) 0 n) bs in\n  let sum_ba = Array.make n 0 in\n  sum_ba.(0) <- bas.(0);\n  for i = 1 to n - 1 do\n    sum_ba.(i) <- bas.(i) - bas.(i - 1) + sum_ba.(i - 1)\n  done;\n  let sum_cb = Array.make n 0 in\n  for i = 0 to cbs.(0) - 1 do\n    sum_cb.(0) <- sum_ba.(i) + sum_cb.(0)\n  done;\n  for i = 1 to n - 1 do\n    for j = cbs.(i - 1) to cbs.(i) - 1 do\n      sum_cb.(i) <- sum_ba.(j) + sum_cb.(i)\n    done;\n    sum_cb.(i) <- sum_cb.(i - 1) + sum_cb.(i)\n  done;\n  for i = 1 to n - 1 do\n    sum_cb.(i) <- sum_cb.(i - 1) + sum_cb.(i);\n  done;\n  Printf.printf \"%d\\n\" sum_cb.(n - 1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03559", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2286, "cpu_time_ms": 297, "memory_kb": 8832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s405631995", "group_id": "codeNet:p03563", "input_text": "Scanf.scanf \"%d %d\" (fun r g ->\n    Printf.printf \"%d\\n\" @@ g * 2 - r\n)", "language": "OCaml", "metadata": {"date": 1601092728, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s405631995.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405631995", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun r g ->\n    Printf.printf \"%d\\n\" @@ g * 2 - r\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 71, "cpu_time_ms": 3, "memory_kb": 3792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s463729832", "group_id": "codeNet:p03563", "input_text": "let r = read_int ()\nlet g = read_int ()\nlet () = print_int (g * 2 - r)", "language": "OCaml", "metadata": {"date": 1588003588, "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/s463729832.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463729832", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "let r = read_int ()\nlet g = read_int ()\nlet () = print_int (g * 2 - r)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s359362756", "group_id": "codeNet:p03563", "input_text": "Scanf.scanf \"%d %d\" @@ fun r g -> Printf.printf \"%d\\n\" @@ 2 * g - r", "language": "OCaml", "metadata": {"date": 1562069353, "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/s359362756.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359362756", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun r g -> Printf.printf \"%d\\n\" @@ 2 * g - r", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s594724188", "group_id": "codeNet:p03564", "input_text": "let n = read_int ()\nlet k, ans = read_int (), ref max_int\nlet _ = for i = 0 to n do let x = ref 1 in for j = 1 to i do x := !x * 2 done; x := !x + (n - i) * k; ans := min !ans !x done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1576064241, "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/s594724188.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594724188", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let n = read_int ()\nlet k, ans = read_int (), ref max_int\nlet _ = for i = 0 to n do let x = ref 1 in for j = 1 to i do x := !x * 2 done; x := !x + (n - i) * k; ans := min !ans !x done; 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s499774573", "group_id": "codeNet:p03564", "input_text": "Scanf.scanf\" %d %d\"@@fun n k->\nlet rec f v = function\n| 0 -> v\n| i -> min (f (v*2) (i-1)) (f (v+k) (i-1))\nin f 1 n |> print_int", "language": "OCaml", "metadata": {"date": 1540824194, "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/s499774573.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499774573", "user_id": "u481480055"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "Scanf.scanf\" %d %d\"@@fun n k->\nlet rec f v = function\n| 0 -> v\n| i -> min (f (v*2) (i-1)) (f (v+k) (i-1))\nin f 1 n |> print_int", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s564360254", "group_id": "codeNet:p03564", "input_text": "let rec foldn n f v = if n = 0 then v else foldn (n-1) f (f v)\nlet () =\n  let n, k = Scanf.scanf \"%d %d\" (fun n k -> n, k) in\n  foldn n (fun a -> min (2*a) (a+k)) 1 |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519794248, "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/s564360254.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s564360254", "user_id": "u798181098"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec foldn n f v = if n = 0 then v else foldn (n-1) f (f v)\nlet () =\n  let n, k = Scanf.scanf \"%d %d\" (fun n k -> n, k) in\n  foldn n (fun a -> min (2*a) (a+k)) 1 |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s540334027", "group_id": "codeNet:p03567", "input_text": "let s = read_line ()\nlet _ = print_endline @@ try Str.search_forward (Str.regexp \"AC\") s 0 |> ignore; \"Yes\" with _ -> \"No\"", "language": "OCaml", "metadata": {"date": 1563842546, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03567.html", "problem_id": "p03567", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03567/input.txt", "sample_output_relpath": "derived/input_output/data/p03567/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03567/OCaml/s540334027.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s540334027", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line ()\nlet _ = print_endline @@ try Str.search_forward (Str.regexp \"AC\") s 0 |> ignore; \"Yes\" with _ -> \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke built an online judge to hold a programming contest.\n\nWhen a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.\n(The judge can return any two-character substring of S.)\n\nDetermine whether the judge can return the string AC as the verdict to a program.\n\nConstraints\n\n2 \\leq |S| \\leq 5\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.\n\nSample Input 1\n\nBACD\n\nSample Output 1\n\nYes\n\nThe string AC appears in BACD as a contiguous substring (the second and third characters).\n\nSample Input 2\n\nABCD\n\nSample Output 2\n\nNo\n\nAlthough the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.\n\nSample Input 3\n\nCABD\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nACACA\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nXX\n\nSample Output 5\n\nNo", "sample_input": "BACD\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03567", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke built an online judge to hold a programming contest.\n\nWhen a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.\n(The judge can return any two-character substring of S.)\n\nDetermine whether the judge can return the string AC as the verdict to a program.\n\nConstraints\n\n2 \\leq |S| \\leq 5\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.\n\nSample Input 1\n\nBACD\n\nSample Output 1\n\nYes\n\nThe string AC appears in BACD as a contiguous substring (the second and third characters).\n\nSample Input 2\n\nABCD\n\nSample Output 2\n\nNo\n\nAlthough the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.\n\nSample Input 3\n\nCABD\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nACACA\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nXX\n\nSample Output 5\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s056961566", "group_id": "codeNet:p03568", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet t, o = Array.fold_left (fun (t, o) a -> t * 3, o * if a mod 2 = 0 then 2 else 1) (1, 1) a_s\nlet _ = Printf.printf \"%d\\n\" @@ t - o", "language": "OCaml", "metadata": {"date": 1569116548, "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/s056961566.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056961566", "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 t, o = Array.fold_left (fun (t, o) a -> t * 3, o * if a mod 2 = 0 then 2 else 1) (1, 1) a_s\nlet _ = Printf.printf \"%d\\n\" @@ t - o", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "sample_input": "2\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03568", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s603618802", "group_id": "codeNet:p03573", "input_text": "open Scanf\nopen Printf\n\nlet () = sscanf (read_line ()) \"%d %d %d\" (fun a b c ->\n  if a = b then c\n  else if a = c then b\n  else a\n  )\n  |> printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595935635, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s603618802.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603618802", "user_id": "u272377260"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () = sscanf (read_line ()) \"%d %d %d\" (fun a b c ->\n  if a = b then c\n  else if a = c then b\n  else a\n  )\n  |> printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "sample_input": "5 7 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03573", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 6, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s314999938", "group_id": "codeNet:p03573", "input_text": "let id x = x\nlet (a,b,c) = Scanf.scanf \"%d %d %d\" (fun a b c -> (a,b,c))\n\nlet ans = if a = b then c\n  else if a = c then b\n    else a\n\n  \nlet () =\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1508029408, "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/s314999938.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314999938", "user_id": "u735499035"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let id x = x\nlet (a,b,c) = Scanf.scanf \"%d %d %d\" (fun a b c -> (a,b,c))\n\nlet ans = if a = b then c\n  else if a = c then b\n    else a\n\n  \nlet () =\n  Printf.printf \"%d\\n\" 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s774040254", "group_id": "codeNet:p03576", "input_text": "Scanf.scanf \"%d %d\" (fun n k ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n    let x, y = Array.fold_left (fun (xl, yl) (x, y) -> x :: xl, y :: yl) ([], []) xy in\n    let x = Array.of_list x in\n    let y = Array.of_list y in\n    Array.sort compare x;\n    Array.sort compare y;\n    let rec loop1 i1 acc =\n        let rec loop2 i2 x1 acc =\n            let rec loop3 i3 x2 acc =\n                let rec loop4 i4 y1 acc =\n                    let count y2 =\n                        Array.fold_left (fun acc (x, y) -> if x >= x1 && x <= x2 && y >= y1 && y <= y2 then acc + 1 else acc) 0 xy\n                    in\n                    if i4 >= n then acc else\n                        let kk = count y.(i4) in\n                        let acc = if kk >= k then min acc ((x2 - x1) * (y.(i4) - y1)) else acc  in\n                        loop4 (i4 + 1) y1 acc\n                in\n                if i3 >= n - 1 then acc else loop3 (i3 + 1) x2 (loop4 (i3 + 1) y.(i3) acc)\n            in\n            if i2 >= n then acc else loop2 (i2 + 1) x1 (loop3 0 x.(i2) acc)\n        in\n        if i1 >= n - 1 then acc else loop1 (i1 + 1) (loop2 (i1 + 1) x.(i1) acc)\n    in\n    loop1 0 max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1584422660, "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/s774040254.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774040254", "user_id": "u342443598"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n k ->\n    let xy = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n    let x, y = Array.fold_left (fun (xl, yl) (x, y) -> x :: xl, y :: yl) ([], []) xy in\n    let x = Array.of_list x in\n    let y = Array.of_list y in\n    Array.sort compare x;\n    Array.sort compare y;\n    let rec loop1 i1 acc =\n        let rec loop2 i2 x1 acc =\n            let rec loop3 i3 x2 acc =\n                let rec loop4 i4 y1 acc =\n                    let count y2 =\n                        Array.fold_left (fun acc (x, y) -> if x >= x1 && x <= x2 && y >= y1 && y <= y2 then acc + 1 else acc) 0 xy\n                    in\n                    if i4 >= n then acc else\n                        let kk = count y.(i4) in\n                        let acc = if kk >= k then min acc ((x2 - x1) * (y.(i4) - y1)) else acc  in\n                        loop4 (i4 + 1) y1 acc\n                in\n                if i3 >= n - 1 then acc else loop3 (i3 + 1) x2 (loop4 (i3 + 1) y.(i3) acc)\n            in\n            if i2 >= n then acc else loop2 (i2 + 1) x1 (loop3 0 x.(i2) acc)\n        in\n        if i1 >= n - 1 then acc else loop1 (i1 + 1) (loop2 (i1 + 1) x.(i1) acc)\n    in\n    loop1 0 max_int |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1226, "cpu_time_ms": 428, "memory_kb": 2648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s441966157", "group_id": "codeNet:p03576", "input_text": "let inf = max_int\nlet rec for_fold a b f v = if a >= b then v else for_fold (a+1) b f (f v a)\nlet for_fold_min a b f = for_fold a b (fun x y -> min x (f y)) inf\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let c = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n  Array.sort compare c;\n\n  let xs = Array.map fst c in Array.sort (-) xs;\n  let ys = Array.map snd c in Array.sort (-) ys;\n\n  for_fold_min 0 n (fun i ->\n    let ly = ys.(i) in\n    for_fold_min i n (fun j ->\n      let uy = ys.(j) in\n      for_fold_min 0 n (fun h ->\n        let lx = xs.(h) in\n\n        let m, ux = Array.fold_left (fun (s, tx) (x, y) ->\n          if ly <= y && y <= uy && lx <= x then\n            (s+1, if s < k then x else tx)\n          else\n            (s, tx)) (0, -1) c\n        in\n\n        if m >= k then\n          ((ux-lx)*(uy-ly))\n        else\n          inf)))\n  |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1532682350, "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/s441966157.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441966157", "user_id": "u798181098"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let inf = max_int\nlet rec for_fold a b f v = if a >= b then v else for_fold (a+1) b f (f v a)\nlet for_fold_min a b f = for_fold a b (fun x y -> min x (f y)) inf\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let c = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n  Array.sort compare c;\n\n  let xs = Array.map fst c in Array.sort (-) xs;\n  let ys = Array.map snd c in Array.sort (-) ys;\n\n  for_fold_min 0 n (fun i ->\n    let ly = ys.(i) in\n    for_fold_min i n (fun j ->\n      let uy = ys.(j) in\n      for_fold_min 0 n (fun h ->\n        let lx = xs.(h) in\n\n        let m, ux = Array.fold_left (fun (s, tx) (x, y) ->\n          if ly <= y && y <= uy && lx <= x then\n            (s+1, if s < k then x else tx)\n          else\n            (s, tx)) (0, -1) c\n        in\n\n        if m >= k then\n          ((ux-lx)*(uy-ly))\n        else\n          inf)))\n  |> Printf.printf \"%d\\n\"\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 892, "cpu_time_ms": 21, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s952693854", "group_id": "codeNet:p03577", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let s = scanf \"%s \" (fun x -> x) in\n  let ls = String.length s in\n  String.sub s 0 (ls - 8) |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1507511240, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03577.html", "problem_id": "p03577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03577/input.txt", "sample_output_relpath": "derived/input_output/data/p03577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03577/OCaml/s952693854.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952693854", "user_id": "u388783188"}, "prompt_components": {"gold_output": "CODE\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let s = scanf \"%s \" (fun x -> x) in\n  let ls = String.length s in\n  String.sub s 0 (ls - 8) |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nRng is going to a festival.\n\nThe name of the festival is given to you as a string S, which ends with FESTIVAL, from input. Answer the question: \"Rng is going to a festival of what?\" Output the answer.\n\nHere, assume that the name of \"a festival of s\" is a string obtained by appending FESTIVAL to the end of s.\nFor example, CODEFESTIVAL is a festival of CODE.\n\nConstraints\n\n9 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nS ends with FESTIVAL.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer to the question: \"Rng is going to a festival of what?\"\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE\n\nThis is the same as the example in the statement.\n\nSample Input 2\n\nCODEFESTIVALFESTIVAL\n\nSample Output 2\n\nCODEFESTIVAL\n\nThis string is obtained by appending FESTIVAL to the end of CODEFESTIVAL, so it is a festival of CODEFESTIVAL.\n\nSample Input 3\n\nYAKINIKUFESTIVAL\n\nSample Output 3\n\nYAKINIKU", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["CODE\n"], "source_document_id": "p03577", "source_text": "Score : 100 points\n\nProblem Statement\n\nRng is going to a festival.\n\nThe name of the festival is given to you as a string S, which ends with FESTIVAL, from input. Answer the question: \"Rng is going to a festival of what?\" Output the answer.\n\nHere, assume that the name of \"a festival of s\" is a string obtained by appending FESTIVAL to the end of s.\nFor example, CODEFESTIVAL is a festival of CODE.\n\nConstraints\n\n9 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nS ends with FESTIVAL.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer to the question: \"Rng is going to a festival of what?\"\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE\n\nThis is the same as the example in the statement.\n\nSample Input 2\n\nCODEFESTIVALFESTIVAL\n\nSample Output 2\n\nCODEFESTIVAL\n\nThis string is obtained by appending FESTIVAL to the end of CODEFESTIVAL, so it is a festival of CODEFESTIVAL.\n\nSample Input 3\n\nYAKINIKUFESTIVAL\n\nSample Output 3\n\nYAKINIKU", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s835458040", "group_id": "codeNet:p03591", "input_text": "let () =\n  let s = read_line () in\n  let ss = try String.sub s 0 4 with _ -> \"\" in\n  (if ss = \"YAKI\" then \"Yes\" else \"No\") |> print_endline\n", "language": "OCaml", "metadata": {"date": 1506215201, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03591.html", "problem_id": "p03591", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03591/input.txt", "sample_output_relpath": "derived/input_output/data/p03591/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03591/OCaml/s835458040.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s835458040", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  let ss = try String.sub s 0 4 with _ -> \"\" in\n  (if ss = \"YAKI\" then \"Yes\" else \"No\") |> print_endline\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nRingo is giving a present to Snuke.\n\nRingo has found out that Snuke loves yakiniku (a Japanese term meaning grilled meat. yaki: grilled, niku: meat). He supposes that Snuke likes grilled things starting with YAKI in Japanese, and does not like other things.\n\nYou are given a string S representing the Japanese name of Ringo's present to Snuke. Determine whether S starts with YAKI.\n\nConstraints\n\n1 \\leq |S| \\leq 10\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S starts with YAKI, print Yes; otherwise, print No.\n\nSample Input 1\n\nYAKINIKU\n\nSample Output 1\n\nYes\n\nYAKINIKU starts with YAKI.\n\nSample Input 2\n\nTAKOYAKI\n\nSample Output 2\n\nNo\n\nTAKOYAKI (a Japanese snack. tako: octopus) does not start with YAKI.\n\nSample Input 3\n\nYAK\n\nSample Output 3\n\nNo", "sample_input": "YAKINIKU\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03591", "source_text": "Score : 100 points\n\nProblem Statement\n\nRingo is giving a present to Snuke.\n\nRingo has found out that Snuke loves yakiniku (a Japanese term meaning grilled meat. yaki: grilled, niku: meat). He supposes that Snuke likes grilled things starting with YAKI in Japanese, and does not like other things.\n\nYou are given a string S representing the Japanese name of Ringo's present to Snuke. Determine whether S starts with YAKI.\n\nConstraints\n\n1 \\leq |S| \\leq 10\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S starts with YAKI, print Yes; otherwise, print No.\n\nSample Input 1\n\nYAKINIKU\n\nSample Output 1\n\nYes\n\nYAKINIKU starts with YAKI.\n\nSample Input 2\n\nTAKOYAKI\n\nSample Output 2\n\nNo\n\nTAKOYAKI (a Japanese snack. tako: octopus) does not start with YAKI.\n\nSample Input 3\n\nYAK\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s107304814", "group_id": "codeNet:p03597", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let n2 = scanf \"%d \" (fun x -> x * x) in\n  let a = scanf \"%d \" (fun x -> x) in\n  printf \"%d\\n\" (n2 - a)", "language": "OCaml", "metadata": {"date": 1505665423, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s107304814.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s107304814", "user_id": "u388783188"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let n2 = scanf \"%d \" (fun x -> x * x) in\n  let a = scanf \"%d \" (fun x -> x) in\n  printf \"%d\\n\" (n2 - a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s005015338", "group_id": "codeNet:p03598", "input_text": "open Printf\nopen Scanf\n\nmodule L =\n  struct\n    include List\n  \n    let rec unfold f x =\n      match f x with\n        None -> []\n      | Some (a, b) -> a :: unfold f b\n  end\n    \nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let k = scanf \"%d \" (fun x -> x) in\n  let xs = L.unfold (fun b -> if b = 0 then None else let v = scanf \"%d \" (fun x -> x) in Some (v,b-1)) n in\n  L.fold_left (fun s x -> s + 2 * (min x (k-x))) 0 xs |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1505667844, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03598.html", "problem_id": "p03598", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03598/input.txt", "sample_output_relpath": "derived/input_output/data/p03598/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03598/OCaml/s005015338.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s005015338", "user_id": "u388783188"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nmodule L =\n  struct\n    include List\n  \n    let rec unfold f x =\n      match f x with\n        None -> []\n      | Some (a, b) -> a :: unfold f b\n  end\n    \nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let k = scanf \"%d \" (fun x -> x) in\n  let xs = L.unfold (fun b -> if b = 0 then None else let v = scanf \"%d \" (fun x -> x) in Some (v,b-1)) n in\n  L.fold_left (fun s x -> s + 2 * (min x (k-x))) 0 xs |> printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i).\nThus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.\n\nIn order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B.\nThen, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i).\nThus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.\n\nWhen activated, each type of robot will operate as follows.\n\nWhen a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nWhen a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nSnuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n0 < x_i < K\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nK\nx_1 x_2 ... x_N\n\nOutputs\n\nPrint the minimum possible total distance covered by robots.\n\nSample Input 1\n\n1\n10\n2\n\nSample Output 1\n\n4\n\nThere are just one ball, one type-A robot and one type-B robot.\n\nIf the type-A robot is used to collect the ball, the distance from the robot to the ball is 2, and the distance from the ball to the original position of the robot is also 2, for a total distance of 4.\n\nSimilarly, if the type-B robot is used, the total distance covered will be 16.\n\nThus, the total distance covered will be minimized when the type-A robot is used. The output should be 4.\n\nSample Input 2\n\n2\n9\n3 6\n\nSample Output 2\n\n12\n\nThe total distance covered will be minimized when the first ball is collected by the type-A robot, and the second ball by the type-B robot.\n\nSample Input 3\n\n5\n20\n11 12 9 17 12\n\nSample Output 3\n\n74", "sample_input": "1\n10\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03598", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i).\nThus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.\n\nIn order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B.\nThen, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i).\nThus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.\n\nWhen activated, each type of robot will operate as follows.\n\nWhen a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nWhen a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nSnuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n0 < x_i < K\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nK\nx_1 x_2 ... x_N\n\nOutputs\n\nPrint the minimum possible total distance covered by robots.\n\nSample Input 1\n\n1\n10\n2\n\nSample Output 1\n\n4\n\nThere are just one ball, one type-A robot and one type-B robot.\n\nIf the type-A robot is used to collect the ball, the distance from the robot to the ball is 2, and the distance from the ball to the original position of the robot is also 2, for a total distance of 4.\n\nSimilarly, if the type-B robot is used, the total distance covered will be 16.\n\nThus, the total distance covered will be minimized when the type-A robot is used. The output should be 4.\n\nSample Input 2\n\n2\n9\n3 6\n\nSample Output 2\n\n12\n\nThe total distance covered will be minimized when the first ball is collected by the type-A robot, and the second ball by the type-B robot.\n\nSample Input 3\n\n5\n20\n11 12 9 17 12\n\nSample Output 3\n\n74", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s345149900", "group_id": "codeNet:p03605", "input_text": "let f s =\n let rec fiter ss =\n  if String.length s=0\n   then false\n   else\n    (if ss.[0]=='9'\n     then true\n     else fiter (String.sub ss 1 (String.length ss-1))) in fiter s;;\nlet () = Scanf.scanf \"%s\"\nf\n|> (fun a -> if a then \"Yes\" else \"No\")\n|> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1561085837, "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/s345149900.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s345149900", "user_id": "u635974378"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let f s =\n let rec fiter ss =\n  if String.length s=0\n   then false\n   else\n    (if ss.[0]=='9'\n     then true\n     else fiter (String.sub ss 1 (String.length ss-1))) in fiter s;;\nlet () = Scanf.scanf \"%s\"\nf\n|> (fun a -> if a then \"Yes\" else \"No\")\n|> Printf.printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "sample_input": "29\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03605", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s258315886", "group_id": "codeNet:p03605", "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 \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 \n  let raw_warshall_floyd n es =\n    (* 準備 *)\n    (* Noneで無限を表す *)\n    let d = Array.make_matrix n n None 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) <- Some 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          (* d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k)) *)\n          let open Weight in\n          match d.(j).(k), d.(j).(i), d.(i).(k) with\n          | _, None, _ -> ()\n          | _, _, None -> ()\n          (* d.(j).(k) <= d.(j).(i) + d.(i).(k) *)\n          | Some djk, Some dji, Some dik when compare djk (dji + dik) <= 0 -> ()\n          | _, Some dji, Some dik -> d.(j).(k) <- Some (dji + dik)\n        done\n      done\n    done;\n    fun u v ->\n      if u < 0 || n <= u || v < 0 || n <= v\n      then None\n      else d.(u).(v)\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 \n \nmodule G = WeightedDirectedGraph (Int) (Int)\n \nlet 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 permutation = function\n  | [] -> [[]]\n  | xs -> \n      List.concat @@ List.map (fun (xs, x, ys) -> List.map (fun xs -> x :: xs) (permutation (List.rev_append xs ys)))\n      (select xs)\n \nlet () =\n  let n, m, r = Scanf.scanf \"%d %d %d\\n\" (fun n m r -> n, m, r) in\n  let rs = Array.to_list @@ Array.init r (fun _ -> Scanf.scanf \"%d \" (fun r -> r - 1)) in\n  let abcs = Array.to_list @@ Array.init m (fun _ -> Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a - 1, b - 1, c)) in\n  let d =\n    G.warshall_floyd @@\n      List.rev_append (List.rev_map (fun (a, b, c) -> (b, a, c)) abcs) abcs in\n  permutation rs\n  |> List.map (fun (r :: rs) ->\n      List.fold_left (fun (r, a) s -> (s, (r, s) :: a)) (r, []) rs\n      |> snd\n      |> List.map (fun (r, s) ->\n          match d r s with\n          | None -> max_int\n          | Some d -> d)\n      |> List.fold_left ( + ) 0)\n  |> List.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1525456308, "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/s258315886.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s258315886", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\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 \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 \n  let raw_warshall_floyd n es =\n    (* 準備 *)\n    (* Noneで無限を表す *)\n    let d = Array.make_matrix n n None 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) <- Some 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          (* d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k)) *)\n          let open Weight in\n          match d.(j).(k), d.(j).(i), d.(i).(k) with\n          | _, None, _ -> ()\n          | _, _, None -> ()\n          (* d.(j).(k) <= d.(j).(i) + d.(i).(k) *)\n          | Some djk, Some dji, Some dik when compare djk (dji + dik) <= 0 -> ()\n          | _, Some dji, Some dik -> d.(j).(k) <- Some (dji + dik)\n        done\n      done\n    done;\n    fun u v ->\n      if u < 0 || n <= u || v < 0 || n <= v\n      then None\n      else d.(u).(v)\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 \n \nmodule G = WeightedDirectedGraph (Int) (Int)\n \nlet 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 permutation = function\n  | [] -> [[]]\n  | xs -> \n      List.concat @@ List.map (fun (xs, x, ys) -> List.map (fun xs -> x :: xs) (permutation (List.rev_append xs ys)))\n      (select xs)\n \nlet () =\n  let n, m, r = Scanf.scanf \"%d %d %d\\n\" (fun n m r -> n, m, r) in\n  let rs = Array.to_list @@ Array.init r (fun _ -> Scanf.scanf \"%d \" (fun r -> r - 1)) in\n  let abcs = Array.to_list @@ Array.init m (fun _ -> Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a - 1, b - 1, c)) in\n  let d =\n    G.warshall_floyd @@\n      List.rev_append (List.rev_map (fun (a, b, c) -> (b, a, c)) abcs) abcs in\n  permutation rs\n  |> List.map (fun (r :: rs) ->\n      List.fold_left (fun (r, a) s -> (s, (r, s) :: a)) (r, []) rs\n      |> snd\n      |> List.map (fun (r, s) ->\n          match d r s with\n          | None -> max_int\n          | Some d -> d)\n      |> List.fold_left ( + ) 0)\n  |> List.fold_left min max_int\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "sample_input": "29\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03605", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4037, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s839662441", "group_id": "codeNet:p03608", "input_text": "Scanf.scanf \"%d %d %d\" (fun n m r ->\n    let next_permutation list =\n        let rec phase3 taddr = function\n            | _  :: tl when tl == taddr -> []\n            | hd :: tl                  -> hd :: phase3 taddr tl\n            | []                        -> [] in\n\n        let rec phase2 h2 taddr = function\n            | h1 :: tl when h1 > h2 -> let lis = phase3 taddr tl in\n                                       h1, h2 :: lis\n            | h1 :: tl              -> let hh, lis = phase2 h2 taddr tl in\n                                       hh, h1 :: lis\n            | _                     -> failwith \"??\" in\n\n        let rec phase1 list = function\n            | h1 :: h2 :: tl when h1 > h2  -> let hh, lis = phase2 h2   tl list in\n                                              List.rev_append tl (hh :: lis)\n            | _  :: tl                     -> phase1 list tl\n            | _                            -> list in\n\n        let rev_list = List.rev list in\n        phase1 rev_list rev_list\n    in\n    let ri = Array.init r (fun _ -> Scanf.scanf \" %d\" (fun r -> r - 1)) in\n    let nei = Array.make n [] in\n    for i = 1 to m do\n        Scanf.scanf \" %d %d %d\" (fun a b c ->\n            let a = a - 1 in\n            let b = b - 1 in\n            nei.(a) <- (c, b) :: nei.(a);\n            nei.(b) <- (c, a) :: nei.(b);\n        )\n    done;\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    let dijkstra s g =\n        let d = Array.make n max_int in\n        d.(s) <- 0;\n        let rec loop set =\n            if S.is_empty set then () else\n                let ((dd, cur) as m) = S.min_elt set in\n                let set = S.remove m set in\n                let set = List.fold_left (fun set (nc, nv) ->\n                    if d.(nv) <= nc + dd then set else (\n                        d.(nv) <- nc + dd;\n                        S.add (nc + dd, nv) set\n                    )\n                ) set nei.(cur)\n                in\n                loop set\n        in\n        loop (S.singleton (0, s));\n        d.(g)\n    in\n    let dist = Array.make_matrix r r max_int in\n    for i = 0 to r - 1 do\n        dist.(i).(i) <- 0;\n        for j = i + 1 to r - 1 do\n            let c = dijkstra ri.(i) ri.(j) in\n            dist.(i).(j) <- c;\n            dist.(j).(i) <- c;\n        done\n    done;\n    let rec iota a = if a < 0 then [] else a :: iota (a - 1) in\n    let rec fact a = if a = 0 then 1  else a *  fact (a - 1) in\n\n    let calc l =\n        match l with\n        | [] -> 0\n        | hd :: tl ->\n                let rec loop prev sum = function\n                    | [] -> sum\n                    | x :: xs -> loop x (sum + dist.(prev).(x)) xs\n                in\n                loop hd 0 tl\n    in\n\n    let rec loop i lis acc =\n        if i = 0 then acc else\n            loop (i - 1) (next_permutation lis) (min acc (calc lis))\n    in\n    loop (fact r) (iota (r - 1)) max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1600139218, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03608.html", "problem_id": "p03608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03608/input.txt", "sample_output_relpath": "derived/input_output/data/p03608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03608/OCaml/s839662441.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839662441", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n m r ->\n    let next_permutation list =\n        let rec phase3 taddr = function\n            | _  :: tl when tl == taddr -> []\n            | hd :: tl                  -> hd :: phase3 taddr tl\n            | []                        -> [] in\n\n        let rec phase2 h2 taddr = function\n            | h1 :: tl when h1 > h2 -> let lis = phase3 taddr tl in\n                                       h1, h2 :: lis\n            | h1 :: tl              -> let hh, lis = phase2 h2 taddr tl in\n                                       hh, h1 :: lis\n            | _                     -> failwith \"??\" in\n\n        let rec phase1 list = function\n            | h1 :: h2 :: tl when h1 > h2  -> let hh, lis = phase2 h2   tl list in\n                                              List.rev_append tl (hh :: lis)\n            | _  :: tl                     -> phase1 list tl\n            | _                            -> list in\n\n        let rev_list = List.rev list in\n        phase1 rev_list rev_list\n    in\n    let ri = Array.init r (fun _ -> Scanf.scanf \" %d\" (fun r -> r - 1)) in\n    let nei = Array.make n [] in\n    for i = 1 to m do\n        Scanf.scanf \" %d %d %d\" (fun a b c ->\n            let a = a - 1 in\n            let b = b - 1 in\n            nei.(a) <- (c, b) :: nei.(a);\n            nei.(b) <- (c, a) :: nei.(b);\n        )\n    done;\n    let module S = Set.Make (struct type t = int * int let compare = compare end) in\n    let dijkstra s g =\n        let d = Array.make n max_int in\n        d.(s) <- 0;\n        let rec loop set =\n            if S.is_empty set then () else\n                let ((dd, cur) as m) = S.min_elt set in\n                let set = S.remove m set in\n                let set = List.fold_left (fun set (nc, nv) ->\n                    if d.(nv) <= nc + dd then set else (\n                        d.(nv) <- nc + dd;\n                        S.add (nc + dd, nv) set\n                    )\n                ) set nei.(cur)\n                in\n                loop set\n        in\n        loop (S.singleton (0, s));\n        d.(g)\n    in\n    let dist = Array.make_matrix r r max_int in\n    for i = 0 to r - 1 do\n        dist.(i).(i) <- 0;\n        for j = i + 1 to r - 1 do\n            let c = dijkstra ri.(i) ri.(j) in\n            dist.(i).(j) <- c;\n            dist.(j).(i) <- c;\n        done\n    done;\n    let rec iota a = if a < 0 then [] else a :: iota (a - 1) in\n    let rec fact a = if a = 0 then 1  else a *  fact (a - 1) in\n\n    let calc l =\n        match l with\n        | [] -> 0\n        | hd :: tl ->\n                let rec loop prev sum = function\n                    | [] -> sum\n                    | x :: xs -> loop x (sum + dist.(prev).(x)) xs\n                in\n                loop hd 0 tl\n    in\n\n    let rec loop i lis acc =\n        if i = 0 then acc else\n            loop (i - 1) (next_permutation lis) (min acc (calc lis))\n    in\n    loop (fact r) (iota (r - 1)) max_int |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "sample_input": "3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03608", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2944, "cpu_time_ms": 75, "memory_kb": 8120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s957656716", "group_id": "codeNet:p03608", "input_text": "module WeightedDirectedGraph\n  (Weight : sig\n    type t\n    val inf : t (* オーバーフローの恐れはないので，max_intとか突っ込んでも良い *)\n    val zero : t\n    val neg_inf : t (* オーバーフローの恐れはないので，min_intとか突っ込んでも良い *)\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 warshall_floyd :\n    (* 頂点の数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) church_list ->\n    (* 辿り着けなければinf，負閉路を含む経路があればneg_infを返す関数 *)\n    (int -> int -> Weight.t)\nend =\nstruct\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  let warshall_floyd n es =\n    let d = Array.make_matrix n n Weight.inf in\n    for v = 0 to n - 1 do\n      d.(v).(v) <- Weight.zero\n    done;\n    es.fold (fun (u, v, c) () ->\n      (* c < d.(u).(v) *)\n      if 0 < Weight.compare d.(u).(v) c\n      then d.(u).(v) <- c) ();\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          if \n            (* 経路がない場合は更新しない *)\n            0 < Weight.compare inf d.(j).(i)\n            && 0 < Weight.compare inf d.(i).(k)\n            (* d.(j).(i) + d.(i).(k) < d.(j).(k) *)\n            && 0 < Weight.compare d.(j).(k) (d.(j).(i) + d.(i).(k))\n          then d.(j).(k) <- d.(j).(i) + d.(i).(k)\n        done\n      done\n    done;\n    for i = 0 to n - 1 do\n      (* 頂点iを通る負閉路がある *)\n      if 0 < Weight.compare Weight.zero d.(i).(i) then\n        for j = 0 to n - 1 do\n          for k = 0 to n - 1 do\n            (* 負閉路を通る経路があれば，最短距離を負の無限大で更新 *)\n            let open Weight in\n            if 0 < Weight.compare inf d.(j).(i) && 0 < Weight.compare inf d.(i).(k)\n            then d.(j).(k) <- Weight.neg_inf\n          done\n        done\n    done;\n    fun u v -> try d.(u).(v) with _ -> Weight.inf\nend\n\nmodule G = WeightedDirectedGraph (struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let inf = max_int\n  let neg_inf = min_int\n  let compare = compare\nend)\n\nlet rec perm acc zs ys n xs =\n  match n, xs with\n  | 0, _ -> zs :: acc\n  | _, [] -> acc\n  | n, x :: xs -> perm (perm acc (x :: zs) [] (n - 1) (List.rev_append ys xs)) zs (x :: ys) n xs\nlet perm n = perm [] [] [] n\n      \nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m r ->\n  let rs = Array.init r @@ fun _ -> Scanf.scanf \"%d \" pred in\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.warshall_floyd n { G.fold = fun f -> Array.fold_right (fun ((a, b, c) as e) acc -> f (b, a, c) @@ f e acc) abcs } in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun acc (r :: rs) ->\n    min acc @@\n    snd @@\n    List.fold_left (fun (r, a) s -> (s, d r s + a)) (r, 0) rs) max_int @@\n  perm r @@\n  Array.to_list rs\n", "language": "OCaml", "metadata": {"date": 1589616556, "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/s957656716.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s957656716", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module WeightedDirectedGraph\n  (Weight : sig\n    type t\n    val inf : t (* オーバーフローの恐れはないので，max_intとか突っ込んでも良い *)\n    val zero : t\n    val neg_inf : t (* オーバーフローの恐れはないので，min_intとか突っ込んでも良い *)\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 warshall_floyd :\n    (* 頂点の数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) church_list ->\n    (* 辿り着けなければinf，負閉路を含む経路があればneg_infを返す関数 *)\n    (int -> int -> Weight.t)\nend =\nstruct\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  let warshall_floyd n es =\n    let d = Array.make_matrix n n Weight.inf in\n    for v = 0 to n - 1 do\n      d.(v).(v) <- Weight.zero\n    done;\n    es.fold (fun (u, v, c) () ->\n      (* c < d.(u).(v) *)\n      if 0 < Weight.compare d.(u).(v) c\n      then d.(u).(v) <- c) ();\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          if \n            (* 経路がない場合は更新しない *)\n            0 < Weight.compare inf d.(j).(i)\n            && 0 < Weight.compare inf d.(i).(k)\n            (* d.(j).(i) + d.(i).(k) < d.(j).(k) *)\n            && 0 < Weight.compare d.(j).(k) (d.(j).(i) + d.(i).(k))\n          then d.(j).(k) <- d.(j).(i) + d.(i).(k)\n        done\n      done\n    done;\n    for i = 0 to n - 1 do\n      (* 頂点iを通る負閉路がある *)\n      if 0 < Weight.compare Weight.zero d.(i).(i) then\n        for j = 0 to n - 1 do\n          for k = 0 to n - 1 do\n            (* 負閉路を通る経路があれば，最短距離を負の無限大で更新 *)\n            let open Weight in\n            if 0 < Weight.compare inf d.(j).(i) && 0 < Weight.compare inf d.(i).(k)\n            then d.(j).(k) <- Weight.neg_inf\n          done\n        done\n    done;\n    fun u v -> try d.(u).(v) with _ -> Weight.inf\nend\n\nmodule G = WeightedDirectedGraph (struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let inf = max_int\n  let neg_inf = min_int\n  let compare = compare\nend)\n\nlet rec perm acc zs ys n xs =\n  match n, xs with\n  | 0, _ -> zs :: acc\n  | _, [] -> acc\n  | n, x :: xs -> perm (perm acc (x :: zs) [] (n - 1) (List.rev_append ys xs)) zs (x :: ys) n xs\nlet perm n = perm [] [] [] n\n      \nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m r ->\n  let rs = Array.init r @@ fun _ -> Scanf.scanf \"%d \" pred in\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.warshall_floyd n { G.fold = fun f -> Array.fold_right (fun ((a, b, c) as e) acc -> f (b, a, c) @@ f e acc) abcs } in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun acc (r :: rs) ->\n    min acc @@\n    snd @@\n    List.fold_left (fun (r, a) s -> (s, d r s + a)) (r, 0) rs) max_int @@\n  perm r @@\n  Array.to_list rs\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "sample_input": "3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03608", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3059, "cpu_time_ms": 379, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s829298681", "group_id": "codeNet:p03608", "input_text": "module WeightedDirectedGraph\n  (Weight : sig\n    type t\n    val inf : t (* オーバーフローの恐れはないので，max_intとか突っ込んでも良い *)\n    val zero : t\n    val neg_inf : t (* オーバーフローの恐れはないので，min_intとか突っ込んでも良い *)\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 warshall_floyd :\n    (* 頂点の数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) church_list ->\n    (* 辿り着けなければinf，負閉路を含む経路があればneg_infを返す関数 *)\n    (int -> int -> Weight.t)\nend =\nstruct\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  let warshall_floyd n es =\n    let d = Array.make_matrix n n Weight.inf in\n    for v = 0 to n - 1 do\n      d.(v).(v) <- Weight.zero\n    done;\n    es.fold (fun (u, v, c) () ->\n      (* c < d.(u).(v) *)\n      if 0 < Weight.compare d.(u).(v) c\n      then d.(u).(v) <- c) ();\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          if \n            (* 経路がない場合は更新しない *)\n            0 < Weight.compare inf d.(j).(i)\n            && 0 < Weight.compare inf d.(i).(k)\n            (* d.(j).(i) + d.(i).(k) < d.(j).(k) *)\n            && 0 < Weight.compare d.(j).(k) (d.(j).(i) + d.(i).(k))\n          then d.(j).(k) <- d.(j).(i) + d.(i).(k)\n        done\n      done\n    done;\n    for i = 0 to n - 1 do\n      (* 頂点iを通る負閉路がある *)\n      if 0 < Weight.compare Weight.zero d.(i).(i) then\n        for j = 0 to n - 1 do\n          for k = 0 to n - 1 do\n            (* 負閉路を通る経路があれば，最短距離を負の無限大で更新 *)\n            let open Weight in\n            if 0 < Weight.compare inf d.(j).(i) && 0 < Weight.compare inf d.(i).(k)\n            then d.(j).(k) <- Weight.neg_inf\n          done\n        done\n    done;\n    fun u v -> try d.(u).(v) with _ -> Weight.inf\nend\n\nmodule G = WeightedDirectedGraph (struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let inf = max_int\n  let neg_inf = min_int\n  let compare = compare\nend)\n\nlet perm k xs =\n  let rec perm_aux trace n k i xs ys acc =\n    match k, i, xs with\n    | 0, _, _ -> trace :: acc\n    | _, 0, _ -> acc\n    | _, _, [] -> perm_aux trace n k i (List.rev ys) [] acc\n    | _, _, x :: xs ->\n        perm_aux trace n k (i - 1) xs (x :: ys) @@\n        perm_aux (x :: trace) (n - 1) (k - 1) (n - 1) xs ys acc in\n  let n = List.length xs in\n  perm_aux [] n k n xs [] []\n\nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m r ->\n  let rs = Array.init r @@ fun _ -> Scanf.scanf \"%d \" pred in\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.warshall_floyd n { G.fold = fun f -> Array.fold_right (fun ((a, b, c) as e) acc -> f (b, a, c) @@ f e acc) abcs } in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun acc (r :: rs) ->\n    min acc @@\n    snd @@\n    List.fold_left (fun (r, a) s -> (s, d r s + a)) (r, 0) rs) max_int @@\n  perm r @@\n  Array.to_list rs\n", "language": "OCaml", "metadata": {"date": 1589611695, "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/s829298681.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s829298681", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module WeightedDirectedGraph\n  (Weight : sig\n    type t\n    val inf : t (* オーバーフローの恐れはないので，max_intとか突っ込んでも良い *)\n    val zero : t\n    val neg_inf : t (* オーバーフローの恐れはないので，min_intとか突っ込んでも良い *)\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 warshall_floyd :\n    (* 頂点の数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) church_list ->\n    (* 辿り着けなければinf，負閉路を含む経路があればneg_infを返す関数 *)\n    (int -> int -> Weight.t)\nend =\nstruct\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  let warshall_floyd n es =\n    let d = Array.make_matrix n n Weight.inf in\n    for v = 0 to n - 1 do\n      d.(v).(v) <- Weight.zero\n    done;\n    es.fold (fun (u, v, c) () ->\n      (* c < d.(u).(v) *)\n      if 0 < Weight.compare d.(u).(v) c\n      then d.(u).(v) <- c) ();\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          if \n            (* 経路がない場合は更新しない *)\n            0 < Weight.compare inf d.(j).(i)\n            && 0 < Weight.compare inf d.(i).(k)\n            (* d.(j).(i) + d.(i).(k) < d.(j).(k) *)\n            && 0 < Weight.compare d.(j).(k) (d.(j).(i) + d.(i).(k))\n          then d.(j).(k) <- d.(j).(i) + d.(i).(k)\n        done\n      done\n    done;\n    for i = 0 to n - 1 do\n      (* 頂点iを通る負閉路がある *)\n      if 0 < Weight.compare Weight.zero d.(i).(i) then\n        for j = 0 to n - 1 do\n          for k = 0 to n - 1 do\n            (* 負閉路を通る経路があれば，最短距離を負の無限大で更新 *)\n            let open Weight in\n            if 0 < Weight.compare inf d.(j).(i) && 0 < Weight.compare inf d.(i).(k)\n            then d.(j).(k) <- Weight.neg_inf\n          done\n        done\n    done;\n    fun u v -> try d.(u).(v) with _ -> Weight.inf\nend\n\nmodule G = WeightedDirectedGraph (struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let inf = max_int\n  let neg_inf = min_int\n  let compare = compare\nend)\n\nlet perm k xs =\n  let rec perm_aux trace n k i xs ys acc =\n    match k, i, xs with\n    | 0, _, _ -> trace :: acc\n    | _, 0, _ -> acc\n    | _, _, [] -> perm_aux trace n k i (List.rev ys) [] acc\n    | _, _, x :: xs ->\n        perm_aux trace n k (i - 1) xs (x :: ys) @@\n        perm_aux (x :: trace) (n - 1) (k - 1) (n - 1) xs ys acc in\n  let n = List.length xs in\n  perm_aux [] n k n xs [] []\n\nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m r ->\n  let rs = Array.init r @@ fun _ -> Scanf.scanf \"%d \" pred in\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.warshall_floyd n { G.fold = fun f -> Array.fold_right (fun ((a, b, c) as e) acc -> f (b, a, c) @@ f e acc) abcs } in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (fun acc (r :: rs) ->\n    min acc @@\n    snd @@\n    List.fold_left (fun (r, a) s -> (s, d r s + a)) (r, 0) rs) max_int @@\n  perm r @@\n  Array.to_list rs\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "sample_input": "3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03608", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3231, "cpu_time_ms": 381, "memory_kb": 6784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s150209188", "group_id": "codeNet:p03608", "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 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)\n\nlet rec pow2 n = if n <= 0 then 1 else 2 * pow2 (n-1)\n\nlet inf = 202020202020\n\nlet () =\n  let [|n; m; r|] = read_ints 3 in\n  let rs = read_ints r |> Array.map (fun x -> x - 1) in\n  let graph = Array.init n @@ fun _ -> Array.make n inf in\n  for_iter_ 0 m (fun _ ->\n    let [|a; b; c|] = read_ints 3 in\n    graph.(a-1).(b-1) <- c;\n    graph.(b-1).(a-1) <- c);\n\n  for_iter_ 0 n (fun i -> graph.(i).(i) <- 0);\n  for_iter_ 0 n (fun l -> for_iter_ 0 n @@ fun j -> for_iter_ 0 n @@ fun k ->\n    graph.(j).(k) <- min graph.(j).(k) @@ graph.(j).(l) + graph.(l).(k));\n\n  let rgraph = Array.init r @@ fun _ -> Array.make r inf in\n  for_iter_ 0 r (fun j ->\n    for_iter_ 0 r (fun k -> rgraph.(j).(k) <- graph.(rs.(j)).(rs.(k))));\n\n  let lim = pow2 r in\n  let memo = Array.init r @@ fun _ -> Array.make lim inf in\n  for_iter_ 0 r (fun j -> memo.(j).(pow2 j) <- 0);\n\n  for_iter_ 0 lim (fun n ->\n    for_iter_ 0 r (fun j ->\n      if n land pow2 j > 0 then\n        let n' = n lxor pow2 j in\n        for_iter_ 0 r (fun k ->\n          let b = pow2 k in\n          if n' land b > 0 then\n            memo.(j).(n) <- min memo.(j).(n) (memo.(k).(n') + rgraph.(k).(j)))));\n\n  for_iter 0 r (fun i -> memo.(i).(lim - 1))\n  |> List.fold_left min inf\n  |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519454363, "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/s150209188.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s150209188", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\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 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)\n\nlet rec pow2 n = if n <= 0 then 1 else 2 * pow2 (n-1)\n\nlet inf = 202020202020\n\nlet () =\n  let [|n; m; r|] = read_ints 3 in\n  let rs = read_ints r |> Array.map (fun x -> x - 1) in\n  let graph = Array.init n @@ fun _ -> Array.make n inf in\n  for_iter_ 0 m (fun _ ->\n    let [|a; b; c|] = read_ints 3 in\n    graph.(a-1).(b-1) <- c;\n    graph.(b-1).(a-1) <- c);\n\n  for_iter_ 0 n (fun i -> graph.(i).(i) <- 0);\n  for_iter_ 0 n (fun l -> for_iter_ 0 n @@ fun j -> for_iter_ 0 n @@ fun k ->\n    graph.(j).(k) <- min graph.(j).(k) @@ graph.(j).(l) + graph.(l).(k));\n\n  let rgraph = Array.init r @@ fun _ -> Array.make r inf in\n  for_iter_ 0 r (fun j ->\n    for_iter_ 0 r (fun k -> rgraph.(j).(k) <- graph.(rs.(j)).(rs.(k))));\n\n  let lim = pow2 r in\n  let memo = Array.init r @@ fun _ -> Array.make lim inf in\n  for_iter_ 0 r (fun j -> memo.(j).(pow2 j) <- 0);\n\n  for_iter_ 0 lim (fun n ->\n    for_iter_ 0 r (fun j ->\n      if n land pow2 j > 0 then\n        let n' = n lxor pow2 j in\n        for_iter_ 0 r (fun k ->\n          let b = pow2 k in\n          if n' land b > 0 then\n            memo.(j).(n) <- min memo.(j).(n) (memo.(k).(n') + rgraph.(k).(j)))));\n\n  for_iter 0 r (fun i -> memo.(i).(lim - 1))\n  |> List.fold_left min inf\n  |> printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "sample_input": "3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03608", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1616, "cpu_time_ms": 139, "memory_kb": 2944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s582411003", "group_id": "codeNet:p03609", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun x t ->\n  Printf.printf \"%d\\n\" @@ max 0 (x - t)\n", "language": "OCaml", "metadata": {"date": 1530678225, "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/s582411003.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s582411003", "user_id": "u504158101"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun x t ->\n  Printf.printf \"%d\\n\" @@ max 0 (x - t)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s015267160", "group_id": "codeNet:p03609", "input_text": "let a = Scanf.scanf \"%d \" (fun x -> x) in\n    let b = Scanf.scanf \"%d\\n\" (fun x -> x ) in\n        let c = a - b in\n            if (c > 0) then\n                Printf.printf \"%d\\n\" c\n            else \n                Printf.printf \"0\\n\";;", "language": "OCaml", "metadata": {"date": 1513118740, "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/s015267160.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s015267160", "user_id": "u867933941"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "let a = Scanf.scanf \"%d \" (fun x -> x) in\n    let b = Scanf.scanf \"%d\\n\" (fun x -> x ) in\n        let c = a - b in\n            if (c > 0) then\n                Printf.printf \"%d\\n\" c\n            else \n                Printf.printf \"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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s040766422", "group_id": "codeNet:p03610", "input_text": "(* O(|s|) *)\nlet solve s =\n  let n = String.length s in\n  let rec loop i =\n      if i < n then\n        (print_char s.[i];\n        loop (i + 2))\n  in\n    loop 0\n\nlet _ = read_line () |> solve", "language": "OCaml", "metadata": {"date": 1557510674, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03610/input.txt", "sample_output_relpath": "derived/input_output/data/p03610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03610/OCaml/s040766422.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s040766422", "user_id": "u732304692"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "(* O(|s|) *)\nlet solve s =\n  let n = String.length s in\n  let rec loop i =\n      if i < n then\n        (print_char s.[i];\n        loop (i + 2))\n  in\n    loop 0\n\nlet _ = read_line () |> solve", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "sample_input": "atcoder\n"}, "reference_outputs": ["acdr\n"], "source_document_id": "p03610", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s999892973", "group_id": "codeNet:p03614", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let p = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun p -> p - 1)) in\n\n    let swap a =\n        let c = p.(a) in\n        p.(a) <- p.(a + 1);\n        p.(a + 1) <- c\n    in\n\n    let rec loop i acc =\n        if i = n - 1 then acc else\n            if p.(i) = i then (\n                swap i;\n                loop (i + 1) (acc + 1)\n            ) else if i = n - 2 && p.(i + 1) = i + 1 then (\n                swap i;\n                loop (i + 1) (acc + 1)\n            ) else loop (i + 1) acc\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1598326993, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03614.html", "problem_id": "p03614", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03614/input.txt", "sample_output_relpath": "derived/input_output/data/p03614/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03614/OCaml/s999892973.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s999892973", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let p = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun p -> p - 1)) in\n\n    let swap a =\n        let c = p.(a) in\n        p.(a) <- p.(a + 1);\n        p.(a + 1) <- c\n    in\n\n    let rec loop i acc =\n        if i = n - 1 then acc else\n            if p.(i) = i then (\n                swap i;\n                loop (i + 1) (acc + 1)\n            ) else if i = n - 2 && p.(i + 1) = i + 1 then (\n                swap i;\n                loop (i + 1) (acc + 1)\n            ) else loop (i + 1) acc\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "sample_input": "5\n1 4 3 5 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03614", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 562, "cpu_time_ms": 36, "memory_kb": 6672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s523570576", "group_id": "codeNet:p03614", "input_text": "let rec solve i n = function\n  | [] -> n\n  | [p] -> if i = p then n + 1 else n\n  | p :: p' :: ps ->\n      if i = p then\n        solve (i + 1) (n + 1) (p :: ps)\n      else\n        solve (i + 1) n (p' :: ps)\nlet solve = solve 1 0\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let ps = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun p -> p)) in\n  Printf.printf \"%d\\n\" @@ solve ps", "language": "OCaml", "metadata": {"date": 1504772109, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03614.html", "problem_id": "p03614", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03614/input.txt", "sample_output_relpath": "derived/input_output/data/p03614/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03614/OCaml/s523570576.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s523570576", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec solve i n = function\n  | [] -> n\n  | [p] -> if i = p then n + 1 else n\n  | p :: p' :: ps ->\n      if i = p then\n        solve (i + 1) (n + 1) (p :: ps)\n      else\n        solve (i + 1) n (p' :: ps)\nlet solve = solve 1 0\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let ps = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun p -> p)) in\n  Printf.printf \"%d\\n\" @@ solve ps", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "sample_input": "5\n1 4 3 5 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03614", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 403, "cpu_time_ms": 29, "memory_kb": 5888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s773379492", "group_id": "codeNet:p03623", "input_text": "let x, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = print_endline @@ if abs @@ x - a < abs @@ x - b then \"A\" else \"B\"", "language": "OCaml", "metadata": {"date": 1565087594, "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/s773379492.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773379492", "user_id": "u732304692"}, "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 _ = print_endline @@ if abs @@ x - a < abs @@ x - b then \"A\" else \"B\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s338551120", "group_id": "codeNet:p03623", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let x, a, b = scanf \"%d %d %d\\n\" (fun x y z -> (x, y, z)) in\n  let ax = abs (x - a) in\n  let bx = abs (x - b) in\n  (if ax < bx then \"A\" else \"B\") |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1503328637, "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/s338551120.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s338551120", "user_id": "u388783188"}, "prompt_components": {"gold_output": "B\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let x, a, b = scanf \"%d %d %d\\n\" (fun x y z -> (x, y, z)) in\n  let ax = abs (x - a) in\n  let bx = abs (x - b) in\n  (if ax < bx then \"A\" else \"B\") |> printf \"%s\\n\"\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s475769141", "group_id": "codeNet:p03626", "input_text": "let m = 1000000007\n\nlet () =\n  let n = read_int () in\n  let s1 = read_line () in\n  read_line () |> ignore;\n  let rec doit i ps =\n    if i = n then ps\n    else if i = n - 1 || s1.[i] <> s1.[i+1] then doit (i + 1) (true :: ps)\n    else doit (i + 2) (false :: ps) in\n  match doit 0 [] with\n  | [] -> assert false\n  | p :: ps ->\n    let _, s = List.fold_left (fun (q, s) p ->\n      match q, p with\n      | true, true -> true, s * 2 mod m\n      | true, false -> false, s * 2 mod m\n      | false, true -> true, s\n      | false, false -> false, s * 3 mod m)\n      (if p then true, 3 else false, 6) ps in\n    Printf.printf \"%d\\n\" s", "language": "OCaml", "metadata": {"date": 1503327121, "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/s475769141.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s475769141", "user_id": "u322845568"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let m = 1000000007\n\nlet () =\n  let n = read_int () in\n  let s1 = read_line () in\n  read_line () |> ignore;\n  let rec doit i ps =\n    if i = n then ps\n    else if i = n - 1 || s1.[i] <> s1.[i+1] then doit (i + 1) (true :: ps)\n    else doit (i + 2) (false :: ps) in\n  match doit 0 [] with\n  | [] -> assert false\n  | p :: ps ->\n    let _, s = List.fold_left (fun (q, s) p ->\n      match q, p with\n      | true, true -> true, s * 2 mod m\n      | true, false -> false, s * 2 mod m\n      | false, true -> true, s\n      | false, false -> false, s * 3 mod m)\n      (if p then true, 3 else false, 6) ps in\n    Printf.printf \"%d\\n\" s", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s761476568", "group_id": "codeNet:p03627", "input_text": "module CharMap = Map.Make (Char)\n\nlet alphabet =\n  [ 'a'; 'b'; 'c'; 'd'; 'e'; 'f'; 'g'; 'h'; 'i'; 'j'; 'k'; 'l'; 'm';\n    'n'; 'o'; 'p'; 'q'; 'r'; 's'; 't'; 'u'; 'v'; 'w'; 'x'; 'y'; 'z' ]\n\nlet () =\n  let a = read_line () in\n  let trie = Array.make (String.length a + 1) CharMap.empty in\n  for i = String.length a - 1 downto 0 do\n    trie.(i) <- CharMap.add a.[i] (i + 1) trie.(i + 1)\n  done;\n  let dp = Array.make (String.length a + 1) (0, []) in\n  for i = String.length a downto 0 do\n    dp.(i) <- List.fold_right (fun c -> min @@\n      match dp.(CharMap.find c trie.(i)) with\n      | exception Not_found -> (1, [c])\n      | (n, s) -> (1 + n, c :: s)) alphabet (max_int, [])\n  done;\n  List.iter print_char (snd dp.(0));\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1535959247, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03627.html", "problem_id": "p03627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03627/input.txt", "sample_output_relpath": "derived/input_output/data/p03627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03627/OCaml/s761476568.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761476568", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module CharMap = Map.Make (Char)\n\nlet alphabet =\n  [ 'a'; 'b'; 'c'; 'd'; 'e'; 'f'; 'g'; 'h'; 'i'; 'j'; 'k'; 'l'; 'm';\n    'n'; 'o'; 'p'; 'q'; 'r'; 's'; 't'; 'u'; 'v'; 'w'; 'x'; 'y'; 'z' ]\n\nlet () =\n  let a = read_line () in\n  let trie = Array.make (String.length a + 1) CharMap.empty in\n  for i = String.length a - 1 downto 0 do\n    trie.(i) <- CharMap.add a.[i] (i + 1) trie.(i + 1)\n  done;\n  let dp = Array.make (String.length a + 1) (0, []) in\n  for i = String.length a downto 0 do\n    dp.(i) <- List.fold_right (fun c -> min @@\n      match dp.(CharMap.find c trie.(i)) with\n      | exception Not_found -> (1, [c])\n      | (n, s) -> (1 + n, c :: s)) alphabet (max_int, [])\n  done;\n  List.iter print_char (snd dp.(0));\n  print_newline ()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03627", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 740, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s745419600", "group_id": "codeNet:p03631", "input_text": "let n = read_line ()\nlet _ = print_endline @@ if n.[0] = n.[2] then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1565087747, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03631.html", "problem_id": "p03631", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03631/input.txt", "sample_output_relpath": "derived/input_output/data/p03631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03631/OCaml/s745419600.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s745419600", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n = read_line ()\nlet _ = print_endline @@ if n.[0] = n.[2] then \"Yes\" else \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "sample_input": "575\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03631", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s824411981", "group_id": "codeNet:p03632", "input_text": "let main () = Scanf.sscanf (read_line ()) \"%d %d %d %d\"\n  (fun a b c d -> print_int(if b < c || d < a then 0\n    else if b = d && a < c then d-c \n    else if b = d && a > c then d-a\n    else if a = c && b < d then c-b\n    else if a = c && b > d then c-d\n    else if a < c && b > d then d-c\n    else if a > c && d > b then b-a\n    else if a < c && b < d then (((b-a)+(d-c)) -(d-a)) else (((b-a)+(d-c)) -(b-c))))\nlet _ = main()", "language": "OCaml", "metadata": {"date": 1502590522, "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/s824411981.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s824411981", "user_id": "u160759921"}, "prompt_components": {"gold_output": "50\n", "input_to_evaluate": "let main () = Scanf.sscanf (read_line ()) \"%d %d %d %d\"\n  (fun a b c d -> print_int(if b < c || d < a then 0\n    else if b = d && a < c then d-c \n    else if b = d && a > c then d-a\n    else if a = c && b < d then c-b\n    else if a = c && b > d then c-d\n    else if a < c && b > d then d-c\n    else if a > c && d > b then b-a\n    else if a < c && b < d then (((b-a)+(d-c)) -(d-a)) else (((b-a)+(d-c)) -(b-c))))\nlet _ = main()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s026776408", "group_id": "codeNet:p03632", "input_text": "let main () = Scanf.sscanf (read_line ()) \"%d %d %d %d\"\n  (fun a b c d -> print_int(if b < c || d < a then 0\n    else if b = c then d-a\n    else if a = d then b-c\n    else if b = d && a < c then d-c \n    else if b = d && a > c then d-a\n    else if a = c && b < d then c-b\n    else if a = c && b > d then c-d\n    else if a < c && b > d then d-c\n    else if a > c && d > b then b-a\n    else if a < c && b < d then (((b-a)+(d-c)) -(d-a)) else (((b-a)+(d-c)) -(b-c))))\nlet _ = main()\n  ", "language": "OCaml", "metadata": {"date": 1502590051, "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/s026776408.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s026776408", "user_id": "u160759921"}, "prompt_components": {"gold_output": "50\n", "input_to_evaluate": "let main () = Scanf.sscanf (read_line ()) \"%d %d %d %d\"\n  (fun a b c d -> print_int(if b < c || d < a then 0\n    else if b = c then d-a\n    else if a = d then b-c\n    else if b = d && a < c then d-c \n    else if b = d && a > c then d-a\n    else if a = c && b < d then c-b\n    else if a = c && b > d then c-d\n    else if a < c && b > d then d-c\n    else if a > c && d > b then b-a\n    else if a < c && b < d then (((b-a)+(d-c)) -(d-a)) else (((b-a)+(d-c)) -(b-c))))\nlet _ = main()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s948687967", "group_id": "codeNet:p03632", "input_text": "let main () = Scanf.sscanf (read_line ()) \"%d %d %d %d\"\n  (fun a b c d -> print_int(if b < c || d < a then 0\n    else if a < c && b > d then d-c\n    else if a > c && d > b then b-a\n    else if a < c && b < d then (((b-a)+(d-c)) -(d-a)) else (((b-a)+(d-c)) -(b-c))))\nlet _ = main()", "language": "OCaml", "metadata": {"date": 1502588817, "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/s948687967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s948687967", "user_id": "u160759921"}, "prompt_components": {"gold_output": "50\n", "input_to_evaluate": "let main () = Scanf.sscanf (read_line ()) \"%d %d %d %d\"\n  (fun a b c d -> print_int(if b < c || d < a then 0\n    else if a < c && b > d then d-c\n    else if a > c && d > b then b-a\n    else if a < c && b < d then (((b-a)+(d-c)) -(d-a)) else (((b-a)+(d-c)) -(b-c))))\nlet _ = main()", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 280, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s007536484", "group_id": "codeNet:p03633", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun t -> t)) in\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\n    let rec loop i acc =\n        if i = n then acc else loop (i + 1) (lcm acc t.(i))\n    in\n    loop 1 t.(0) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1592874298, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03633.html", "problem_id": "p03633", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03633/input.txt", "sample_output_relpath": "derived/input_output/data/p03633/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03633/OCaml/s007536484.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007536484", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\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 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\n    let rec loop i acc =\n        if i = n then acc else loop (i + 1) (lcm acc t.(i))\n    in\n    loop 1 t.(0) |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "sample_input": "2\n2\n3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03633", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s846401031", "group_id": "codeNet:p03633", "input_text": "let rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet lcm a b = a / gcd a b * b\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet xs = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\nlet () = Array.fold_left lcm 1 xs |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1528057913, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03633.html", "problem_id": "p03633", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03633/input.txt", "sample_output_relpath": "derived/input_output/data/p03633/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03633/OCaml/s846401031.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s846401031", "user_id": "u798181098"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet lcm a b = a / gcd a b * b\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet xs = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\nlet () = Array.fold_left lcm 1 xs |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "sample_input": "2\n2\n3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03633", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s355576829", "group_id": "codeNet:p03634", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let nei = Array.make n [] in\n    for i = 1 to n - 1 do\n        Scanf.scanf \" %d %d %d\" (fun a b c ->\n            let a, b = a - 1, b - 1 in\n            nei.(a) <- (c, b) :: nei.(a);\n            nei.(b) <- (c, a) :: nei.(b);\n        )\n    done;\n    Scanf.scanf \" %d %d\" (fun q k ->\n        let k = k - 1 in\n        let dist = Array.make n (max_int / n) in\n        dist.(k) <- 0;\n        let rec loop next = function\n            | [] -> if next <> [] then loop [] next\n            | hd :: tl ->\n                    let cur = dist.(hd) in\n                    let next = List.fold_left (fun next (c, v) ->\n                        if dist.(v) > cur + c then (\n                            dist.(v) <- cur + c;\n                            v :: next\n                        ) else next\n                    ) next nei.(hd) in\n                    loop next tl\n        in\n        loop [] [ k ];\n        for i = 1 to q do\n            Scanf.scanf \" %d %d\" (fun x y ->\n                let x, y = x - 1, y - 1 in\n                Printf.printf \"%d\\n\" (dist.(x) + dist.(y))\n            )\n        done\n    )\n)", "language": "OCaml", "metadata": {"date": 1592872013, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s355576829.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s355576829", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n2\n4\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let nei = Array.make n [] in\n    for i = 1 to n - 1 do\n        Scanf.scanf \" %d %d %d\" (fun a b c ->\n            let a, b = a - 1, b - 1 in\n            nei.(a) <- (c, b) :: nei.(a);\n            nei.(b) <- (c, a) :: nei.(b);\n        )\n    done;\n    Scanf.scanf \" %d %d\" (fun q k ->\n        let k = k - 1 in\n        let dist = Array.make n (max_int / n) in\n        dist.(k) <- 0;\n        let rec loop next = function\n            | [] -> if next <> [] then loop [] next\n            | hd :: tl ->\n                    let cur = dist.(hd) in\n                    let next = List.fold_left (fun next (c, v) ->\n                        if dist.(v) > cur + c then (\n                            dist.(v) <- cur + c;\n                            v :: next\n                        ) else next\n                    ) next nei.(hd) in\n                    loop next tl\n        in\n        loop [] [ k ];\n        for i = 1 to q do\n            Scanf.scanf \" %d %d\" (fun x y ->\n                let x, y = x - 1, y - 1 in\n                Printf.printf \"%d\\n\" (dist.(x) + dist.(y))\n            )\n        done\n    )\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1122, "cpu_time_ms": 147, "memory_kb": 19888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s515439249", "group_id": "codeNet:p03634", "input_text": "module M = Set.Make(struct type t = int * int let compare = compare end)\nlet inf = 1010101010101010\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let g = Array.init (n+1) (fun _ -> []) in\n  for _ = 1 to n-1 do\n    Scanf.scanf \" %d %d %d\" @@ fun a b c ->\n    g.(a) <- (b, c) :: g.(a);\n    g.(b) <- (a, c) :: g.(b);\n  done;\n\n  Scanf.scanf \" %d %d\" @@ fun q k ->\n\n  let dist = Array.make (n+1) inf in\n  dist.(k) <- 0;\n\n  let rec loop pqi =\n    if M.is_empty pqi then () else\n    let (d, u) = M.min_elt pqi in\n    let pqi' = M.remove (d,u) pqi in\n\n    if d > dist.(u) then loop pqi' else\n      g.(u) |> List.fold_left (fun pq (v, c) ->\n        if d+c < dist.(v) then begin\n          dist.(v) <- d+c;\n          M.add (d+c, v) pq\n        end else pq) pqi'\n    |> loop\n  in loop (M.singleton (0, k));\n\n  for _ = 1 to q do\n    Scanf.scanf \" %d %d\" @@ fun x y ->\n    dist.(x) + dist.(y) |> Printf.printf \"%d\\n\"\n  done", "language": "OCaml", "metadata": {"date": 1532646844, "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/s515439249.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s515439249", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n2\n4\n", "input_to_evaluate": "module M = Set.Make(struct type t = int * int let compare = compare end)\nlet inf = 1010101010101010\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let g = Array.init (n+1) (fun _ -> []) in\n  for _ = 1 to n-1 do\n    Scanf.scanf \" %d %d %d\" @@ fun a b c ->\n    g.(a) <- (b, c) :: g.(a);\n    g.(b) <- (a, c) :: g.(b);\n  done;\n\n  Scanf.scanf \" %d %d\" @@ fun q k ->\n\n  let dist = Array.make (n+1) inf in\n  dist.(k) <- 0;\n\n  let rec loop pqi =\n    if M.is_empty pqi then () else\n    let (d, u) = M.min_elt pqi in\n    let pqi' = M.remove (d,u) pqi in\n\n    if d > dist.(u) then loop pqi' else\n      g.(u) |> List.fold_left (fun pq (v, c) ->\n        if d+c < dist.(v) then begin\n          dist.(v) <- d+c;\n          M.add (d+c, v) pq\n        end else pq) pqi'\n    |> loop\n  in loop (M.singleton (0, k));\n\n  for _ = 1 to q do\n    Scanf.scanf \" %d %d\" @@ fun x y ->\n    dist.(x) + dist.(y) |> Printf.printf \"%d\\n\"\n  done", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 905, "cpu_time_ms": 335, "memory_kb": 32128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s060364658", "group_id": "codeNet:p03634", "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 t n k =\n  let reached_p = Array.make n false in\n  let d = Array.make n max_int in\n  d.(k) <- 0;\n  let h = H.make 10000 (0, 0) in\n  H.push (k, 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      Array.iteri (fun v c ->\n        if c = max_int then ()\n        else begin\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\n        end) t.(u);\n  done;\n  d\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun i -> i) in\n  let t = Array.make_matrix n n max_int in\n  for _ = 1 to n - 1 do\n    let a, b, c = Scanf.scanf \"%d %d %d \" (fun a b c -> a, b, c) in\n    let a, b = a - 1, b - 1 in\n    t.(a).(b) <- c;\n    t.(b).(a) <- c;\n  done;\n  let q, k = Scanf.scanf \"%d %d \" (fun q k -> q, k) in\n  let k = k - 1 in\n  let d = dijkstra t n k in\n  for _ = 0 to q - 1 do\n    let x, y = Scanf.scanf \"%d %d \" (fun x y -> x, y) in\n    let x, y = x - 1, y - 1 in\n    Printf.printf \"%d\\n\" (d.(x) + d.(y))\n  done", "language": "OCaml", "metadata": {"date": 1502625950, "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/s060364658.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s060364658", "user_id": "u322845568"}, "prompt_components": {"gold_output": "3\n2\n4\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 t n k =\n  let reached_p = Array.make n false in\n  let d = Array.make n max_int in\n  d.(k) <- 0;\n  let h = H.make 10000 (0, 0) in\n  H.push (k, 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      Array.iteri (fun v c ->\n        if c = max_int then ()\n        else begin\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\n        end) t.(u);\n  done;\n  d\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun i -> i) in\n  let t = Array.make_matrix n n max_int in\n  for _ = 1 to n - 1 do\n    let a, b, c = Scanf.scanf \"%d %d %d \" (fun a b c -> a, b, c) in\n    let a, b = a - 1, b - 1 in\n    t.(a).(b) <- c;\n    t.(b).(a) <- c;\n  done;\n  let q, k = Scanf.scanf \"%d %d \" (fun q k -> q, k) in\n  let k = k - 1 in\n  let d = dijkstra t n k in\n  for _ = 0 to q - 1 do\n    let x, y = Scanf.scanf \"%d %d \" (fun x y -> x, y) in\n    let x, y = x - 1, y - 1 in\n    Printf.printf \"%d\\n\" (d.(x) + d.(y))\n  done", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2422, "cpu_time_ms": 9617, "memory_kb": 614232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s992492254", "group_id": "codeNet:p03635", "input_text": "let ans = Scanf.scanf \"%d %d\\n\" (fun a b -> string_of_int ((a-1) * (b-1)))\nlet () = List.iter print_endline [ans]", "language": "OCaml", "metadata": {"date": 1587958530, "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/s992492254.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992492254", "user_id": "u307426615"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let ans = Scanf.scanf \"%d %d\\n\" (fun a b -> string_of_int ((a-1) * (b-1)))\nlet () = List.iter print_endline [ans]", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s182348604", "group_id": "codeNet:p03635", "input_text": "let () = Scanf.scanf \"%d %d\"\n(fun a b -> (a-1)*(b-1))\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561076768, "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/s182348604.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182348604", "user_id": "u635974378"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\"\n(fun a b -> (a-1)*(b-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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s363208637", "group_id": "codeNet:p03635", "input_text": "Scanf.sscanf (read_line ()) \"%d %d\" \n             (fun x y -> Printf.printf \"%d\" ((x-1)*(y-1)));;\n", "language": "OCaml", "metadata": {"date": 1502145207, "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/s363208637.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s363208637", "user_id": "u470717435"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d %d\" \n             (fun x y -> Printf.printf \"%d\" ((x-1)*(y-1)));;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s419804405", "group_id": "codeNet:p03636", "input_text": "open Batteries\nopen Printf\nlet () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  \n  let i18n str =\n    let len = String.length str in\n    if len < 3 then failwith \"too small\" else\n    let fst = String.slice ~last:1 str in\n    let mid = string_of_int (len-2) in\n    let lst = String.slice ~first:(len-1) str in\n    fst ^ mid ^ lst\n  in\n\n  Printf.printf \"%s\\n\" @@\n  i18n s\n", "language": "OCaml", "metadata": {"date": 1529316807, "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/s419804405.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s419804405", "user_id": "u139013163"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  \n  let i18n str =\n    let len = String.length str in\n    if len < 3 then failwith \"too small\" else\n    let fst = String.slice ~last:1 str in\n    let mid = string_of_int (len-2) in\n    let lst = String.slice ~first:(len-1) str in\n    fst ^ mid ^ lst\n  in\n\n  Printf.printf \"%s\\n\" @@\n  i18n s\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s364392176", "group_id": "codeNet:p03636", "input_text": "let () =\n  let s = Scanf.scanf \"%s\" (fun s -> s) in\n  let len = String.length s in \n  Printf.printf \"%c%d%c\\n\" s.[0]  (len - 2)  s.[len-1]", "language": "OCaml", "metadata": {"date": 1521580631, "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/s364392176.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364392176", "user_id": "u987869509"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "let () =\n  let s = Scanf.scanf \"%s\" (fun s -> s) in\n  let len = String.length s in \n  Printf.printf \"%c%d%c\\n\" s.[0]  (len - 2)  s.[len-1]", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s189029994", "group_id": "codeNet:p03636", "input_text": "open Printf\nopen Scanf\n\nlet () =\n        let s = read_line() in\n        printf \"%c%d%c\\n\" s.[0] ((String.length s) - 2) s.[((String.length s) - 1)]\n", "language": "OCaml", "metadata": {"date": 1504909719, "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/s189029994.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189029994", "user_id": "u625631018"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n        let s = read_line() in\n        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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s555460678", "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 < o + 1 then \"No\" else \"Yes\")", "language": "OCaml", "metadata": {"date": 1502070297, "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/s555460678.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s555460678", "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 < o + 1 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 289, "cpu_time_ms": 33, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s594455104", "group_id": "codeNet:p03643", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  Printf.printf \"ABC%03d\\n\" n\n", "language": "OCaml", "metadata": {"date": 1530676940, "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/s594455104.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594455104", "user_id": "u504158101"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  Printf.printf \"ABC%03d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s035883302", "group_id": "codeNet:p03643", "input_text": "let () = read_line () |> Printf.printf \"ABC%s\\n\"", "language": "OCaml", "metadata": {"date": 1501435370, "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/s035883302.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035883302", "user_id": "u322845568"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "let () = read_line () |> Printf.printf \"ABC%s\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 48, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s359067785", "group_id": "codeNet:p03644", "input_text": "let n = read_int ()\nlet m = ref 1\nlet _ = while !m * 2 <= n do m := !m * 2 done; Printf.printf \"%d\\n\" @@ !m", "language": "OCaml", "metadata": {"date": 1569204956, "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/s359067785.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359067785", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let n = read_int ()\nlet m = ref 1\nlet _ = while !m * 2 <= n do m := !m * 2 done; Printf.printf \"%d\\n\" @@ !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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 107, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s360906891", "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  Printf.printf \"%d\\n\" @@ (n + 1) lsr 1\n", "language": "OCaml", "metadata": {"date": 1530677254, "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/s360906891.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360906891", "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  Printf.printf \"%d\\n\" @@ (n + 1) lsr 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s431771971", "group_id": "codeNet:p03644", "input_text": "let f n = log n /. log 2. |> floor |> ( ** ) 2.\nlet () = f (read_float ()) |> Printf.printf \"%.f\\n\"", "language": "OCaml", "metadata": {"date": 1524605054, "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/s431771971.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s431771971", "user_id": "u987869509"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let f n = log n /. log 2. |> floor |> ( ** ) 2.\nlet () = f (read_float ()) |> Printf.printf \"%.f\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 99, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s253377860", "group_id": "codeNet:p03644", "input_text": "let () =\n  let n = read_int () in\n  let rec find x =\n    let y = 2 * x in\n    if y > n then x else find y\n  in find 1 |> string_of_int |> print_endline\n", "language": "OCaml", "metadata": {"date": 1501436618, "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/s253377860.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s253377860", "user_id": "u388783188"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () =\n  let n = read_int () in\n  let rec find x =\n    let y = 2 * x in\n    if y > n then x else find y\n  in find 1 |> string_of_int |> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s394078844", "group_id": "codeNet:p03645", "input_text": "let read_ns () = Scanf.scanf \"%d %d \" (fun x y -> (x, y))\n\nlet bfs g goal =\n  let que = Queue.create () in\n  Queue.push 0 que;\n  let rec doit depth reach_p =\n    if reach_p && depth <= 2 then \"POSSIBLE\"\n    else if Queue.is_empty que || depth > 2 then \"IMPOSSIBLE\"\n    else begin\n      let n = Queue.pop que in\n      let p = ref false in\n      List.iter (fun e ->\n        Queue.push e que; if e = goal then p := true)\n        g.(n);\n      doit (depth + 1) !p\n    end in\n  doit 0 false\n\nlet () =\n  let (n, m) = read_ns () in\n  let g = Array.make n [] in\n  for _ = 0 to m - 1 do\n    let (a, b) = read_ns () in\n    let (a, b) = (a - 1, b - 1) in\n    g.(a) <- b :: g.(a);\n    g.(b) <- a :: g.(b);\n  done;\n  bfs g (n - 1) |> print_endline", "language": "OCaml", "metadata": {"date": 1501378463, "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/s394078844.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394078844", "user_id": "u322845568"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "let read_ns () = Scanf.scanf \"%d %d \" (fun x y -> (x, y))\n\nlet bfs g goal =\n  let que = Queue.create () in\n  Queue.push 0 que;\n  let rec doit depth reach_p =\n    if reach_p && depth <= 2 then \"POSSIBLE\"\n    else if Queue.is_empty que || depth > 2 then \"IMPOSSIBLE\"\n    else begin\n      let n = Queue.pop que in\n      let p = ref false in\n      List.iter (fun e ->\n        Queue.push e que; if e = goal then p := true)\n        g.(n);\n      doit (depth + 1) !p\n    end in\n  doit 0 false\n\nlet () =\n  let (n, m) = read_ns () in\n  let g = Array.make n [] in\n  for _ = 0 to m - 1 do\n    let (a, b) = read_ns () in\n    let (a, b) = (a - 1, b - 1) in\n    g.(a) <- b :: g.(a);\n    g.(b) <- a :: g.(b);\n  done;\n  bfs g (n - 1) |> print_endline", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 733, "cpu_time_ms": 140, "memory_kb": 16128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s268640587", "group_id": "codeNet:p03646", "input_text": "let () =\n  Scanf.scanf \"%d\" @@ fun k ->\n  let n = 50 in\n  let d, r = k / n, k mod n in\n  Printf.printf \"%d\\n\" n;\n  for i = 0 to n-1 do\n    (if i < r then n+d else n+d-1-r) |> Printf.printf \"%d \"\n  done;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1532644492, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03646.html", "problem_id": "p03646", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03646/input.txt", "sample_output_relpath": "derived/input_output/data/p03646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03646/OCaml/s268640587.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s268640587", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n3 3 3 3\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\" @@ fun k ->\n  let n = 50 in\n  let d, r = k / n, k mod n in\n  Printf.printf \"%d\\n\" n;\n  for i = 0 to n-1 do\n    (if i < r then n+d else n+d-1-r) |> Printf.printf \"%d \"\n  done;\n  print_newline ()", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given an integer K. Find an integer sequence a_i such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.\n\nConstraints\n\n0 ≤ K ≤ 50 \\times 10^{16}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint a solution in the following format:\n\nN\na_1 a_2 ... a_N\n\nHere, 2 ≤ N ≤ 50 and 0 ≤ a_i ≤ 10^{16} + 1000 must hold.\n\nSample Input 1\n\n0\n\nSample Output 1\n\n4\n3 3 3 3\n\nSample Input 2\n\n1\n\nSample Output 2\n\n3\n1 0 3\n\nSample Input 3\n\n2\n\nSample Output 3\n\n2\n2 2\n\nThe operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].\n\nSample Input 4\n\n3\n\nSample Output 4\n\n7\n27 0 0 0 0 0 0\n\nSample Input 5\n\n1234567894848\n\nSample Output 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425", "sample_input": "0\n"}, "reference_outputs": ["4\n3 3 3 3\n"], "source_document_id": "p03646", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given an integer K. Find an integer sequence a_i such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.\n\nConstraints\n\n0 ≤ K ≤ 50 \\times 10^{16}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint a solution in the following format:\n\nN\na_1 a_2 ... a_N\n\nHere, 2 ≤ N ≤ 50 and 0 ≤ a_i ≤ 10^{16} + 1000 must hold.\n\nSample Input 1\n\n0\n\nSample Output 1\n\n4\n3 3 3 3\n\nSample Input 2\n\n1\n\nSample Output 2\n\n3\n1 0 3\n\nSample Input 3\n\n2\n\nSample Output 3\n\n2\n2 2\n\nThe operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].\n\nSample Input 4\n\n3\n\nSample Output 4\n\n7\n27 0 0 0 0 0 0\n\nSample Input 5\n\n1234567894848\n\nSample Output 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s423822463", "group_id": "codeNet:p03651", "input_text": "let rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet _ = Scanf.scanf \"%d %d\" @@ fun n k ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let v = Array.fold_left gcd a.(0) a in\n  Array.fold_left (fun b x -> b || x >= k && (x - k) mod v = 0) false a\n  |> fun b -> print_endline (if b then \"POSSIBLE\" else \"IMPOSSIBLE\")", "language": "OCaml", "metadata": {"date": 1534485983, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03651.html", "problem_id": "p03651", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03651/input.txt", "sample_output_relpath": "derived/input_output/data/p03651/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03651/OCaml/s423822463.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s423822463", "user_id": "u798181098"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "let rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet _ = Scanf.scanf \"%d %d\" @@ fun n k ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let v = Array.fold_left gcd a.(0) a in\n  Array.fold_left (fun b x -> b || x >= k && (x - k) mod v = 0) false a\n  |> fun b -> print_endline (if b then \"POSSIBLE\" else \"IMPOSSIBLE\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a box containing N balls. The i-th ball has the integer A_i written on it.\nSnuke can perform the following operation any number of times:\n\nTake out two balls from the box. Then, return them to the box along with a new ball, on which the absolute difference of the integers written on the two balls is written.\n\nDetermine whether it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nIf it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written, print POSSIBLE; if it is not possible, print IMPOSSIBLE.\n\nSample Input 1\n\n3 7\n9 3 4\n\nSample Output 1\n\nPOSSIBLE\n\nFirst, take out the two balls 9 and 4, and return them back along with a new ball, abs(9-4)=5.\nNext, take out 3 and 5, and return them back along with abs(3-5)=2.\nFinally, take out 9 and 2, and return them back along with abs(9-2)=7.\nNow we have 7 in the box, and the answer is therefore POSSIBLE.\n\nSample Input 2\n\n3 5\n6 9 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo matter what we do, it is not possible to have 5 in the box. The answer is therefore IMPOSSIBLE.\n\nSample Input 3\n\n4 11\n11 3 7 15\n\nSample Output 3\n\nPOSSIBLE\n\nThe box already contains 11 before we do anything. The answer is therefore POSSIBLE.\n\nSample Input 4\n\n5 12\n10 2 8 6 4\n\nSample Output 4\n\nIMPOSSIBLE", "sample_input": "3 7\n9 3 4\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03651", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a box containing N balls. The i-th ball has the integer A_i written on it.\nSnuke can perform the following operation any number of times:\n\nTake out two balls from the box. Then, return them to the box along with a new ball, on which the absolute difference of the integers written on the two balls is written.\n\nDetermine whether it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nIf it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written, print POSSIBLE; if it is not possible, print IMPOSSIBLE.\n\nSample Input 1\n\n3 7\n9 3 4\n\nSample Output 1\n\nPOSSIBLE\n\nFirst, take out the two balls 9 and 4, and return them back along with a new ball, abs(9-4)=5.\nNext, take out 3 and 5, and return them back along with abs(3-5)=2.\nFinally, take out 9 and 2, and return them back along with abs(9-2)=7.\nNow we have 7 in the box, and the answer is therefore POSSIBLE.\n\nSample Input 2\n\n3 5\n6 9 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo matter what we do, it is not possible to have 5 in the box. The answer is therefore IMPOSSIBLE.\n\nSample Input 3\n\n4 11\n11 3 7 15\n\nSample Output 3\n\nPOSSIBLE\n\nThe box already contains 11 before we do anything. The answer is therefore POSSIBLE.\n\nSample Input 4\n\n5 12\n10 2 8 6 4\n\nSample Output 4\n\nIMPOSSIBLE", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 341, "cpu_time_ms": 34, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s695284128", "group_id": "codeNet:p03657", "input_text": "let _ =\n    let [a; b] = List.map int_of_string (Str.split (Str.regexp \" \") (read_line ())) in\n    if a mod 3 = 0 || b mod 3 = 0 || (a+b) mod 3 = 0 then print_string \"Possible\"\n    else print_string \"Impossible\"", "language": "OCaml", "metadata": {"date": 1500168245, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03657.html", "problem_id": "p03657", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03657/input.txt", "sample_output_relpath": "derived/input_output/data/p03657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03657/OCaml/s695284128.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s695284128", "user_id": "u680714545"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "let _ =\n    let [a; b] = List.map int_of_string (Str.split (Str.regexp \" \") (read_line ())) in\n    if a mod 3 = 0 || b mod 3 = 0 || (a+b) mod 3 = 0 then print_string \"Possible\"\n    else print_string \"Impossible\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is giving cookies to his three goats.\n\nHe has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).\n\nYour task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.\n\nConstraints\n\n1 \\leq A,B \\leq 100\n\nBoth A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf it is possible to give cookies so that each of the three goats can have the same number of cookies, print Possible; otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nPossible\n\nIf Snuke gives nine cookies, each of the three goats can have three cookies.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nImpossible\n\nSince there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.", "sample_input": "4 5\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03657", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is giving cookies to his three goats.\n\nHe has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).\n\nYour task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.\n\nConstraints\n\n1 \\leq A,B \\leq 100\n\nBoth A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf it is possible to give cookies so that each of the three goats can have the same number of cookies, print Possible; otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nPossible\n\nIf Snuke gives nine cookies, each of the three goats can have three cookies.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nImpossible\n\nSince there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s535106926", "group_id": "codeNet:p03658", "input_text": "open Batteries\n\nlet n,k = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\nlet () = read_line ()\n  |> String.split_on_char ' '\n  |> List.map int_of_string\n  |> List.sort compare\n  |> List.rev\n  |> Batteries.List.take k\n  |> List.fold_left (+) 0\n  |> Printf.sprintf \"%d\"\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1589947594, "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/s535106926.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s535106926", "user_id": "u173515518"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "open Batteries\n\nlet n,k = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\nlet () = read_line ()\n  |> String.split_on_char ' '\n  |> List.map int_of_string\n  |> List.sort compare\n  |> List.rev\n  |> Batteries.List.take k\n  |> List.fold_left (+) 0\n  |> Printf.sprintf \"%d\"\n  |> print_endline", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s686069577", "group_id": "codeNet:p03658", "input_text": "open Batteries\n\nlet rec print_int_list = function\n  | [] -> print_endline \"DONE\"\n  | x :: xs -> Printf.printf \"%d \" x ; print_int_list xs\n\nlet () =\n  let n, k = Scanf.scanf \" %d %d \" (fun n k -> (n, k)) in\n  List.init n (fun _ -> Scanf.scanf \" %d\" (fun li -> li))\n  |> List.sort (fun x y -> y - x)\n  (* |> print_int_list *)\n  |> List.take k |> List.fold_left ( + ) 0 |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1551065658, "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/s686069577.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s686069577", "user_id": "u406828576"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "open Batteries\n\nlet rec print_int_list = function\n  | [] -> print_endline \"DONE\"\n  | x :: xs -> Printf.printf \"%d \" x ; print_int_list xs\n\nlet () =\n  let n, k = Scanf.scanf \" %d %d \" (fun n k -> (n, k)) in\n  List.init n (fun _ -> Scanf.scanf \" %d\" (fun li -> li))\n  |> List.sort (fun x y -> y - x)\n  (* |> print_int_list *)\n  |> List.take k |> List.fold_left ( + ) 0 |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 391, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s258600145", "group_id": "codeNet:p03659", "input_text": "let inf = 10101010101010\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) |> Array.to_list\nlet sum = List.fold_left (+) 0 a\nlet f (v, s) a = if s+a = sum then v, s else min v (abs @@ sum - 2*(s+a)), s+a\nlet () =\n  List.fold_left f (inf, 0) a\n  |> fst |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1528055859, "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/s258600145.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s258600145", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let inf = 10101010101010\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) |> Array.to_list\nlet sum = List.fold_left (+) 0 a\nlet f (v, s) a = if s+a = sum then v, s else min v (abs @@ sum - 2*(s+a)), s+a\nlet () =\n  List.fold_left f (inf, 0) a\n  |> fst |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 66, "memory_kb": 8960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s798994008", "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": 1531751682, "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/s798994008.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s798994008", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3703, "cpu_time_ms": 153, "memory_kb": 34556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s779447670", "group_id": "codeNet:p03660", "input_text": "let dfs g n =\n  let que = Queue.create () in\n  Queue.push 1 que;\n  let reached_p = Array.make (n + 1) false in\n  reached_p.(1) <- true;\n  let rec doit depth n_p =\n    if n_p || Queue.is_empty que then depth\n    else begin\n      let x = Queue.pop que in\n      let n_p = ref false in\n      List.iter (fun e ->\n        if not reached_p.(e) then begin\n          reached_p.(e) <- true;\n          Queue.push e que;\n          if e = n then n_p := true;\n        end)\n        g.(x);\n      doit (depth + 1) !n_p\n    end in\n  doit 0 false\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun i -> i) in\n  let g = Array.make (n + 1) [] in\n  for _ = 1 to n - 1 do\n    let (x, y) = Scanf.scanf \"%d %d \" (fun x y -> (x, y)) in\n    g.(x) <- y :: g.(x);\n    g.(y) <- x :: g.(y);\n  done;\n  let x = dfs g n in\n  print_endline (if x = 1 then \"Snuke\" else \"Fennec\")", "language": "OCaml", "metadata": {"date": 1501369275, "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/s779447670.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s779447670", "user_id": "u322845568"}, "prompt_components": {"gold_output": "Fennec\n", "input_to_evaluate": "let dfs g n =\n  let que = Queue.create () in\n  Queue.push 1 que;\n  let reached_p = Array.make (n + 1) false in\n  reached_p.(1) <- true;\n  let rec doit depth n_p =\n    if n_p || Queue.is_empty que then depth\n    else begin\n      let x = Queue.pop que in\n      let n_p = ref false in\n      List.iter (fun e ->\n        if not reached_p.(e) then begin\n          reached_p.(e) <- true;\n          Queue.push e que;\n          if e = n then n_p := true;\n        end)\n        g.(x);\n      doit (depth + 1) !n_p\n    end in\n  doit 0 false\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun i -> i) in\n  let g = Array.make (n + 1) [] in\n  for _ = 1 to n - 1 do\n    let (x, y) = Scanf.scanf \"%d %d \" (fun x y -> (x, y)) in\n    g.(x) <- y :: g.(x);\n    g.(y) <- x :: g.(y);\n  done;\n  let x = dfs g n in\n  print_endline (if x = 1 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 834, "cpu_time_ms": 73, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s825043571", "group_id": "codeNet:p03661", "input_text": "open Str\n\nlet read_list f =\n  split (regexp \" +\") (read_line ()) |> List.map f\n\nlet () =\n  let n = read_int () in\n  let al = read_list int_of_string in\n  let rec iter sn ar mx = function\n      x :: [] -> mx\n    | x :: xs -> let sn' = sn + x in\n                 let ar' = ar - x in\n                 iter sn' ar' (min (abs (sn' - ar')) mx) xs\n    | _ -> failwith \"splitting_pile\"\n  in\n  let sn = List.hd al in\n  let ar = List.fold_left (+) 0 (List.tl al) in\n  iter sn ar (abs (sn - ar)) (List.tl al) |> string_of_int |> print_endline\n", "language": "OCaml", "metadata": {"date": 1500167940, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03661.html", "problem_id": "p03661", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03661/input.txt", "sample_output_relpath": "derived/input_output/data/p03661/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03661/OCaml/s825043571.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s825043571", "user_id": "u388783188"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Str\n\nlet read_list f =\n  split (regexp \" +\") (read_line ()) |> List.map f\n\nlet () =\n  let n = read_int () in\n  let al = read_list int_of_string in\n  let rec iter sn ar mx = function\n      x :: [] -> mx\n    | x :: xs -> let sn' = sn + x in\n                 let ar' = ar - x in\n                 iter sn' ar' (min (abs (sn' - ar')) mx) xs\n    | _ -> failwith \"splitting_pile\"\n  in\n  let sn = List.hd al in\n  let ar = List.fold_left (+) 0 (List.tl al) in\n  iter sn ar (abs (sn - ar)) (List.tl al) |> string_of_int |> print_endline\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": "p03661", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 89, "memory_kb": 25600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s735041079", "group_id": "codeNet:p03665", "input_text": "Scanf.scanf \"%d %d\" (fun n p ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let rec loop i p0 p1 =\n        if i = n then (if p = 0 then p0 else p1) else\n            if a.(i) mod 2 = 0 then loop (i + 1) (p0 * 2) (p1 * 2) else\n                                    loop (i + 1) (p0 + p1) (p0 + p1)\n    in\n    loop 0 1 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1599002174, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03665.html", "problem_id": "p03665", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03665/input.txt", "sample_output_relpath": "derived/input_output/data/p03665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03665/OCaml/s735041079.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735041079", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n p ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let rec loop i p0 p1 =\n        if i = n then (if p = 0 then p0 else p1) else\n            if a.(i) mod 2 = 0 then loop (i + 1) (p0 * 2) (p1 * 2) else\n                                    loop (i + 1) (p0 + p1) (p0 + p1)\n    in\n    loop 0 1 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N bags of biscuits. The i-th bag contains A_i biscuits.\n\nTakaki will select some of these bags and eat all of the biscuits inside.\nHere, it is also possible to select all or none of the bags.\n\nHe would like to select bags so that the total number of biscuits inside is congruent to P modulo 2.\nHow many such ways to select bags there are?\n\nConstraints\n\n1 \\leq N \\leq 50\n\nP = 0 or 1\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.\n\nSample Input 1\n\n2 0\n1 3\n\nSample Output 1\n\n2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:\n\nSelect neither bag. The total number of biscuits is 0.\n\nSelect both bags. The total number of biscuits is 4.\n\nSample Input 2\n\n1 1\n50\n\nSample Output 2\n\n0\n\nSample Input 3\n\n3 0\n1 1 1\n\nSample Output 3\n\n4\n\nTwo bags are distinguished even if they contain the same number of biscuits.\n\nSample Input 4\n\n45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26\n\nSample Output 4\n\n17592186044416", "sample_input": "2 0\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03665", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N bags of biscuits. The i-th bag contains A_i biscuits.\n\nTakaki will select some of these bags and eat all of the biscuits inside.\nHere, it is also possible to select all or none of the bags.\n\nHe would like to select bags so that the total number of biscuits inside is congruent to P modulo 2.\nHow many such ways to select bags there are?\n\nConstraints\n\n1 \\leq N \\leq 50\n\nP = 0 or 1\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.\n\nSample Input 1\n\n2 0\n1 3\n\nSample Output 1\n\n2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:\n\nSelect neither bag. The total number of biscuits is 0.\n\nSelect both bags. The total number of biscuits is 4.\n\nSample Input 2\n\n1 1\n50\n\nSample Output 2\n\n0\n\nSample Input 3\n\n3 0\n1 1 1\n\nSample Output 3\n\n4\n\nTwo bags are distinguished even if they contain the same number of biscuits.\n\nSample Input 4\n\n45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26\n\nSample Output 4\n\n17592186044416", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s655418672", "group_id": "codeNet:p03665", "input_text": "let () =\n  let n, p = Scanf.scanf \"%d %d\\n\" (fun n p -> n, p) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  Array.fold_left (fun (odd, even) a ->\n    if a mod 2 = 0 then (2 * odd, 2 * even)\n    else (odd + even, odd + even)) (0, 1) as_\n  |> (if p = 1 then fst else snd)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1499649146, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03665.html", "problem_id": "p03665", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03665/input.txt", "sample_output_relpath": "derived/input_output/data/p03665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03665/OCaml/s655418672.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s655418672", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n, p = Scanf.scanf \"%d %d\\n\" (fun n p -> n, p) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  Array.fold_left (fun (odd, even) a ->\n    if a mod 2 = 0 then (2 * odd, 2 * even)\n    else (odd + even, odd + even)) (0, 1) as_\n  |> (if p = 1 then fst else snd)\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N bags of biscuits. The i-th bag contains A_i biscuits.\n\nTakaki will select some of these bags and eat all of the biscuits inside.\nHere, it is also possible to select all or none of the bags.\n\nHe would like to select bags so that the total number of biscuits inside is congruent to P modulo 2.\nHow many such ways to select bags there are?\n\nConstraints\n\n1 \\leq N \\leq 50\n\nP = 0 or 1\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.\n\nSample Input 1\n\n2 0\n1 3\n\nSample Output 1\n\n2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:\n\nSelect neither bag. The total number of biscuits is 0.\n\nSelect both bags. The total number of biscuits is 4.\n\nSample Input 2\n\n1 1\n50\n\nSample Output 2\n\n0\n\nSample Input 3\n\n3 0\n1 1 1\n\nSample Output 3\n\n4\n\nTwo bags are distinguished even if they contain the same number of biscuits.\n\nSample Input 4\n\n45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26\n\nSample Output 4\n\n17592186044416", "sample_input": "2 0\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03665", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N bags of biscuits. The i-th bag contains A_i biscuits.\n\nTakaki will select some of these bags and eat all of the biscuits inside.\nHere, it is also possible to select all or none of the bags.\n\nHe would like to select bags so that the total number of biscuits inside is congruent to P modulo 2.\nHow many such ways to select bags there are?\n\nConstraints\n\n1 \\leq N \\leq 50\n\nP = 0 or 1\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.\n\nSample Input 1\n\n2 0\n1 3\n\nSample Output 1\n\n2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:\n\nSelect neither bag. The total number of biscuits is 0.\n\nSelect both bags. The total number of biscuits is 4.\n\nSample Input 2\n\n1 1\n50\n\nSample Output 2\n\n0\n\nSample Input 3\n\n3 0\n1 1 1\n\nSample Output 3\n\n4\n\nTwo bags are distinguished even if they contain the same number of biscuits.\n\nSample Input 4\n\n45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26\n\nSample Output 4\n\n17592186044416", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 324, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s179790402", "group_id": "codeNet:p03666", "input_text": "Scanf.scanf \"%d %d %d %d %d\" (fun n a b c d ->\n    let rec loop m =\n        if m = n then false else\n            let q = (n - 1) - m in\n            if c * q - d * m <= b - a &&\n               d * q - c * m >= b - a then true else loop (m + 1)\n    in\n    print_endline @@ if loop 0 then \"YES\" else \"NO\"\n)", "language": "OCaml", "metadata": {"date": 1589614509, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03666.html", "problem_id": "p03666", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03666/input.txt", "sample_output_relpath": "derived/input_output/data/p03666/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03666/OCaml/s179790402.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179790402", "user_id": "u342443598"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d %d\" (fun n a b c d ->\n    let rec loop m =\n        if m = n then false else\n            let q = (n - 1) - m in\n            if c * q - d * m <= b - a &&\n               d * q - c * m >= b - a then true else loop (m + 1)\n    in\n    print_endline @@ if loop 0 then \"YES\" else \"NO\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares in a row.\nThe leftmost square contains the integer A, and the rightmost contains the integer B. The other squares are empty.\n\nAohashi would like to fill the empty squares with integers so that the following condition is satisfied:\n\nFor any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).\n\nAs long as the condition is satisfied, it is allowed to use arbitrarily large or small integers to fill the squares.\nDetermine whether it is possible to fill the squares under the condition.\n\nConstraints\n\n3 \\leq N \\leq 500000\n\n0 \\leq A \\leq 10^9\n\n0 \\leq B \\leq 10^9\n\n0 \\leq C \\leq D \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\n\nOutput\n\nPrint YES if it is possible to fill the squares under the condition; print NO otherwise.\n\nSample Input 1\n\n5 1 5 2 4\n\nSample Output 1\n\nYES\n\nFor example, fill the squares with the following integers: 1, -1, 3, 7, 5, from left to right.\n\nSample Input 2\n\n4 7 6 4 5\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n48792 105960835 681218449 90629745 90632170\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n491995 412925347 825318103 59999126 59999339\n\nSample Output 4\n\nYES", "sample_input": "5 1 5 2 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03666", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares in a row.\nThe leftmost square contains the integer A, and the rightmost contains the integer B. The other squares are empty.\n\nAohashi would like to fill the empty squares with integers so that the following condition is satisfied:\n\nFor any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).\n\nAs long as the condition is satisfied, it is allowed to use arbitrarily large or small integers to fill the squares.\nDetermine whether it is possible to fill the squares under the condition.\n\nConstraints\n\n3 \\leq N \\leq 500000\n\n0 \\leq A \\leq 10^9\n\n0 \\leq B \\leq 10^9\n\n0 \\leq C \\leq D \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\n\nOutput\n\nPrint YES if it is possible to fill the squares under the condition; print NO otherwise.\n\nSample Input 1\n\n5 1 5 2 4\n\nSample Output 1\n\nYES\n\nFor example, fill the squares with the following integers: 1, -1, 3, 7, 5, from left to right.\n\nSample Input 2\n\n4 7 6 4 5\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n48792 105960835 681218449 90629745 90632170\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n491995 412925347 825318103 59999126 59999339\n\nSample Output 4\n\nYES", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 303, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s462407392", "group_id": "codeNet:p03666", "input_text": "let () = print_endline @@ Scanf.scanf \"%d %d %d %d %d\" (fun n a b c d ->\n  Array.init n (fun i -> (i * c - (n - 1 - i) * d, i * d - (n - 1 - i) * c))\n  |> Array.to_list\n  |> List.exists (fun (min, max) -> min <= abs (a - b) && abs (a - b) <= max)\n  |> function true -> \"YES\" | false -> \"NO\")", "language": "OCaml", "metadata": {"date": 1499659282, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03666.html", "problem_id": "p03666", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03666/input.txt", "sample_output_relpath": "derived/input_output/data/p03666/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03666/OCaml/s462407392.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462407392", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = print_endline @@ Scanf.scanf \"%d %d %d %d %d\" (fun n a b c d ->\n  Array.init n (fun i -> (i * c - (n - 1 - i) * d, i * d - (n - 1 - i) * c))\n  |> Array.to_list\n  |> List.exists (fun (min, max) -> min <= abs (a - b) && abs (a - b) <= max)\n  |> function true -> \"YES\" | false -> \"NO\")", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares in a row.\nThe leftmost square contains the integer A, and the rightmost contains the integer B. The other squares are empty.\n\nAohashi would like to fill the empty squares with integers so that the following condition is satisfied:\n\nFor any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).\n\nAs long as the condition is satisfied, it is allowed to use arbitrarily large or small integers to fill the squares.\nDetermine whether it is possible to fill the squares under the condition.\n\nConstraints\n\n3 \\leq N \\leq 500000\n\n0 \\leq A \\leq 10^9\n\n0 \\leq B \\leq 10^9\n\n0 \\leq C \\leq D \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\n\nOutput\n\nPrint YES if it is possible to fill the squares under the condition; print NO otherwise.\n\nSample Input 1\n\n5 1 5 2 4\n\nSample Output 1\n\nYES\n\nFor example, fill the squares with the following integers: 1, -1, 3, 7, 5, from left to right.\n\nSample Input 2\n\n4 7 6 4 5\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n48792 105960835 681218449 90629745 90632170\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n491995 412925347 825318103 59999126 59999339\n\nSample Output 4\n\nYES", "sample_input": "5 1 5 2 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03666", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares in a row.\nThe leftmost square contains the integer A, and the rightmost contains the integer B. The other squares are empty.\n\nAohashi would like to fill the empty squares with integers so that the following condition is satisfied:\n\nFor any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).\n\nAs long as the condition is satisfied, it is allowed to use arbitrarily large or small integers to fill the squares.\nDetermine whether it is possible to fill the squares under the condition.\n\nConstraints\n\n3 \\leq N \\leq 500000\n\n0 \\leq A \\leq 10^9\n\n0 \\leq B \\leq 10^9\n\n0 \\leq C \\leq D \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\n\nOutput\n\nPrint YES if it is possible to fill the squares under the condition; print NO otherwise.\n\nSample Input 1\n\n5 1 5 2 4\n\nSample Output 1\n\nYES\n\nFor example, fill the squares with the following integers: 1, -1, 3, 7, 5, from left to right.\n\nSample Input 2\n\n4 7 6 4 5\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n48792 105960835 681218449 90629745 90632170\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n491995 412925347 825318103 59999126 59999339\n\nSample Output 4\n\nYES", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 80, "memory_kb": 32640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s661745247", "group_id": "codeNet:p03672", "input_text": "open Batteries\nopen Printf\nlet () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n\n  let is_even str =\n    let len = String.length str in\n    if len mod 2 <> 0 then false else\n      let fst = String.slice ~last:(len/2) str in\n      let lst = String.slice ~first:(len/2) str in\n      fst = lst\n  in\n\n  let rec aux str =\n    let len = String.length str in\n    if is_even str then len else\n      aux (String.slice ~last:(len-1) str)\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux (String.slice ~last:(String.length s - 1) s)\n", "language": "OCaml", "metadata": {"date": 1529326615, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03672.html", "problem_id": "p03672", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03672/input.txt", "sample_output_relpath": "derived/input_output/data/p03672/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03672/OCaml/s661745247.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661745247", "user_id": "u139013163"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n\n  let is_even str =\n    let len = String.length str in\n    if len mod 2 <> 0 then false else\n      let fst = String.slice ~last:(len/2) str in\n      let lst = String.slice ~first:(len/2) str in\n      fst = lst\n  in\n\n  let rec aux str =\n    let len = String.length str in\n    if is_even str then len else\n      aux (String.slice ~last:(len-1) str)\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux (String.slice ~last:(String.length s - 1) s)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will call a string that can be obtained by concatenating two equal strings an even string.\nFor example, xyzxyz and aaaaaa are even, while ababab and xyzxy are not.\n\nYou are given an even string S consisting of lowercase English letters.\nFind the length of the longest even string that can be obtained by deleting one or more characters from the end of S.\nIt is guaranteed that such a non-empty string exists for a given input.\n\nConstraints\n\n2 \\leq |S| \\leq 200\n\nS is an even string consisting of lowercase English letters.\n\nThere exists a non-empty even string that can be obtained by deleting one or more characters from the end of S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest even string that can be obtained.\n\nSample Input 1\n\nabaababaab\n\nSample Output 1\n\n6\n\nabaababaab itself is even, but we need to delete at least one character.\n\nabaababaa is not even.\n\nabaababa is not even.\n\nabaabab is not even.\n\nabaaba is even. Thus, we should print its length, 6.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\n2\n\nxxx is not even.\n\nxx is even.\n\nSample Input 3\n\nabcabcabcabc\n\nSample Output 3\n\n6\n\nThe longest even string that can be obtained is abcabc, whose length is 6.\n\nSample Input 4\n\nakasakaakasakasakaakas\n\nSample Output 4\n\n14\n\nThe longest even string that can be obtained is akasakaakasaka, whose length is 14.", "sample_input": "abaababaab\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03672", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will call a string that can be obtained by concatenating two equal strings an even string.\nFor example, xyzxyz and aaaaaa are even, while ababab and xyzxy are not.\n\nYou are given an even string S consisting of lowercase English letters.\nFind the length of the longest even string that can be obtained by deleting one or more characters from the end of S.\nIt is guaranteed that such a non-empty string exists for a given input.\n\nConstraints\n\n2 \\leq |S| \\leq 200\n\nS is an even string consisting of lowercase English letters.\n\nThere exists a non-empty even string that can be obtained by deleting one or more characters from the end of S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest even string that can be obtained.\n\nSample Input 1\n\nabaababaab\n\nSample Output 1\n\n6\n\nabaababaab itself is even, but we need to delete at least one character.\n\nabaababaa is not even.\n\nabaababa is not even.\n\nabaabab is not even.\n\nabaaba is even. Thus, we should print its length, 6.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\n2\n\nxxx is not even.\n\nxx is even.\n\nSample Input 3\n\nabcabcabcabc\n\nSample Output 3\n\n6\n\nThe longest even string that can be obtained is abcabc, whose length is 6.\n\nSample Input 4\n\nakasakaakasakasakaakas\n\nSample Output 4\n\n14\n\nThe longest even string that can be obtained is akasakaakasaka, whose length is 14.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 2, "memory_kb": 2944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s456001138", "group_id": "codeNet:p03672", "input_text": "open String\n\nlet is s =\n  let len = length s in\n  if len mod 2 = 0 then\n    let half = len / 2 in\n    sub s 0 half = sub s half half\n  else false\n\nlet rec solve s =\n  let len = length s in\n  if is s then len else solve (sub s 0 (pred len))\n\nlet () =\n  let s = read_line () in\n  let len = pred @@ length s in\n  solve (sub s 0 len) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1524733133, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03672.html", "problem_id": "p03672", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03672/input.txt", "sample_output_relpath": "derived/input_output/data/p03672/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03672/OCaml/s456001138.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s456001138", "user_id": "u987869509"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "open String\n\nlet is s =\n  let len = length s in\n  if len mod 2 = 0 then\n    let half = len / 2 in\n    sub s 0 half = sub s half half\n  else false\n\nlet rec solve s =\n  let len = length s in\n  if is s then len else solve (sub s 0 (pred len))\n\nlet () =\n  let s = read_line () in\n  let len = pred @@ length s in\n  solve (sub s 0 len) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will call a string that can be obtained by concatenating two equal strings an even string.\nFor example, xyzxyz and aaaaaa are even, while ababab and xyzxy are not.\n\nYou are given an even string S consisting of lowercase English letters.\nFind the length of the longest even string that can be obtained by deleting one or more characters from the end of S.\nIt is guaranteed that such a non-empty string exists for a given input.\n\nConstraints\n\n2 \\leq |S| \\leq 200\n\nS is an even string consisting of lowercase English letters.\n\nThere exists a non-empty even string that can be obtained by deleting one or more characters from the end of S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest even string that can be obtained.\n\nSample Input 1\n\nabaababaab\n\nSample Output 1\n\n6\n\nabaababaab itself is even, but we need to delete at least one character.\n\nabaababaa is not even.\n\nabaababa is not even.\n\nabaabab is not even.\n\nabaaba is even. Thus, we should print its length, 6.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\n2\n\nxxx is not even.\n\nxx is even.\n\nSample Input 3\n\nabcabcabcabc\n\nSample Output 3\n\n6\n\nThe longest even string that can be obtained is abcabc, whose length is 6.\n\nSample Input 4\n\nakasakaakasakasakaakas\n\nSample Output 4\n\n14\n\nThe longest even string that can be obtained is akasakaakasaka, whose length is 14.", "sample_input": "abaababaab\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03672", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will call a string that can be obtained by concatenating two equal strings an even string.\nFor example, xyzxyz and aaaaaa are even, while ababab and xyzxy are not.\n\nYou are given an even string S consisting of lowercase English letters.\nFind the length of the longest even string that can be obtained by deleting one or more characters from the end of S.\nIt is guaranteed that such a non-empty string exists for a given input.\n\nConstraints\n\n2 \\leq |S| \\leq 200\n\nS is an even string consisting of lowercase English letters.\n\nThere exists a non-empty even string that can be obtained by deleting one or more characters from the end of S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest even string that can be obtained.\n\nSample Input 1\n\nabaababaab\n\nSample Output 1\n\n6\n\nabaababaab itself is even, but we need to delete at least one character.\n\nabaababaa is not even.\n\nabaababa is not even.\n\nabaabab is not even.\n\nabaaba is even. Thus, we should print its length, 6.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\n2\n\nxxx is not even.\n\nxx is even.\n\nSample Input 3\n\nabcabcabcabc\n\nSample Output 3\n\n6\n\nThe longest even string that can be obtained is abcabc, whose length is 6.\n\nSample Input 4\n\nakasakaakasakasakaakas\n\nSample Output 4\n\n14\n\nThe longest even string that can be obtained is akasakaakasaka, whose length is 14.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s181287930", "group_id": "codeNet:p03679", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\" (fun x a b ->\n      if b - a <= 0 then \"delicious\"\n      else if b - a - x <= 0 then \"safe\"\n      else \"dangerous\" )\n  |> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1521770448, "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/s181287930.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s181287930", "user_id": "u987869509"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\" (fun x a b ->\n      if b - a <= 0 then \"delicious\"\n      else if b - a - x <= 0 then \"safe\"\n      else \"dangerous\" )\n  |> Printf.printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "sample_input": "4 3 6\n"}, "reference_outputs": ["safe\n"], "source_document_id": "p03679", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s398158581", "group_id": "codeNet:p03679", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\" (fun x a b ->\n      if b - a < 0 then \"delicious\"\n      else if b - a - x <= 0 then \"safe\"\n      else \"dangerous\" )\n  |> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1521770370, "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/s398158581.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s398158581", "user_id": "u987869509"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\" (fun x a b ->\n      if b - a < 0 then \"delicious\"\n      else if b - a - x <= 0 then \"safe\"\n      else \"dangerous\" )\n  |> Printf.printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "sample_input": "4 3 6\n"}, "reference_outputs": ["safe\n"], "source_document_id": "p03679", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s292636618", "group_id": "codeNet:p03680", "input_text": "(* O(n) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a - 1\nlet rec loop acc i =\n  if acc > n then -1\n  else if i = 1 then acc\n  else loop (acc + 1) a_s.(i)\nlet _ = loop 0 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1559909763, "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/s292636618.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s292636618", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(n) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a - 1\nlet rec loop acc i =\n  if acc > n then -1\n  else if i = 1 then acc\n  else loop (acc + 1) a_s.(i)\nlet _ = loop 0 0 |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s777351844", "group_id": "codeNet:p03680", "input_text": "let n = read_int ()\n\nlet a = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x -> x))\n\nlet () =\n  let rec f count value i =\n    if i = n then -1\n    else\n      let next = a.(value) in\n      if next = 2 then count + 1\n      else f (count + 1) (next - 1) (i + 1)\n  in\n  f 0 0 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1521773232, "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/s777351844.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777351844", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = read_int ()\n\nlet a = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x -> x))\n\nlet () =\n  let rec f count value i =\n    if i = n then -1\n    else\n      let next = a.(value) in\n      if next = 2 then count + 1\n      else f (count + 1) (next - 1) (i + 1)\n  in\n  f 0 0 0 |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s670282433", "group_id": "codeNet:p03684", "input_text": "module WeightedGraph\n  (Vertex : sig\n    type t\n    val compare : t -> t -> int\n  end)\n  (Weight : sig\n    type t\n    val compare : t -> t -> int\n  end) :\nsig\n  val prim :\n    (* 隣接リスト *)\n    (Vertex.t -> (Vertex.t * Weight.t) list) ->\n    (* 始点 *)\n    Vertex.t ->\n    (* 最小全域木に含まれる辺のリスト *)\n    (Vertex.t * Vertex.t * Weight.t) list\nend =\nstruct\n  module VSet = Set.Make (Vertex)\n  module WMap = Map.Make (Weight)\n\n  let prim es =\n    (*\n     * プリム法のメインループ\n     * es : 隣接リスト\n     * vs : 訪れた頂点の集合\n     * q : 訪れた頂点から伸びる辺が重み順に入ったヒープ\n     * acc : 最小全域木に使うのが確定した辺を入れるやつ\n     *)\n    let rec prim acc vs q =\n      match WMap.min_binding q with\n      | exception Not_found -> acc\n      | (w, []) -> prim acc vs (WMap.remove w q)\n      | (w, (u, v) :: rest) ->\n          ( if VSet.mem v vs\n            (* vは既に訪れていた *)\n            then prim acc vs\n            (* vはまだ訪れていなかった *)\n            else prim_aux ((u, v, w) :: acc) vs v ) (WMap.add w rest q)\n    (* vを訪れ，vから伸びる辺をキューに追加してループを続行する *)\n    and prim_aux acc vs v q =\n      prim acc (VSet.add v vs) @@\n      List.fold_left (fun q (u, w) ->\n        WMap.add w ((v, u) :: try WMap.find w q with Not_found -> []) q) q (es v) in\n    fun s -> prim_aux [] VSet.empty s WMap.empty\nend\n\nmodule Int = struct\n  type t = int\n  let compare = compare\nend\n\nmodule G = WeightedGraph (Int) (Int)\n\nlet () = Scanf.scanf \"%d\\n\" (fun n ->\n  let xys = Array.to_list @@ Array.init n (fun i -> Scanf.scanf \"%d %d\\n\" (fun x y -> x, y, i)) in\n  let es = Array.make n [] in\n  begin match List.sort (fun (x, _, _) (x', _, _) -> compare x x') xys with\n  | [] -> ()\n  | (x, y, i) :: rest ->\n      ignore @@ List.fold_left (fun (x, y, i) (x', y', j) ->\n        es.(i) <- (j, min (abs (x - x')) (abs (y - y'))) :: es.(i);\n        es.(j) <- (i, min (abs (x - x')) (abs (y - y'))) :: es.(j);\n        (x', y', j)) (x, y, i) rest\n  end;\n  begin match List.sort (fun (_, y, _) (_, y', _) -> compare y y') xys with\n  | [] -> ()\n  | (x, y, i) :: rest ->\n      ignore @@ List.fold_left (fun (x, y, i) (x', y', j) ->\n        es.(i) <- (j, min (abs (x - x')) (abs (y - y'))) :: es.(i);\n        es.(j) <- (i, min (abs (x - x')) (abs (y - y'))) :: es.(j);\n        (x', y', j)) (x, y, i) rest\n  end;\n  G.prim (Array.get es) 0\n  |> List.map (fun (_, _, w) -> w)\n  |> List.fold_left ( + ) 0\n  |> Printf.printf \"%d\\n\")\n", "language": "OCaml", "metadata": {"date": 1588643022, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03684.html", "problem_id": "p03684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03684/input.txt", "sample_output_relpath": "derived/input_output/data/p03684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03684/OCaml/s670282433.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670282433", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module WeightedGraph\n  (Vertex : sig\n    type t\n    val compare : t -> t -> int\n  end)\n  (Weight : sig\n    type t\n    val compare : t -> t -> int\n  end) :\nsig\n  val prim :\n    (* 隣接リスト *)\n    (Vertex.t -> (Vertex.t * Weight.t) list) ->\n    (* 始点 *)\n    Vertex.t ->\n    (* 最小全域木に含まれる辺のリスト *)\n    (Vertex.t * Vertex.t * Weight.t) list\nend =\nstruct\n  module VSet = Set.Make (Vertex)\n  module WMap = Map.Make (Weight)\n\n  let prim es =\n    (*\n     * プリム法のメインループ\n     * es : 隣接リスト\n     * vs : 訪れた頂点の集合\n     * q : 訪れた頂点から伸びる辺が重み順に入ったヒープ\n     * acc : 最小全域木に使うのが確定した辺を入れるやつ\n     *)\n    let rec prim acc vs q =\n      match WMap.min_binding q with\n      | exception Not_found -> acc\n      | (w, []) -> prim acc vs (WMap.remove w q)\n      | (w, (u, v) :: rest) ->\n          ( if VSet.mem v vs\n            (* vは既に訪れていた *)\n            then prim acc vs\n            (* vはまだ訪れていなかった *)\n            else prim_aux ((u, v, w) :: acc) vs v ) (WMap.add w rest q)\n    (* vを訪れ，vから伸びる辺をキューに追加してループを続行する *)\n    and prim_aux acc vs v q =\n      prim acc (VSet.add v vs) @@\n      List.fold_left (fun q (u, w) ->\n        WMap.add w ((v, u) :: try WMap.find w q with Not_found -> []) q) q (es v) in\n    fun s -> prim_aux [] VSet.empty s WMap.empty\nend\n\nmodule Int = struct\n  type t = int\n  let compare = compare\nend\n\nmodule G = WeightedGraph (Int) (Int)\n\nlet () = Scanf.scanf \"%d\\n\" (fun n ->\n  let xys = Array.to_list @@ Array.init n (fun i -> Scanf.scanf \"%d %d\\n\" (fun x y -> x, y, i)) in\n  let es = Array.make n [] in\n  begin match List.sort (fun (x, _, _) (x', _, _) -> compare x x') xys with\n  | [] -> ()\n  | (x, y, i) :: rest ->\n      ignore @@ List.fold_left (fun (x, y, i) (x', y', j) ->\n        es.(i) <- (j, min (abs (x - x')) (abs (y - y'))) :: es.(i);\n        es.(j) <- (i, min (abs (x - x')) (abs (y - y'))) :: es.(j);\n        (x', y', j)) (x, y, i) rest\n  end;\n  begin match List.sort (fun (_, y, _) (_, y', _) -> compare y y') xys with\n  | [] -> ()\n  | (x, y, i) :: rest ->\n      ignore @@ List.fold_left (fun (x, y, i) (x', y', j) ->\n        es.(i) <- (j, min (abs (x - x')) (abs (y - y'))) :: es.(i);\n        es.(j) <- (i, min (abs (x - x')) (abs (y - y'))) :: es.(j);\n        (x', y', j)) (x, y, i) rest\n  end;\n  G.prim (Array.get es) 0\n  |> List.map (fun (_, _, w) -> w)\n  |> List.fold_left ( + ) 0\n  |> 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": "p03684", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2585, "cpu_time_ms": 1381, "memory_kb": 75264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s909906424", "group_id": "codeNet:p03684", "input_text": "module PArray = struct\n  type 'a t = 'a data ref\n  and 'a data = Arr of 'a array | Diff of int * 'a * 'a t\n\n  let init n f = ref (Arr (Array.init n f))\n  let make n v = ref (Arr (Array.make n v))\n  let of_list l = ref (Arr (Array.of_list l))\n\n  let rec reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (i, v, t') } as t ->\n        reroot (fun a ->\n          t' := Diff (i, a.(i), t);\n          a.(i) <- v;\n          k a) t'\n  let reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (_, _, _) } as t ->\n        reroot (fun a -> t := Arr a; k a) t\n\n  let rec get t i = reroot (fun a -> a.(i)) t\n\n  let set t i v =\n    reroot (fun a ->\n      if v = a.(i) then t\n      else begin\n        let result = ref (Arr a) in\n        t := Diff (i, a.(i), result);\n        a.(i) <- v;\n        result\n      end) t\n\n  let length t = reroot Array.length t\n  let to_list t = reroot Array.to_list t\n  let iter f = reroot (Array.iter f)\n  let iteri f = reroot (Array.iteri f)\n  let fold_left f x = reroot (Array.fold_left f x)\n  let fold_right f t x = reroot (fun a -> Array.fold_right f a x) t\nend\n\nmodule PUnionFind = struct\n  type t = { rank : int PArray.t; mutable parent : int PArray.t }\n\n  type class_ = int\n\n  let make n = { rank = PArray.make n 0; parent = PArray.init n (fun i -> i) }\n\n  let rec find parent i k =\n    let j = PArray.get parent i in\n    if i = j then k parent i\n    else find parent j (fun parent r -> k (PArray.set parent i r) r)\n  let find ({ parent } as h) i = find parent i (fun parent r ->\n    h.parent <- parent;\n    r)\n\n  let union uf x y =\n    let cx = find uf x in\n    let cy = find uf y in\n    if cx = cy then uf\n    else begin\n      let rx = PArray.get uf.rank x in\n      let ry = PArray.get uf.rank y in\n      match compare rx ry with\n      | -1 -> { uf with parent = PArray.set uf.parent cx cy }\n      | 1 -> { uf with parent = PArray.set uf.parent cy cx }\n      | 0 -> { rank = PArray.set uf.rank cx (cx + 1); parent = PArray.set uf.parent cy cx }\n    end\nend\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" @@ fun n -> n in\n  let xys = Array.to_list @@ Array.init n @@ fun i ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y, i in\n  let xedges =\n    List.sort (fun (x, _, _) (x', _, _) -> compare x x') xys\n    |> (fun ((x, y, i) :: xys) ->\n        List.fold_left (fun (acc, x, y, i) (x', y', j) ->\n          ((x' - x, i, j) :: acc, x', y', j)) ([], x, y, i) xys)\n    |> (fun (acc, _, _, _) -> acc) in\n  let yedges =\n    List.sort (fun (_, y, _) (_, y', _) -> compare y y') xys\n    |> (fun ((x, y, i) :: xys) ->\n        List.fold_left (fun (acc, x, y, i) (x', y', j) ->\n          ((y' - y, i, j) :: acc, x', y', j)) ([], x, y, i) xys)\n    |> (fun (acc, _, _, _) -> acc) in\n  List.rev_append xedges yedges\n    |> List.sort (fun (d, _, _) (d', _, _) -> compare d d')\n    |> List.fold_left (fun (cost, connection) (d, i, j) ->\n        if PUnionFind.find connection i = PUnionFind.find connection j then (cost, connection)\n        else (d + cost, PUnionFind.union connection i j)) (0, PUnionFind.make n)\n    |> fst\n    |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1498357812, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03684.html", "problem_id": "p03684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03684/input.txt", "sample_output_relpath": "derived/input_output/data/p03684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03684/OCaml/s909906424.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909906424", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module PArray = struct\n  type 'a t = 'a data ref\n  and 'a data = Arr of 'a array | Diff of int * 'a * 'a t\n\n  let init n f = ref (Arr (Array.init n f))\n  let make n v = ref (Arr (Array.make n v))\n  let of_list l = ref (Arr (Array.of_list l))\n\n  let rec reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (i, v, t') } as t ->\n        reroot (fun a ->\n          t' := Diff (i, a.(i), t);\n          a.(i) <- v;\n          k a) t'\n  let reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (_, _, _) } as t ->\n        reroot (fun a -> t := Arr a; k a) t\n\n  let rec get t i = reroot (fun a -> a.(i)) t\n\n  let set t i v =\n    reroot (fun a ->\n      if v = a.(i) then t\n      else begin\n        let result = ref (Arr a) in\n        t := Diff (i, a.(i), result);\n        a.(i) <- v;\n        result\n      end) t\n\n  let length t = reroot Array.length t\n  let to_list t = reroot Array.to_list t\n  let iter f = reroot (Array.iter f)\n  let iteri f = reroot (Array.iteri f)\n  let fold_left f x = reroot (Array.fold_left f x)\n  let fold_right f t x = reroot (fun a -> Array.fold_right f a x) t\nend\n\nmodule PUnionFind = struct\n  type t = { rank : int PArray.t; mutable parent : int PArray.t }\n\n  type class_ = int\n\n  let make n = { rank = PArray.make n 0; parent = PArray.init n (fun i -> i) }\n\n  let rec find parent i k =\n    let j = PArray.get parent i in\n    if i = j then k parent i\n    else find parent j (fun parent r -> k (PArray.set parent i r) r)\n  let find ({ parent } as h) i = find parent i (fun parent r ->\n    h.parent <- parent;\n    r)\n\n  let union uf x y =\n    let cx = find uf x in\n    let cy = find uf y in\n    if cx = cy then uf\n    else begin\n      let rx = PArray.get uf.rank x in\n      let ry = PArray.get uf.rank y in\n      match compare rx ry with\n      | -1 -> { uf with parent = PArray.set uf.parent cx cy }\n      | 1 -> { uf with parent = PArray.set uf.parent cy cx }\n      | 0 -> { rank = PArray.set uf.rank cx (cx + 1); parent = PArray.set uf.parent cy cx }\n    end\nend\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" @@ fun n -> n in\n  let xys = Array.to_list @@ Array.init n @@ fun i ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y, i in\n  let xedges =\n    List.sort (fun (x, _, _) (x', _, _) -> compare x x') xys\n    |> (fun ((x, y, i) :: xys) ->\n        List.fold_left (fun (acc, x, y, i) (x', y', j) ->\n          ((x' - x, i, j) :: acc, x', y', j)) ([], x, y, i) xys)\n    |> (fun (acc, _, _, _) -> acc) in\n  let yedges =\n    List.sort (fun (_, y, _) (_, y', _) -> compare y y') xys\n    |> (fun ((x, y, i) :: xys) ->\n        List.fold_left (fun (acc, x, y, i) (x', y', j) ->\n          ((y' - y, i, j) :: acc, x', y', j)) ([], x, y, i) xys)\n    |> (fun (acc, _, _, _) -> acc) in\n  List.rev_append xedges yedges\n    |> List.sort (fun (d, _, _) (d', _, _) -> compare d d')\n    |> List.fold_left (fun (cost, connection) (d, i, j) ->\n        if PUnionFind.find connection i = PUnionFind.find connection j then (cost, connection)\n        else (d + cost, PUnionFind.union connection i j)) (0, PUnionFind.make n)\n    |> fst\n    |> Printf.printf \"%d\\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": "p03684", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3101, "cpu_time_ms": 534, "memory_kb": 34700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s924682868", "group_id": "codeNet:p03684", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n             \nlet rec read f n =\n  if n <= 0 then []\n  else\n    let x = f () in\n    x :: read f (n - 1)\n\nlet rec remove x = function\n    [] -> []\n  | h :: t when h = x -> t\n  | h :: t -> h :: remove x t\n\nlet cost p1 p2 =\n  let d1 = abs (fst p1 - fst p2) and\n      d2 = abs (snd p1 - snd p2) in\n  min d1 d2\n                     \nlet () =\n  let n = scanf \"%d\\n\" id in\n  let ps =\n    let f () = scanf \"%d %d\\n\" (fun x y -> (x, y)) in\n    read f n in\n  let rec iter xs ys c =\n    match ys with\n      [] -> c\n    | _ -> let (mp, mc) = List.fold_left (\n                              fun (tp, tc) x -> let (up, uc) = \n                                                  List.fold_left (fun (sp, sc) y ->\n                                                                  let vc = cost x y in\n                                                                  if vc < sc then (y, vc) else (sp, sc)\n                                                                 ) ((-1, -1), 1000000000) ys in\n                                                if uc < tc then (up, uc) else (tp, tc)\n                            ) ((-1, -1), 1000000000) xs in\n           iter (mp :: xs) (remove mp ys) (c+mc)\n  in\n  iter [(List.hd ps)] (List.tl ps) 0 |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1498356824, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03684.html", "problem_id": "p03684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03684/input.txt", "sample_output_relpath": "derived/input_output/data/p03684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03684/OCaml/s924682868.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s924682868", "user_id": "u388783188"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n             \nlet rec read f n =\n  if n <= 0 then []\n  else\n    let x = f () in\n    x :: read f (n - 1)\n\nlet rec remove x = function\n    [] -> []\n  | h :: t when h = x -> t\n  | h :: t -> h :: remove x t\n\nlet cost p1 p2 =\n  let d1 = abs (fst p1 - fst p2) and\n      d2 = abs (snd p1 - snd p2) in\n  min d1 d2\n                     \nlet () =\n  let n = scanf \"%d\\n\" id in\n  let ps =\n    let f () = scanf \"%d %d\\n\" (fun x y -> (x, y)) in\n    read f n in\n  let rec iter xs ys c =\n    match ys with\n      [] -> c\n    | _ -> let (mp, mc) = List.fold_left (\n                              fun (tp, tc) x -> let (up, uc) = \n                                                  List.fold_left (fun (sp, sc) y ->\n                                                                  let vc = cost x y in\n                                                                  if vc < sc then (y, vc) else (sp, sc)\n                                                                 ) ((-1, -1), 1000000000) ys in\n                                                if uc < tc then (up, uc) else (tp, tc)\n                            ) ((-1, -1), 1000000000) xs in\n           iter (mp :: xs) (remove mp ys) (c+mc)\n  in\n  iter [(List.hd ps)] (List.tl ps) 0 |> 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": "p03684", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1273, "cpu_time_ms": 2105, "memory_kb": 22448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s913934376", "group_id": "codeNet:p03693", "input_text": "Scanf.scanf \"%d %d %d\" (fun r g b ->\n    print_endline @@ if (r * 100 + g * 10 + b) mod 4 = 0 then \"YES\" else \"NO\" \n)", "language": "OCaml", "metadata": {"date": 1593141798, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s913934376.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s913934376", "user_id": "u342443598"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun r g b ->\n    print_endline @@ if (r * 100 + g * 10 + 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s424511436", "group_id": "codeNet:p03694", "input_text": "let () =\n  let a = Scanf.scanf \"%d\" (fun n -> Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))) in\n  let x, y = Array.fold_left min 1001 a, Array.fold_left max 0 a in\n  Printf.printf \"%d\\n\" (y-x)\n", "language": "OCaml", "metadata": {"date": 1519790754, "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/s424511436.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424511436", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\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 x, y = Array.fold_left min 1001 a, Array.fold_left max 0 a in\n  Printf.printf \"%d\\n\" (y-x)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s801087926", "group_id": "codeNet:p03695", "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 arr g =\n        if i = n then (\n            let s = Array.fold_left (fun acc v -> if v > 0 then acc + 1 else acc) 0 arr in\n            let mi = if s = 0 then 1 else s in\n            let mx = min (s + g) 8 in\n            Printf.printf \"%d %d\\n\" mi mx\n        ) else (\n            if a.(i) < 3200 then (\n                let () = arr.(a.(i) / 400) <- arr.(a.(i) / 400) + 1 in\n                loop (i + 1) arr g \n            ) else loop (i + 1) arr (g + 1)\n        )\n    in\n    loop 0 (Array.make 8 0) 0\n)", "language": "OCaml", "metadata": {"date": 1593142585, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s801087926.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s801087926", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2 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 arr g =\n        if i = n then (\n            let s = Array.fold_left (fun acc v -> if v > 0 then acc + 1 else acc) 0 arr in\n            let mi = if s = 0 then 1 else s in\n            let mx = min (s + g) 8 in\n            Printf.printf \"%d %d\\n\" mi mx\n        ) else (\n            if a.(i) < 3200 then (\n                let () = arr.(a.(i) / 400) <- arr.(a.(i) / 400) + 1 in\n                loop (i + 1) arr g \n            ) else loop (i + 1) arr (g + 1)\n        )\n    in\n    loop 0 (Array.make 8 0) 0\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 618, "cpu_time_ms": 9, "memory_kb": 3716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s446129069", "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\tprintf \"%Ld %Ld\\n\" (max p 1L) (min 8L (p+q))", "language": "OCaml", "metadata": {"date": 1536506012, "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/s446129069.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s446129069", "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\tprintf \"%Ld %Ld\\n\" (max p 1L) (min 8L (p+q))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3130, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s171679095", "group_id": "codeNet:p03695", "input_text": "open Str\n\nopen List\n\nlet get_int () = int_of_string (read_line ());;\n\nlet rec to_int sep =\n    match sep with \n    | [] -> []\n    | a :: b -> \n            (int_of_string a) :: (to_int b);;\n\nlet rec to_color rates =\n    match rates with\n    | [] -> []\n    | fst :: rst -> (fst / 400) :: (to_color rst)\n\nlet rec print_int_arr arr =\n    match arr with\n    | [] -> ()\n    | fst :: rst -> Printf.printf \"%d\\n\" fst; print_int_arr rst;;\n\nlet get_int_arr () = \n    to_int (Str.split (Str.regexp \" \") (read_line ()));;\n\nlet main =\n    let _ = read_line () in\n    let a = to_color (get_int_arr ()) in\n    let const = List.length (List.sort_uniq (fun x y -> x - y) (List.filter (fun b -> b < 8) a)) in\n    let change = List.length (List.filter (fun b -> b >= 8) a) in\n    \n    Printf.printf \"%d \" const;\n    Printf.printf \"%d\\n\" (const + change);\n", "language": "OCaml", "metadata": {"date": 1531325513, "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/s171679095.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s171679095", "user_id": "u605917063"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "open Str\n\nopen List\n\nlet get_int () = int_of_string (read_line ());;\n\nlet rec to_int sep =\n    match sep with \n    | [] -> []\n    | a :: b -> \n            (int_of_string a) :: (to_int b);;\n\nlet rec to_color rates =\n    match rates with\n    | [] -> []\n    | fst :: rst -> (fst / 400) :: (to_color rst)\n\nlet rec print_int_arr arr =\n    match arr with\n    | [] -> ()\n    | fst :: rst -> Printf.printf \"%d\\n\" fst; print_int_arr rst;;\n\nlet get_int_arr () = \n    to_int (Str.split (Str.regexp \" \") (read_line ()));;\n\nlet main =\n    let _ = read_line () in\n    let a = to_color (get_int_arr ()) in\n    let const = List.length (List.sort_uniq (fun x y -> x - y) (List.filter (fun b -> b < 8) a)) in\n    let change = List.length (List.filter (fun b -> b >= 8) a) in\n    \n    Printf.printf \"%d \" const;\n    Printf.printf \"%d\\n\" (const + change);\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 836, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s233206244", "group_id": "codeNet:p03695", "input_text": "open Str\nopen List\n\nlet get_int () = int_of_string (read_line ());;\n\nlet rec to_int sep =\n    match sep with \n    | [] -> []\n    | a :: b -> \n            (int_of_string a) :: (to_int b);;\n\nlet rec to_color rates =\n    match rates with\n    | [] -> []\n    | fst :: rst -> (fst / 400) :: (to_color rst)\n\nlet rec print_int_arr arr =\n    match arr with\n    | [] -> ()\n    | fst :: rst -> Printf.printf \"%d\\n\" fst; print_int_arr rst;;\n\nlet get_int_arr () = \n    to_int (Str.split (Str.regexp \" \") (read_line ()));;\n\nlet main =\n    let _ = read_line () in\n    let a = to_color (get_int_arr ()) in\n    let const = List.length (List.sort_uniq (fun x y -> x - y) (List.filter (fun b -> b < 8) a)) in\n    let change = List.length (List.filter (fun b -> b > 7) a) in\n    \n    Printf.printf \"%d \" const;\n    Printf.printf \"%d\\n\" (const + change);\n", "language": "OCaml", "metadata": {"date": 1531321265, "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/s233206244.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s233206244", "user_id": "u605917063"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "open Str\nopen List\n\nlet get_int () = int_of_string (read_line ());;\n\nlet rec to_int sep =\n    match sep with \n    | [] -> []\n    | a :: b -> \n            (int_of_string a) :: (to_int b);;\n\nlet rec to_color rates =\n    match rates with\n    | [] -> []\n    | fst :: rst -> (fst / 400) :: (to_color rst)\n\nlet rec print_int_arr arr =\n    match arr with\n    | [] -> ()\n    | fst :: rst -> Printf.printf \"%d\\n\" fst; print_int_arr rst;;\n\nlet get_int_arr () = \n    to_int (Str.split (Str.regexp \" \") (read_line ()));;\n\nlet main =\n    let _ = read_line () in\n    let a = to_color (get_int_arr ()) in\n    let const = List.length (List.sort_uniq (fun x y -> x - y) (List.filter (fun b -> b < 8) a)) in\n    let change = List.length (List.filter (fun b -> b > 7) a) in\n    \n    Printf.printf \"%d \" const;\n    Printf.printf \"%d\\n\" (const + change);\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 834, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s369264497", "group_id": "codeNet:p03695", "input_text": "module IntSet = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  Array.fold_left (fun (s, n) a ->\n    if a < 3200 then (IntSet.add (a / 400) s, n)\n    else (s, n + 1)) (IntSet.empty, 0) as_\n  |> (fun (s, n) -> (max 1 (IntSet.cardinal s), min 8 (IntSet.cardinal s + n)))\n  |> (fun (max, min) -> Printf.printf \"%d %d\\n\" max min)", "language": "OCaml", "metadata": {"date": 1497146472, "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/s369264497.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369264497", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "module IntSet = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  Array.fold_left (fun (s, n) a ->\n    if a < 3200 then (IntSet.add (a / 400) s, n)\n    else (s, n + 1)) (IntSet.empty, 0) as_\n  |> (fun (s, n) -> (max 1 (IntSet.cardinal s), min 8 (IntSet.cardinal s + n)))\n  |> (fun (max, min) -> Printf.printf \"%d %d\\n\" max min)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 461, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s006401631", "group_id": "codeNet:p03696", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet l, r = ref 0, ref 0\nlet _ = String.(iter (function '(' -> incr r | _ -> if !r = 0 then incr l else decr r) s; Printf.printf \"%s%s%s\\n\" (make !l '(') s (make !r ')'))", "language": "OCaml", "metadata": {"date": 1570557379, "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/s006401631.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006401631", "user_id": "u732304692"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet l, r = ref 0, ref 0\nlet _ = String.(iter (function '(' -> incr r | _ -> if !r = 0 then incr l else decr r) s; Printf.printf \"%s%s%s\\n\" (make !l '(') s (make !r ')'))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s094709943", "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 =\nif n = String.length str - 1 then str 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": 1497149092, "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/s094709943.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s094709943", "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 =\nif n = String.length str - 1 then str 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 644, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s329694921", "group_id": "codeNet:p03697", "input_text": "Scanf.scanf \"%d %d\" (fun a b ->\n    if a + b >= 10 then print_endline \"error\"\n                   else Printf.printf \"%d\\n\" (a + b)\n)", "language": "OCaml", "metadata": {"date": 1589338690, "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/s329694921.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s329694921", "user_id": "u342443598"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun a b ->\n    if a + b >= 10 then print_endline \"error\"\n                   else 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s742433684", "group_id": "codeNet:p03697", "input_text": "let () =\n  Scanf.scanf \"%d %d\" (fun a b ->\n      if a + b >= 10 then \"error\" else (string_of_int (a + b)))\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1521863035, "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/s742433684.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742433684", "user_id": "u987869509"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" (fun a b ->\n      if a + b >= 10 then \"error\" else (string_of_int (a + b)))\n  |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "sample_input": "6 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03697", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s043968981", "group_id": "codeNet:p03698", "input_text": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n    let rec loop i acc =\n        if i = n then \"yes\" else\n            let c = int_of_char s.[i] - 97 in\n            let m = 1 lsl c in\n            if m land acc = 0 then loop (i + 1) (acc lor c)\n            else \"no\"\n    in\n    loop 0 0 |> print_endline\n)", "language": "OCaml", "metadata": {"date": 1589338894, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/OCaml/s043968981.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s043968981", "user_id": "u342443598"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n    let rec loop i acc =\n        if i = n then \"yes\" else\n            let c = int_of_char s.[i] - 97 in\n            let m = 1 lsl c in\n            if m land acc = 0 then loop (i + 1) (acc lor c)\n            else \"no\"\n    in\n    loop 0 0 |> print_endline\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s604169617", "group_id": "codeNet:p03698", "input_text": "let s = read_line ()\nlet _ = String.(iteri (fun i c -> iteri (fun j d -> if i <> j && c = d then (print_endline \"no\"; exit 0)) s) s); print_endline \"yes\"", "language": "OCaml", "metadata": {"date": 1576691668, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/OCaml/s604169617.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s604169617", "user_id": "u732304692"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "let s = read_line ()\nlet _ = String.(iteri (fun i c -> iteri (fun j d -> if i <> j && c = d then (print_endline \"no\"; exit 0)) s) s); print_endline \"yes\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s855582755", "group_id": "codeNet:p03698", "input_text": "open Batteries\nopen Printf\nlet () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let l = String.to_list s in\n  let sl = List.sort_uniq compare l in\n\n  Printf.printf \"%s\\n\" @@\n  if List.length l = (List.length sl) then \"yes\" else \"no\"\n", "language": "OCaml", "metadata": {"date": 1529335688, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/OCaml/s855582755.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855582755", "user_id": "u139013163"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let l = String.to_list s in\n  let sl = List.sort_uniq compare l in\n\n  Printf.printf \"%s\\n\" @@\n  if List.length l = (List.length sl) then \"yes\" else \"no\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s894862378", "group_id": "codeNet:p03700", "input_text": "Scanf.scanf \"%d %d %d\" (fun n a b ->\n    let h = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun h -> h)) in\n    Array.sort compare h;\n\n    let check m =\n        let c = a - b in\n        let s = Array.fold_left (fun acc v ->\n            acc + (max 0 (v - m * b) + c - 1) / c) 0 h\n        in\n        s <= m\n    in\n\n    let rec bin left right =\n        if left = right then left else\n            let m = (left + right) / 2 in\n            if check m then bin left m\n                       else bin (m + 1) right\n    in\n    bin 0 ((h.(n - 1) + b - 1) / b + 1) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1589422725, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03700.html", "problem_id": "p03700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03700/input.txt", "sample_output_relpath": "derived/input_output/data/p03700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03700/OCaml/s894862378.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s894862378", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n a b ->\n    let h = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun h -> h)) in\n    Array.sort compare h;\n\n    let check m =\n        let c = a - b in\n        let s = Array.fold_left (fun acc v ->\n            acc + (max 0 (v - m * b) + c - 1) / c) 0 h\n        in\n        s <= m\n    in\n\n    let rec bin left right =\n        if left = right then left else\n            let m = (left + right) / 2 in\n            if check m then bin left m\n                       else bin (m + 1) right\n    in\n    bin 0 ((h.(n - 1) + b - 1) / b + 1) |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "sample_input": "4 5 3\n8\n7\n4\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03700", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 579, "cpu_time_ms": 111, "memory_kb": 6692}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s577473333", "group_id": "codeNet:p03700", "input_text": "let id x = x\nlet (n,a,b) = Scanf.scanf \"%d %d %d\\n\" (fun n a b -> (n,a,b))\n \nlet array = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" id)\nlet () = Array.sort compare array\nlet l = Array.length array\n\nlet max = array.(l-1) / b\n\nlet rec func1 tmid i m =\n  if i = l then m else\n    let x = array.(i) - b*tmid in\n    if x < 0 then func1 tmid (i+1) m\n    else if x mod (a-b) = 0 then func1 tmid (i+1) (m + x/(a-b))\n    else func1 tmid (i+1) (m + 1+x/(a-b))\n\nlet rec func tmin tmax =\n  let tmid = tmin + (tmax - tmin) / 2 in\n  let tsuika = func1 tmid 0 0 in\n  if tsuika <= tmid then (if tmax - tmin = 1 then tmin else func tmin tmid)\n  else (if tmax - tmin = 1 then tmax else func tmid tmax)\n\nlet ans = func 1 max\n\nlet () =\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1496628895, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03700.html", "problem_id": "p03700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03700/input.txt", "sample_output_relpath": "derived/input_output/data/p03700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03700/OCaml/s577473333.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s577473333", "user_id": "u735499035"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let id x = x\nlet (n,a,b) = Scanf.scanf \"%d %d %d\\n\" (fun n a b -> (n,a,b))\n \nlet array = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" id)\nlet () = Array.sort compare array\nlet l = Array.length array\n\nlet max = array.(l-1) / b\n\nlet rec func1 tmid i m =\n  if i = l then m else\n    let x = array.(i) - b*tmid in\n    if x < 0 then func1 tmid (i+1) m\n    else if x mod (a-b) = 0 then func1 tmid (i+1) (m + x/(a-b))\n    else func1 tmid (i+1) (m + 1+x/(a-b))\n\nlet rec func tmin tmax =\n  let tmid = tmin + (tmax - tmin) / 2 in\n  let tsuika = func1 tmid 0 0 in\n  if tsuika <= tmid then (if tmax - tmin = 1 then tmin else func tmin tmid)\n  else (if tmax - tmin = 1 then tmax else func tmid tmax)\n\nlet ans = func 1 max\n\nlet () =\n  Printf.printf \"%d\\n\" ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "sample_input": "4 5 3\n8\n7\n4\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03700", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 741, "cpu_time_ms": 2103, "memory_kb": 7424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s106080105", "group_id": "codeNet:p03702", "input_text": "(** val add : int -> int -> int **)\n\nlet rec add = ( + )\n\n(** val sub : int -> int -> int **)\n\nlet rec sub = ( - )\n\nmodule Nat =\n struct\n  (** val div2 : int -> int **)\n\n  let rec div2 = (fun x -> x / 2)\n end\n\n(** val lower_bound_aux : (int -> bool) -> int -> int -> int **)\n\nlet rec lower_bound_aux p_dec x x0 =\n  (fun fO fS n -> if n = 0 then fO () else fS (n-1))\n    (fun _ ->\n    x)\n    (fun n0 ->\n    if p_dec (add x (Nat.div2 (succ n0)))\n    then lower_bound_aux p_dec x (Nat.div2 (succ n0))\n    else lower_bound_aux p_dec (add (succ (Nat.div2 (succ n0))) x)\n           (sub (succ n0) (succ (Nat.div2 (succ n0)))))\n    x0\n\n(** val lower_bound : (int -> bool) -> int -> int -> int **)\n\nlet lower_bound p_dec alpha beta =\n  lower_bound_aux p_dec alpha (sub beta alpha)\n\nlet () =\n  let n, a, b = Scanf.scanf \"%d %d %d\\n\" (fun n a b -> n, a, b) in\n  let hs = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun h -> h)) in\n  lower_bound\n    (fun x -> Array.fold_left ( + ) 0 (Array.map (fun h -> max 0 ((h - b * x + a - b - 1) / (a - b))) hs) <= x)\n    (Array.fold_left max 0 hs / a)\n    ((Array.fold_left max 0 hs + b - 1) / b)\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1496540417, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03702.html", "problem_id": "p03702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03702/input.txt", "sample_output_relpath": "derived/input_output/data/p03702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03702/OCaml/s106080105.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s106080105", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(** val add : int -> int -> int **)\n\nlet rec add = ( + )\n\n(** val sub : int -> int -> int **)\n\nlet rec sub = ( - )\n\nmodule Nat =\n struct\n  (** val div2 : int -> int **)\n\n  let rec div2 = (fun x -> x / 2)\n end\n\n(** val lower_bound_aux : (int -> bool) -> int -> int -> int **)\n\nlet rec lower_bound_aux p_dec x x0 =\n  (fun fO fS n -> if n = 0 then fO () else fS (n-1))\n    (fun _ ->\n    x)\n    (fun n0 ->\n    if p_dec (add x (Nat.div2 (succ n0)))\n    then lower_bound_aux p_dec x (Nat.div2 (succ n0))\n    else lower_bound_aux p_dec (add (succ (Nat.div2 (succ n0))) x)\n           (sub (succ n0) (succ (Nat.div2 (succ n0)))))\n    x0\n\n(** val lower_bound : (int -> bool) -> int -> int -> int **)\n\nlet lower_bound p_dec alpha beta =\n  lower_bound_aux p_dec alpha (sub beta alpha)\n\nlet () =\n  let n, a, b = Scanf.scanf \"%d %d %d\\n\" (fun n a b -> n, a, b) in\n  let hs = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun h -> h)) in\n  lower_bound\n    (fun x -> Array.fold_left ( + ) 0 (Array.map (fun h -> max 0 ((h - b * x + a - b - 1) / (a - b))) hs) <= x)\n    (Array.fold_left max 0 hs / a)\n    ((Array.fold_left max 0 hs + b - 1) / b)\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "sample_input": "4 5 3\n8\n7\n4\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03702", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1152, "cpu_time_ms": 155, "memory_kb": 11648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s352096921", "group_id": "codeNet:p03711", "input_text": "let a = [1;3;5;7;8;10;12];;\nlet b = [4;6;9;11];;\nlet c = [2];;\n\nlet (x, y) = Scanf.scanf \"%d %d\" (fun x y -> (x, y));;\nlet ans =\n  if List.mem x a && List.mem y a then\n    \"Yes\"\n  else if List.mem x b && List.mem y b then\n    \"Yes\"\n  else if List.mem x c && List.mem y c then\n    \"Yes\"\n  else\n    \"No\";;\nlet () = print_endline ans;;\n", "language": "OCaml", "metadata": {"date": 1571857494, "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/s352096921.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s352096921", "user_id": "u614063956"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let a = [1;3;5;7;8;10;12];;\nlet b = [4;6;9;11];;\nlet c = [2];;\n\nlet (x, y) = Scanf.scanf \"%d %d\" (fun x y -> (x, y));;\nlet ans =\n  if List.mem x a && List.mem y a then\n    \"Yes\"\n  else if List.mem x b && List.mem y b then\n    \"Yes\"\n  else if List.mem x c && List.mem y c then\n    \"Yes\"\n  else\n    \"No\";;\nlet () = print_endline ans;;\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "sample_input": "1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03711", "source_text": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s029330659", "group_id": "codeNet:p03711", "input_text": "open List;;\nScanf.scanf \"%d %d\" @@ fun x y -> print_endline @@\n  if x = 2 || y = 2 then \"No\"\n  else if exists (fun g -> mem x g && mem y g) [[1; 3; 5; 7; 8; 10; 12]; [4; 6; 9; 11]] then \"Yes\"\n  else \"No\"", "language": "OCaml", "metadata": {"date": 1562151055, "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/s029330659.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029330659", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open List;;\nScanf.scanf \"%d %d\" @@ fun x y -> print_endline @@\n  if x = 2 || y = 2 then \"No\"\n  else if exists (fun g -> mem x g && mem y g) [[1; 3; 5; 7; 8; 10; 12]; [4; 6; 9; 11]] then \"Yes\"\n  else \"No\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s208777660", "group_id": "codeNet:p03711", "input_text": "open Batteries\nopen Printf\nlet () =\n  let x,y = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  let a = [1;3;5;7;8;10;12] in\n  let b = [4;6;9;11] in\n  let c = [2] in\n\n  Printf.printf \"%s\\n\" @@\n  if List.mem x a && List.mem y a || List.mem x b && List.mem y b || List.mem x c && List.mem y c then\n    \"Yes\" else \"No\"\n", "language": "OCaml", "metadata": {"date": 1529389768, "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/s208777660.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s208777660", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let x,y = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  let a = [1;3;5;7;8;10;12] in\n  let b = [4;6;9;11] in\n  let c = [2] in\n\n  Printf.printf \"%s\\n\" @@\n  if List.mem x a && List.mem y a || List.mem x b && List.mem y b || List.mem x c && List.mem y c then\n    \"Yes\" else \"No\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "sample_input": "1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03711", "source_text": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s740796793", "group_id": "codeNet:p03711", "input_text": "let ar = [|1;3;1;2;1;2;1;1;2;1;2;1|]\nlet f x y = if ar.(x-1) = ar.(y-1) then \"Yes\" else \"No\"\nlet () = Scanf.scanf \"%d %d\" f |> print_endline", "language": "OCaml", "metadata": {"date": 1524992925, "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/s740796793.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740796793", "user_id": "u987869509"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let ar = [|1;3;1;2;1;2;1;1;2;1;2;1|]\nlet f x y = if ar.(x-1) = ar.(y-1) then \"Yes\" else \"No\"\nlet () = Scanf.scanf \"%d %d\" f |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s955323706", "group_id": "codeNet:p03711", "input_text": "let g = [| 0; 1; 3; 1; 2; 1; 2; 1; 1; 2; 1; 2; 1 |]\n\nlet solve a b = if g.(a) == g.(b) then \"Yes\" else \"No\"\n\nlet () = Printf.printf \"%s\\n\" (Scanf.scanf \"%d %d\" solve)", "language": "OCaml", "metadata": {"date": 1496638190, "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/s955323706.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s955323706", "user_id": "u877969392"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let g = [| 0; 1; 3; 1; 2; 1; 2; 1; 1; 2; 1; 2; 1 |]\n\nlet solve a b = if g.(a) == g.(b) then \"Yes\" else \"No\"\n\nlet () = Printf.printf \"%s\\n\" (Scanf.scanf \"%d %d\" solve)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s637360799", "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  Array.iter (Printf.printf \"#%s#\\n\") a_ss;\n  print_endline s", "language": "OCaml", "metadata": {"date": 1562153724, "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/s637360799.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s637360799", "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  Array.iter (Printf.printf \"#%s#\\n\") a_ss;\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s338176160", "group_id": "codeNet:p03720", "input_text": "open Batteries\n\nlet () =\n  let n, m = Scanf.scanf \" %d %d\\n\" (fun n m -> (n, m)) in\n  let arr = Array.make n 0 in\n  let () =\n    1 -- m\n    |> Enum.iter (fun _ ->\n           Scanf.scanf \" %d %d\" (fun n m ->\n               arr.(n - 1) <- arr.(n - 1) + 1 ;\n               arr.(m - 1) <- arr.(m - 1) + 1 ) )\n  in\n  let () = Array.iter (fun x -> Printf.printf \"%d\\n\" x) arr in\n  ()\n", "language": "OCaml", "metadata": {"date": 1551108306, "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/s338176160.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s338176160", "user_id": "u406828576"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "open Batteries\n\nlet () =\n  let n, m = Scanf.scanf \" %d %d\\n\" (fun n m -> (n, m)) in\n  let arr = Array.make n 0 in\n  let () =\n    1 -- m\n    |> Enum.iter (fun _ ->\n           Scanf.scanf \" %d %d\" (fun n m ->\n               arr.(n - 1) <- arr.(n - 1) + 1 ;\n               arr.(m - 1) <- arr.(m - 1) + 1 ) )\n  in\n  let () = Array.iter (fun x -> Printf.printf \"%d\\n\" x) arr in\n  ()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s187543071", "group_id": "codeNet:p03720", "input_text": "module Im = Map.Make(struct type t = int let compare = compare end)\n\nlet f n m =\n  let rec aux m' map =\n    if m' <= 0 then map\n    else\n      let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b) in\n      let va = try Im.find a map with _ -> 0 in\n      let vb = try Im.find b map with _ -> 0 in\n      aux (pred m') (Im.add a (succ va) map |> Im.add b (succ vb))\n  in\n  let rec pr n' map =\n    if n' > n then ()\n    else\n      (Printf.printf \"%d\\n\" (try Im.find n' map with _ -> 0) ;\n       pr (succ n') map)\n  in\n  aux m Im.empty |> pr 1\n\nlet () = Scanf.scanf \"%d %d\\n\" f", "language": "OCaml", "metadata": {"date": 1525053658, "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/s187543071.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s187543071", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "module Im = Map.Make(struct type t = int let compare = compare end)\n\nlet f n m =\n  let rec aux m' map =\n    if m' <= 0 then map\n    else\n      let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b) in\n      let va = try Im.find a map with _ -> 0 in\n      let vb = try Im.find b map with _ -> 0 in\n      aux (pred m') (Im.add a (succ va) map |> Im.add b (succ vb))\n  in\n  let rec pr n' map =\n    if n' > n then ()\n    else\n      (Printf.printf \"%d\\n\" (try Im.find n' map with _ -> 0) ;\n       pr (succ n') map)\n  in\n  aux m Im.empty |> pr 1\n\nlet () = Scanf.scanf \"%d %d\\n\" f", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 569, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s764948167", "group_id": "codeNet:p03721", "input_text": "open Batteries\nlet n, k = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet arr = Array.make 100010 0\nlet () =\n  (1--n) |> Enum.iter begin fun _ ->\n    Scanf.scanf \" %d %d\" (fun a b -> arr.(a) <- arr.(a) + b)\n  end;\n  (1--10000) |> Enum.iter begin fun i ->\n    arr.(i) <- arr.(i) + arr.(i-1)\n  end;\n  Array.findi (fun v -> v >= k) arr\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1528050559, "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/s764948167.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s764948167", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nlet n, k = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet arr = Array.make 100010 0\nlet () =\n  (1--n) |> Enum.iter begin fun _ ->\n    Scanf.scanf \" %d %d\" (fun a b -> arr.(a) <- arr.(a) + b)\n  end;\n  (1--10000) |> Enum.iter begin fun i ->\n    arr.(i) <- arr.(i) + arr.(i-1)\n  end;\n  Array.findi (fun v -> v >= k) arr\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 51, "memory_kb": 5632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s933159495", "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    (* n回目以降の反復 手動ループアンローリング *)\n    let rec loop' n =\n      if\n        0 < n &&\n        es.fold (fun (u, v, c) b -> (* bは更新の有無 *)\n          let open Weight in\n          (* c は u から v への辺の重さ\n             d.(u) + c < d.(v) *)\n          0 < Weight.compare d.(v) (d.(u) + c)\n          (* n 回目以降に変更が起こった場合，v までの経路に負閉路が含まれている *)\n          && (d.(v) <- d.(u) + c; neg.(v) <- true; true) || b) false\n      then loop' (n - 1) in\n    (* n-1回目までの反復 *)\n    let rec loop = function\n      | 0 -> loop' n\n      | n ->\n          if\n            es.fold (fun (u, v, c) b ->\n              let open Weight in\n              0 < Weight.compare d.(v) (d.(u) + c) && (d.(v) <- d.(u) + c; true) || b) false\n          then loop (n - 1) in\n    loop (n - 1);\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": 1589404335, "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/s933159495.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933159495", "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    (* n回目以降の反復 手動ループアンローリング *)\n    let rec loop' n =\n      if\n        0 < n &&\n        es.fold (fun (u, v, c) b -> (* bは更新の有無 *)\n          let open Weight in\n          (* c は u から v への辺の重さ\n             d.(u) + c < d.(v) *)\n          0 < Weight.compare d.(v) (d.(u) + c)\n          (* n 回目以降に変更が起こった場合，v までの経路に負閉路が含まれている *)\n          && (d.(v) <- d.(u) + c; neg.(v) <- true; true) || b) false\n      then loop' (n - 1) in\n    (* n-1回目までの反復 *)\n    let rec loop = function\n      | 0 -> loop' n\n      | n ->\n          if\n            es.fold (fun (u, v, c) b ->\n              let open Weight in\n              0 < Weight.compare d.(v) (d.(u) + c) && (d.(v) <- d.(u) + c; true) || b) false\n          then loop (n - 1) in\n    loop (n - 1);\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2571, "cpu_time_ms": 115, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s058438573", "group_id": "codeNet:p03723", "input_text": "let id x = x\nlet (a,b,c) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a,b,c))\n\nlet rec func a b c n =\n  if ((a mod 2) = 1) || ((b mod 2) = 1) || ((c mod 2) = 1) then n\n  else\n    func ((b+c)/2) ((a+c)/2) ((a+b)/2) (n+1)\n\nlet ans = if (a = b) && (b = c) then -1 else func a b c 0\n\nlet () =\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1495830600, "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/s058438573.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s058438573", "user_id": "u735499035"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let id x = x\nlet (a,b,c) = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a,b,c))\n\nlet rec func a b c n =\n  if ((a mod 2) = 1) || ((b mod 2) = 1) || ((c mod 2) = 1) then n\n  else\n    func ((b+c)/2) ((a+c)/2) ((a+b)/2) (n+1)\n\nlet ans = if (a = b) && (b = c) then -1 else func a b c 0\n\nlet () =\n  Printf.printf \"%d\\n\" ans\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s739056894", "group_id": "codeNet:p03725", "input_text": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun h w k ->\n  let ass = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun as_ -> as_ in\n  let sy, sx =\n    List.find (fun (y, x) -> ass.(y).[x] = 'S') @@\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 visited = Array.make_matrix h w false in\n  let rec dfs y x = function\n    | 0 -> ()\n    | k ->\n        if\n          0 <= y && y < h &&\n          0 <= x && x < w &&\n          ass.(y).[x] <> '#' && \n          not visited.(y).(x)\n        then begin\n          visited.(y).(x) <- true;\n          dfs (y - 1) x (k - 1);\n          dfs y (x - 1) (k - 1);\n          dfs (y + 1) x (k - 1);\n          dfs y (x + 1) (k - 1)\n        end in\n  dfs sy sx (k + 1);\n  Printf.printf \"%d\\n\" @@ succ @@\n  Array.fold_left (Array.fold_left min) max_int @@\n  Array.init h @@ fun i ->\n    Array.init w @@ fun j ->\n      if not visited.(i).(j)\n      then max_int\n      else (min (min i j) (min (h - 1 - i) (w - 1 - j)) + k - 1) / k\n", "language": "OCaml", "metadata": {"date": 1536914014, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03725.html", "problem_id": "p03725", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03725/input.txt", "sample_output_relpath": "derived/input_output/data/p03725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03725/OCaml/s739056894.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s739056894", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun h w k ->\n  let ass = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun as_ -> as_ in\n  let sy, sx =\n    List.find (fun (y, x) -> ass.(y).[x] = 'S') @@\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 visited = Array.make_matrix h w false in\n  let rec dfs y x = function\n    | 0 -> ()\n    | k ->\n        if\n          0 <= y && y < h &&\n          0 <= x && x < w &&\n          ass.(y).[x] <> '#' && \n          not visited.(y).(x)\n        then begin\n          visited.(y).(x) <- true;\n          dfs (y - 1) x (k - 1);\n          dfs y (x - 1) (k - 1);\n          dfs (y + 1) x (k - 1);\n          dfs y (x + 1) (k - 1)\n        end in\n  dfs sy sx (k + 1);\n  Printf.printf \"%d\\n\" @@ succ @@\n  Array.fold_left (Array.fold_left min) max_int @@\n  Array.init h @@ fun i ->\n    Array.init w @@ fun j ->\n      if not visited.(i).(j)\n      then max_int\n      else (min (min i j) (min (h - 1 - i) (w - 1 - j)) + k - 1) / k\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows and W columns.\nWe will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= #, the room is locked and cannot be entered; if A_{i,j}= ., the room is not locked and can be freely entered.\nTakahashi is currently at the room where A_{i,j}= S, which can also be freely entered.\n\nEach room in the 1-st row, 1-st column, H-th row or W-th column, has an exit.\nEach of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).\n\nTakahashi will use his magic to get out of the building. In one cast, he can do the following:\n\nMove to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.\n\nThen, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.\n\nHis objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.\n\nIt is guaranteed that Takahashi is initially at a room without an exit.\n\nConstraints\n\n3 ≤ H ≤ 800\n\n3 ≤ W ≤ 800\n\n1 ≤ K ≤ H×W\n\nEach A_{i,j} is # , . or S.\n\nThere uniquely exists (i,j) such that A_{i,j}= S, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nA_{1,1}A_{1,2}...A_{1,W}\n:\nA_{H,1}A_{H,2}...A_{H,W}\n\nOutput\n\nPrint the minimum necessary number of casts.\n\nSample Input 1\n\n3 3 3\n#.#\n#S.\n###\n\nSample Output 1\n\n1\n\nTakahashi can move to room (1,2) in one cast.\n\nSample Input 2\n\n3 3 3\n###\n#S#\n###\n\nSample Output 2\n\n2\n\nTakahashi cannot move in the first cast, but can unlock room (1,2).\nThen, he can move to room (1,2) in the next cast, achieving the objective in two casts.\n\nSample Input 3\n\n7 7 2\n#######\n#######\n##...##\n###S###\n##.#.##\n###.###\n#######\n\nSample Output 3\n\n2", "sample_input": "3 3 3\n#.#\n#S.\n###\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03725", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows and W columns.\nWe will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= #, the room is locked and cannot be entered; if A_{i,j}= ., the room is not locked and can be freely entered.\nTakahashi is currently at the room where A_{i,j}= S, which can also be freely entered.\n\nEach room in the 1-st row, 1-st column, H-th row or W-th column, has an exit.\nEach of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).\n\nTakahashi will use his magic to get out of the building. In one cast, he can do the following:\n\nMove to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.\n\nThen, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.\n\nHis objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.\n\nIt is guaranteed that Takahashi is initially at a room without an exit.\n\nConstraints\n\n3 ≤ H ≤ 800\n\n3 ≤ W ≤ 800\n\n1 ≤ K ≤ H×W\n\nEach A_{i,j} is # , . or S.\n\nThere uniquely exists (i,j) such that A_{i,j}= S, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nA_{1,1}A_{1,2}...A_{1,W}\n:\nA_{H,1}A_{H,2}...A_{H,W}\n\nOutput\n\nPrint the minimum necessary number of casts.\n\nSample Input 1\n\n3 3 3\n#.#\n#S.\n###\n\nSample Output 1\n\n1\n\nTakahashi can move to room (1,2) in one cast.\n\nSample Input 2\n\n3 3 3\n###\n#S#\n###\n\nSample Output 2\n\n2\n\nTakahashi cannot move in the first cast, but can unlock room (1,2).\nThen, he can move to room (1,2) in the next cast, achieving the objective in two casts.\n\nSample Input 3\n\n7 7 2\n#######\n#######\n##...##\n###S###\n##.#.##\n###.###\n#######\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1024, "cpu_time_ms": 236, "memory_kb": 83580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s534026352", "group_id": "codeNet:p03729", "input_text": "open Batteries\nlet () =\n  let a,b,c = Scanf.scanf \"%s %s %s \" (fun a b c -> a,b,c) in\n\n  Printf.printf \"%s\\n\" @@\n  if \n    (String.sub a (String.length a - 1) 1) = (String.sub b 0 1) &&\n    (String.sub b (String.length b - 1) 1) = (String.sub c 0 1)\n  then \"YES\" else \"NO\"\n", "language": "OCaml", "metadata": {"date": 1529234979, "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/s534026352.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s534026352", "user_id": "u139013163"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Batteries\nlet () =\n  let a,b,c = Scanf.scanf \"%s %s %s \" (fun a b c -> a,b,c) in\n\n  Printf.printf \"%s\\n\" @@\n  if \n    (String.sub a (String.length a - 1) 1) = (String.sub b 0 1) &&\n    (String.sub b (String.length b - 1) 1) = (String.sub c 0 1)\n  then \"YES\" else \"NO\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s595195816", "group_id": "codeNet:p03729", "input_text": "open String\nlet () = \n  Scanf.scanf \"%s %s %s\" (fun a b c ->\n      let lena = length a and lenb = length b in\n      if a.[lena-1] = b.[0] && b.[lenb-1] = c.[0] then \"YES\"\n      else \"NO\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1525124635, "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/s595195816.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595195816", "user_id": "u987869509"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open String\nlet () = \n  Scanf.scanf \"%s %s %s\" (fun a b c ->\n      let lena = length a and lenb = length b in\n      if a.[lena-1] = b.[0] && b.[lenb-1] = c.[0] then \"YES\"\n      else \"NO\")\n  |> print_endline", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s026698905", "group_id": "codeNet:p03729", "input_text": "let f s = s.[String.length s - 1]\nlet () = Scanf.scanf \"%s %s %s\" (fun a b c -> if f a = b.[0] && f b = c.[0] then \"YES\" else \"NO\")\n|> print_endline\n", "language": "OCaml", "metadata": {"date": 1519658798, "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/s026698905.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s026698905", "user_id": "u798181098"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let f s = s.[String.length s - 1]\nlet () = Scanf.scanf \"%s %s %s\" (fun a b c -> if f a = b.[0] && f b = c.[0] then \"YES\" else \"NO\")\n|> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 149, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s261477777", "group_id": "codeNet:p03730", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    let rec loop i =\n        if i = b then \"NO\" else\n            if (i * a) mod b = c then \"YES\" else loop (i + 1)\n    in\n    loop 0 |> print_endline\n)", "language": "OCaml", "metadata": {"date": 1600832698, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s261477777.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s261477777", "user_id": "u342443598"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    let rec loop i =\n        if i = b then \"NO\" else\n            if (i * a) mod b = c then \"YES\" else loop (i + 1)\n    in\n    loop 0 |> print_endline\n)", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s864280438", "group_id": "codeNet:p03730", "input_text": "Scanf.scanf \" %d %d %d\" @@ fun a b c ->\n  let rems = Array.make b false in\n  let rec f n =\n    let r = n mod b in\n    if r = c then (print_endline \"YES\"; exit 0)\n    else if rems.(r) then (print_endline \"NO\"; exit 0)\n    else\n      (rems.(r) <- true;\n      f (n + a)) in\n  f a", "language": "OCaml", "metadata": {"date": 1559818662, "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/s864280438.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864280438", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d\" @@ fun a b c ->\n  let rems = Array.make b false in\n  let rec f n =\n    let r = n mod b in\n    if r = c then (print_endline \"YES\"; exit 0)\n    else if rems.(r) then (print_endline \"NO\"; exit 0)\n    else\n      (rems.(r) <- true;\n      f (n + a)) in\n  f a", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 276, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s137529231", "group_id": "codeNet:p03731", "input_text": "open Batteries\nlet () =\n  let n, l = Scanf.scanf \"%d %d\" (fun x y -> x, y) in\n  let f (acc, prev) t = (acc + min l (t - prev), t) in\n  List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n  |> List.fold_left f (0, -l)\n  |> fst |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1527978183, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03731.html", "problem_id": "p03731", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03731/input.txt", "sample_output_relpath": "derived/input_output/data/p03731/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03731/OCaml/s137529231.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s137529231", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "open Batteries\nlet () =\n  let n, l = Scanf.scanf \"%d %d\" (fun x y -> x, y) in\n  let f (acc, prev) t = (acc + min l (t - prev), t) in\n  List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n  |> List.fold_left f (0, -l)\n  |> fst |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "sample_input": "2 4\n0 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03731", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 75, "memory_kb": 7808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s144201038", "group_id": "codeNet:p03737", "input_text": "open Char\nlet () = Scanf.scanf \"%s %s %s\\n\"\n\t(fun s1 s2 s3 -> \n    \tPrintf.printf \"%s\\n\" \n        ((escaped (uppercase s1.[0])) ^ (escaped (uppercase s2.[0])) ^ (escaped (uppercase s3.[0]))))", "language": "OCaml", "metadata": {"date": 1582402496, "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/s144201038.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144201038", "user_id": "u307426615"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "open Char\nlet () = Scanf.scanf \"%s %s %s\\n\"\n\t(fun s1 s2 s3 -> \n    \tPrintf.printf \"%s\\n\" \n        ((escaped (uppercase s1.[0])) ^ (escaped (uppercase s2.[0])) ^ (escaped (uppercase s3.[0]))))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 191, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s796998784", "group_id": "codeNet:p03737", "input_text": "let a, b, c = Scanf.scanf \" %s %s %s\" @@ fun a b c -> a, b, c\nlet f = Char.uppercase\nlet _ = Printf.printf \"%c%c%c\\n\" (f a.[0]) (f b.[0]) (f c.[0])", "language": "OCaml", "metadata": {"date": 1565183953, "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/s796998784.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796998784", "user_id": "u732304692"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let a, b, c = Scanf.scanf \" %s %s %s\" @@ fun a b c -> a, b, c\nlet f = Char.uppercase\nlet _ = Printf.printf \"%c%c%c\\n\" (f a.[0]) (f b.[0]) (f c.[0])", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s161587684", "group_id": "codeNet:p03737", "input_text": "open Batteries\nlet () =\n  let a,b,c = Scanf.scanf \"%s %s %s \" (fun a b c -> a,b,c) in\n\n  let a = String.uppercase_ascii (String.sub a 0 1) in\n  let b = String.uppercase_ascii (String.sub b 0 1) in\n  let c = String.uppercase_ascii (String.sub c 0 1) in\n\n  Printf.printf \"%s\\n\" (a ^ b ^ c)\n", "language": "OCaml", "metadata": {"date": 1529162359, "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/s161587684.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s161587684", "user_id": "u139013163"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "open Batteries\nlet () =\n  let a,b,c = Scanf.scanf \"%s %s %s \" (fun a b c -> a,b,c) in\n\n  let a = String.uppercase_ascii (String.sub a 0 1) in\n  let b = String.uppercase_ascii (String.sub b 0 1) in\n  let c = String.uppercase_ascii (String.sub c 0 1) in\n\n  Printf.printf \"%s\\n\" (a ^ b ^ c)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s081210961", "group_id": "codeNet:p03738", "input_text": "let a = read_line () in\nlet b = read_line () in\nlet al = String.length a in\nlet bl = String.length b in\nprint_endline @@\nif al > bl then \"GREATER\" else\n    if al < bl then \"LESS\" else\n        if a > b then \"GREATER\" else\n            if a < b then \"LESS\" else\n                \"EQUAL\"", "language": "OCaml", "metadata": {"date": 1585708970, "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/s081210961.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081210961", "user_id": "u342443598"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "let a = read_line () in\nlet b = read_line () in\nlet al = String.length a in\nlet bl = String.length b in\nprint_endline @@\nif al > bl then \"GREATER\" else\n    if al < bl then \"LESS\" else\n        if a > b then \"GREATER\" else\n            if a < b then \"LESS\" else\n                \"EQUAL\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s555230729", "group_id": "codeNet:p03738", "input_text": "let a = read_line ()\nlet b = read_line ()\nlet n, m = String.length a, String.length b\nlet _ = print_endline @@ match if n < m then -1 else if n > m then 1 else compare a b with 1 -> \"GREATER\" | 0 -> \"EQUAL\" | _ -> \"LESS\"", "language": "OCaml", "metadata": {"date": 1564926053, "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/s555230729.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s555230729", "user_id": "u732304692"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "let a = read_line ()\nlet b = read_line ()\nlet n, m = String.length a, String.length b\nlet _ = print_endline @@ match if n < m then -1 else if n > m then 1 else compare a b with 1 -> \"GREATER\" | 0 -> \"EQUAL\" | _ -> \"LESS\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s804547069", "group_id": "codeNet:p03738", "input_text": "open Bytes\nlet a, b = Scanf.scanf \" %s %s\" @@ fun a b -> a, b\nlet n, m = String.length a, String.length b\nlet ma = max n m\nlet a', b' = make ma '0', make ma '0'\nlet _ =\n  List.iter (fun (b, s, l) -> String.iteri (fun i -> set b (i + ma - l)) s) [a', a, n; b', b, m];\n  print_endline @@ if a' > b' then \"GREATER\" else if a' < b' then \"LESS\" else \"EQUAL\"", "language": "OCaml", "metadata": {"date": 1562219050, "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/s804547069.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s804547069", "user_id": "u732304692"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "open Bytes\nlet a, b = Scanf.scanf \" %s %s\" @@ fun a b -> a, b\nlet n, m = String.length a, String.length b\nlet ma = max n m\nlet a', b' = make ma '0', make ma '0'\nlet _ =\n  List.iter (fun (b, s, l) -> String.iteri (fun i -> set b (i + ma - l)) s) [a', a, n; b', b, m];\n  print_endline @@ if a' > b' then \"GREATER\" else if a' < b' then \"LESS\" else \"EQUAL\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s649235213", "group_id": "codeNet:p03739", "input_text": "open Batteries\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet a = List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\nlet rec solve acc sum sign = function\n  | [] -> acc\n  | (x::xs) ->\n      if (sum+x) * sign > 0 then\n        solve acc (sum+x) (-sign) xs\n      else\n        let acc' = acc + abs (sum+x - sign) in\n        solve acc' sign (-sign) xs\n\nlet () =\n  min (solve 0 0 1 a) (solve 0 0 (-1) a)\n  |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1527977711, "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/s649235213.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649235213", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Batteries\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet a = List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\nlet rec solve acc sum sign = function\n  | [] -> acc\n  | (x::xs) ->\n      if (sum+x) * sign > 0 then\n        solve acc (sum+x) (-sign) xs\n      else\n        let acc' = acc + abs (sum+x - sign) in\n        solve acc' sign (-sign) xs\n\nlet () =\n  min (solve 0 0 1 a) (solve 0 0 (-1) a)\n  |> Printf.printf \"%d\\n\"\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N. The i-th term in the sequence is a_i.\nIn one operation, you can select a term and either increment or decrement it by one.\n\nAt least how many operations are necessary to satisfy the following conditions?\n\nFor every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.\n\nFor every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.\n\nConstraints\n\n2 ≤ n ≤ 10^5\n\n|a_i| ≤ 10^9\n\nEach a_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint the minimum necessary count of operations.\n\nSample Input 1\n\n4\n1 -3 1 0\n\nSample Output 1\n\n4\n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four operations. The sums of the first one, two, three and four terms are 1, -1, 1 and -1, respectively, which satisfy the conditions.\n\nSample Input 2\n\n5\n3 -6 4 -5 7\n\nSample Output 2\n\n0\n\nThe given sequence already satisfies the conditions.\n\nSample Input 3\n\n6\n-1 4 3 2 -5 4\n\nSample Output 3\n\n8", "sample_input": "4\n1 -3 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03739", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N. The i-th term in the sequence is a_i.\nIn one operation, you can select a term and either increment or decrement it by one.\n\nAt least how many operations are necessary to satisfy the following conditions?\n\nFor every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.\n\nFor every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.\n\nConstraints\n\n2 ≤ n ≤ 10^5\n\n|a_i| ≤ 10^9\n\nEach a_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint the minimum necessary count of operations.\n\nSample Input 1\n\n4\n1 -3 1 0\n\nSample Output 1\n\n4\n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four operations. The sums of the first one, two, three and four terms are 1, -1, 1 and -1, respectively, which satisfy the conditions.\n\nSample Input 2\n\n5\n3 -6 4 -5 7\n\nSample Output 2\n\n0\n\nThe given sequence already satisfies the conditions.\n\nSample Input 3\n\n6\n-1 4 3 2 -5 4\n\nSample Output 3\n\n8", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 423, "cpu_time_ms": 39, "memory_kb": 6528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s017745217", "group_id": "codeNet:p03752", "input_text": "let rec seq s t f = if s > t then []\n                    else (f s) :: seq (s + 1) t f\nlet _ =\n  let n::k::_ = List.map int_of_string @@ Str.split (Str.regexp \"[ \\t]+\") (read_line ()) in\n  let hs = List.map int_of_string @@ Str.split (Str.regexp \"[ \\t]+\") (read_line ()) in\n  print_endline @@ string_of_int @@\n    List.fold_left (+) 0 @@\n      List.map2 (-) (seq 0 (n-1) (fun x -> List.hd hs + x)) hs\n", "language": "OCaml", "metadata": {"date": 1491789363, "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/s017745217.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s017745217", "user_id": "u388783188"}, "prompt_components": {"gold_output": "1541\n", "input_to_evaluate": "let rec seq s t f = if s > t then []\n                    else (f s) :: seq (s + 1) t f\nlet _ =\n  let n::k::_ = List.map int_of_string @@ Str.split (Str.regexp \"[ \\t]+\") (read_line ()) in\n  let hs = List.map int_of_string @@ Str.split (Str.regexp \"[ \\t]+\") (read_line ()) in\n  print_endline @@ string_of_int @@\n    List.fold_left (+) 0 @@\n      List.map2 (-) (seq 0 (n-1) (fun x -> List.hd hs + x)) hs\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s549097176", "group_id": "codeNet:p03759", "input_text": "Scanf.scanf \"%d %d %d\"\n(fun a b c -> (b-a) = (c-b))\n|> (fun b -> match b with true -> \"YES\" | false -> \"NO\")\n|> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1560998944, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/s549097176.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549097176", "user_id": "u635974378"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\"\n(fun a b c -> (b-a) = (c-b))\n|> (fun b -> match b with true -> \"YES\" | false -> \"NO\")\n|> Printf.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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s776558868", "group_id": "codeNet:p03760", "input_text": "let o = read_line ()\n\nlet e = read_line ()\n\nlet rec solve i =\n  try\n    print_char o.[i];\n    print_char e.[i];\n    solve (i + 1)\n  with _ -> ()\n\nlet () = solve 0", "language": "OCaml", "metadata": {"date": 1585949220, "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/s776558868.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776558868", "user_id": "u752907799"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "let o = read_line ()\n\nlet e = read_line ()\n\nlet rec solve i =\n  try\n    print_char o.[i];\n    print_char e.[i];\n    solve (i + 1)\n  with _ -> ()\n\nlet () = solve 0", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s274780608", "group_id": "codeNet:p03760", "input_text": "let o = read_line ()\nlet e = read_line ()\nlet _ = String.(init (length o + length e) (fun i -> [|o; e|].(i mod 2).[i / 2])) |> print_endline", "language": "OCaml", "metadata": {"date": 1577783730, "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/s274780608.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s274780608", "user_id": "u732304692"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "let o = read_line ()\nlet e = read_line ()\nlet _ = String.(init (length o + length e) (fun i -> [|o; e|].(i mod 2).[i / 2])) |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 140, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s777475614", "group_id": "codeNet:p03760", "input_text": "let o = read_line ()\nlet e = read_line ()\nlet buf = Buffer.create (String.length o * 2)\n\nlet () =\n  if String.length o = String.length e then\n    for i = 0 to (String.length o - 1) do\n      Buffer.add_char buf o.[i] ;\n      Buffer.add_char buf e.[i] ;\n    done\n  else\n    begin\n      for i = 0 to (String.length e - 1) do\n        Buffer.add_char buf o.[i] ;\n        Buffer.add_char buf e.[i] ;\n      done ;\n      Buffer.add_char buf o.[String.length o - 1]\n    end ;\n  print_endline (Buffer.contents buf)", "language": "OCaml", "metadata": {"date": 1521947330, "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/s777475614.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777475614", "user_id": "u987869509"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "let o = read_line ()\nlet e = read_line ()\nlet buf = Buffer.create (String.length o * 2)\n\nlet () =\n  if String.length o = String.length e then\n    for i = 0 to (String.length o - 1) do\n      Buffer.add_char buf o.[i] ;\n      Buffer.add_char buf e.[i] ;\n    done\n  else\n    begin\n      for i = 0 to (String.length e - 1) do\n        Buffer.add_char buf o.[i] ;\n        Buffer.add_char buf e.[i] ;\n      done ;\n      Buffer.add_char buf o.[String.length o - 1]\n    end ;\n  print_endline (Buffer.contents buf)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 504, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s045063105", "group_id": "codeNet:p03761", "input_text": "open Batteries\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let s_l = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%s \" (fun a -> a)) in\n  let c_l_l = List.map (fun s -> String.to_list s |> List.sort compare) s_l in\n  \n  let intersection xs ys =\n    List.fold_left (fun a b -> if List.mem b ys then (b::a) else a) [] xs\n  in\n\n  let res = List.fold_left intersection (List.hd c_l_l) (List.tl c_l_l) in\n\n  Printf.printf \"%s\\n\" @@\n  String.of_list res\n\n", "language": "OCaml", "metadata": {"date": 1530424599, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03761.html", "problem_id": "p03761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03761/input.txt", "sample_output_relpath": "derived/input_output/data/p03761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03761/OCaml/s045063105.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s045063105", "user_id": "u139013163"}, "prompt_components": {"gold_output": "aac\n", "input_to_evaluate": "open Batteries\n\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let s_l = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%s \" (fun a -> a)) in\n  let c_l_l = List.map (fun s -> String.to_list s |> List.sort compare) s_l in\n  \n  let intersection xs ys =\n    List.fold_left (fun a b -> if List.mem b ys then (b::a) else a) [] xs\n  in\n\n  let res = List.fold_left intersection (List.hd c_l_l) (List.tl c_l_l) in\n\n  Printf.printf \"%s\\n\" @@\n  String.of_list res\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves \"paper cutting\": he cuts out characters from a newspaper headline and rearranges them to form another string.\n\nHe will receive a headline which contains one of the strings S_1,...,S_n tomorrow.\nHe is excited and already thinking of what string he will create.\nSince he does not know the string on the headline yet, he is interested in strings that can be created regardless of which string the headline contains.\n\nFind the longest string that can be created regardless of which string among S_1,...,S_n the headline contains.\nIf there are multiple such strings, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq n \\leq 50\n\n1 \\leq |S_i| \\leq 50 for every i = 1, ..., n.\n\nS_i consists of lowercase English letters (a - z) for every i = 1, ..., n.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nS_1\n...\nS_n\n\nOutput\n\nPrint the lexicographically smallest string among the longest strings that satisfy the condition.\nIf the answer is an empty string, print an empty line.\n\nSample Input 1\n\n3\ncbaa\ndaacc\nacacac\n\nSample Output 1\n\naac\n\nThe strings that can be created from each of cbaa, daacc and acacac, are aa, aac, aca, caa and so forth.\nAmong them, aac, aca and caa are the longest, and the lexicographically smallest of these three is aac.\n\nSample Input 2\n\n3\na\naa\nb\n\nSample Output 2\n\nThe answer is an empty string.", "sample_input": "3\ncbaa\ndaacc\nacacac\n"}, "reference_outputs": ["aac\n"], "source_document_id": "p03761", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves \"paper cutting\": he cuts out characters from a newspaper headline and rearranges them to form another string.\n\nHe will receive a headline which contains one of the strings S_1,...,S_n tomorrow.\nHe is excited and already thinking of what string he will create.\nSince he does not know the string on the headline yet, he is interested in strings that can be created regardless of which string the headline contains.\n\nFind the longest string that can be created regardless of which string among S_1,...,S_n the headline contains.\nIf there are multiple such strings, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq n \\leq 50\n\n1 \\leq |S_i| \\leq 50 for every i = 1, ..., n.\n\nS_i consists of lowercase English letters (a - z) for every i = 1, ..., n.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nS_1\n...\nS_n\n\nOutput\n\nPrint the lexicographically smallest string among the longest strings that satisfy the condition.\nIf the answer is an empty string, print an empty line.\n\nSample Input 1\n\n3\ncbaa\ndaacc\nacacac\n\nSample Output 1\n\naac\n\nThe strings that can be created from each of cbaa, daacc and acacac, are aa, aac, aca, caa and so forth.\nAmong them, aac, aca and caa are the longest, and the lexicographically smallest of these three is aac.\n\nSample Input 2\n\n3\na\naa\nb\n\nSample Output 2\n\nThe answer is an empty string.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 469, "cpu_time_ms": 3, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s365860649", "group_id": "codeNet:p03762", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let mm = 1_000_000_007 in\n    let ( +@) a b = (((a + b) mod mm) + mm) mod mm in\n    let ( *@) a b = (a * b) mod mm in\n    let calc lim =\n        Scanf.scanf \" %d\" (fun offset ->\n            let rec loop i coeff acc =\n                if i = lim then acc else\n                    let acc = acc +@ coeff *@ Scanf.scanf \" %d\" (fun x -> x - offset) in\n                    loop (i + 1) (coeff + 2) acc\n            in\n            loop 1 (3 - lim) 0\n        )\n    in\n    Printf.printf \"%d\\n\" @@ (calc m *@ calc n)\n)", "language": "OCaml", "metadata": {"date": 1591471758, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03762.html", "problem_id": "p03762", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03762/input.txt", "sample_output_relpath": "derived/input_output/data/p03762/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03762/OCaml/s365860649.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s365860649", "user_id": "u342443598"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let mm = 1_000_000_007 in\n    let ( +@) a b = (((a + b) mod mm) + mm) mod mm in\n    let ( *@) a b = (a * b) mod mm in\n    let calc lim =\n        Scanf.scanf \" %d\" (fun offset ->\n            let rec loop i coeff acc =\n                if i = lim then acc else\n                    let acc = acc +@ coeff *@ Scanf.scanf \" %d\" (fun x -> x - offset) in\n                    loop (i + 1) (coeff + 2) acc\n            in\n            loop 1 (3 - lim) 0\n        )\n    in\n    Printf.printf \"%d\\n\" @@ (calc m *@ calc n)\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": "p03762", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 63, "memory_kb": 4608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s000193956", "group_id": "codeNet:p03762", "input_text": "let c = 1000000007\n\nlet ans n m =\n  let rec sum i n s =\n    if i = n then s\n    else\n      let x = Scanf.scanf \" %d\" (fun x -> x) in\n      sum (i + 1) n (s + (2 * i - n + 1) * x)\n  and f x = abs x mod c in\n  f (sum 0 n 0) * f (sum 0 m 0) mod c\n\nlet () = Scanf.scanf \"%d %d\" (fun n m -> print_int (ans n m))\n", "language": "OCaml", "metadata": {"date": 1585955864, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03762.html", "problem_id": "p03762", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03762/input.txt", "sample_output_relpath": "derived/input_output/data/p03762/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03762/OCaml/s000193956.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s000193956", "user_id": "u752907799"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "let c = 1000000007\n\nlet ans n m =\n  let rec sum i n s =\n    if i = n then s\n    else\n      let x = Scanf.scanf \" %d\" (fun x -> x) in\n      sum (i + 1) n (s + (2 * i - n + 1) * x)\n  and f x = abs x mod c in\n  f (sum 0 n 0) * f (sum 0 m 0) mod c\n\nlet () = Scanf.scanf \"%d %d\" (fun n m -> print_int (ans n m))\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": "p03762", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 59, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s665826877", "group_id": "codeNet:p03765", "input_text": "let () = Scanf.scanf \"%s\\n%s\\n%d\\n\" @@ fun s t q ->\n  let count_s = Array.make (String.length s + 1) 0 in\n  let count_t = Array.make (String.length t + 1) 0 in\n  String.iteri (fun i c ->\n    count_s.(i + 1) <- count_s.(i) + if c = 'A' then 1 else 2) s;\n  String.iteri (fun i c ->\n    count_t.(i + 1) <- count_t.(i) + if c = 'A' then 1 else 2) t;\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n      print_endline @@ \n      if (count_s.(b) - count_s.(a - 1)) mod 3 = (count_t.(d) - count_t.(c - 1)) mod 3 then \"YES\" else \"NO\"\n  done\n", "language": "OCaml", "metadata": {"date": 1531614469, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03765.html", "problem_id": "p03765", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03765/input.txt", "sample_output_relpath": "derived/input_output/data/p03765/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03765/OCaml/s665826877.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s665826877", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\nNO\nYES\nNO\n", "input_to_evaluate": "let () = Scanf.scanf \"%s\\n%s\\n%d\\n\" @@ fun s t q ->\n  let count_s = Array.make (String.length s + 1) 0 in\n  let count_t = Array.make (String.length t + 1) 0 in\n  String.iteri (fun i c ->\n    count_s.(i + 1) <- count_s.(i) + if c = 'A' then 1 else 2) s;\n  String.iteri (fun i c ->\n    count_t.(i + 1) <- count_t.(i) + if c = 'A' then 1 else 2) t;\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n      print_endline @@ \n      if (count_s.(b) - count_s.(a - 1)) mod 3 = (count_t.(d) - count_t.(c - 1)) mod 3 then \"YES\" else \"NO\"\n  done\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nLet us consider the following operations on a string consisting of A and B:\n\nSelect a character in a string. If it is A, replace it with BB. If it is B, replace with AA.\n\nSelect a substring that is equal to either AAA or BBB, and delete it from the string.\n\nFor example, if the first operation is performed on ABA and the first character is selected, the string becomes BBBA.\nIf the second operation is performed on BBBAAAA and the fourth through sixth characters are selected, the string becomes BBBA.\n\nThese operations can be performed any number of times, in any order.\n\nYou are given two string S and T, and q queries a_i, b_i, c_i, d_i.\nFor each query, determine whether S_{a_i} S_{{a_i}+1} ... S_{b_i}, a substring of S, can be made into T_{c_i} T_{{c_i}+1} ... T_{d_i}, a substring of T.\n\nConstraints\n\n1 \\leq |S|, |T| \\leq 10^5\n\nS and T consist of letters A and B.\n\n1 \\leq q \\leq 10^5\n\n1 \\leq a_i \\leq b_i \\leq |S|\n\n1 \\leq c_i \\leq d_i \\leq |T|\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\nq\na_1 b_1 c_1 d_1\n...\na_q b_q c_q d_q\n\nOutput\n\nPrint q lines. The i-th line should contain the response to the i-th query. If S_{a_i} S_{{a_i}+1} ... S_{b_i} can be made into T_{c_i} T_{{c_i}+1} ... T_{d_i}, print YES. Otherwise, print NO.\n\nSample Input 1\n\nBBBAAAABA\nBBBBA\n4\n7 9 2 5\n7 9 1 4\n1 7 2 5\n1 7 2 4\n\nSample Output 1\n\nYES\nNO\nYES\nNO\n\nThe first query asks whether the string ABA can be made into BBBA.\nAs explained in the problem statement, it can be done by the first operation.\n\nThe second query asks whether ABA can be made into BBBB, and the fourth query asks whether BBBAAAA can be made into BBB.\nNeither is possible.\n\nThe third query asks whether the string BBBAAAA can be made into BBBA.\nAs explained in the problem statement, it can be done by the second operation.\n\nSample Input 2\n\nAAAAABBBBAAABBBBAAAA\nBBBBAAABBBBBBAAAAABB\n10\n2 15 2 13\n2 13 6 16\n1 13 2 20\n4 20 3 20\n1 18 9 19\n2 14 1 11\n3 20 3 15\n6 16 1 17\n4 18 8 20\n7 20 3 14\n\nSample Output 2\n\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO", "sample_input": "BBBAAAABA\nBBBBA\n4\n7 9 2 5\n7 9 1 4\n1 7 2 5\n1 7 2 4\n"}, "reference_outputs": ["YES\nNO\nYES\nNO\n"], "source_document_id": "p03765", "source_text": "Score : 600 points\n\nProblem Statement\n\nLet us consider the following operations on a string consisting of A and B:\n\nSelect a character in a string. If it is A, replace it with BB. If it is B, replace with AA.\n\nSelect a substring that is equal to either AAA or BBB, and delete it from the string.\n\nFor example, if the first operation is performed on ABA and the first character is selected, the string becomes BBBA.\nIf the second operation is performed on BBBAAAA and the fourth through sixth characters are selected, the string becomes BBBA.\n\nThese operations can be performed any number of times, in any order.\n\nYou are given two string S and T, and q queries a_i, b_i, c_i, d_i.\nFor each query, determine whether S_{a_i} S_{{a_i}+1} ... S_{b_i}, a substring of S, can be made into T_{c_i} T_{{c_i}+1} ... T_{d_i}, a substring of T.\n\nConstraints\n\n1 \\leq |S|, |T| \\leq 10^5\n\nS and T consist of letters A and B.\n\n1 \\leq q \\leq 10^5\n\n1 \\leq a_i \\leq b_i \\leq |S|\n\n1 \\leq c_i \\leq d_i \\leq |T|\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\nq\na_1 b_1 c_1 d_1\n...\na_q b_q c_q d_q\n\nOutput\n\nPrint q lines. The i-th line should contain the response to the i-th query. If S_{a_i} S_{{a_i}+1} ... S_{b_i} can be made into T_{c_i} T_{{c_i}+1} ... T_{d_i}, print YES. Otherwise, print NO.\n\nSample Input 1\n\nBBBAAAABA\nBBBBA\n4\n7 9 2 5\n7 9 1 4\n1 7 2 5\n1 7 2 4\n\nSample Output 1\n\nYES\nNO\nYES\nNO\n\nThe first query asks whether the string ABA can be made into BBBA.\nAs explained in the problem statement, it can be done by the first operation.\n\nThe second query asks whether ABA can be made into BBBB, and the fourth query asks whether BBBAAAA can be made into BBB.\nNeither is possible.\n\nThe third query asks whether the string BBBAAAA can be made into BBBA.\nAs explained in the problem statement, it can be done by the second operation.\n\nSample Input 2\n\nAAAAABBBBAAABBBBAAAA\nBBBBAAABBBBBBAAAAABB\n10\n2 15 2 13\n2 13 6 16\n1 13 2 20\n4 20 3 20\n1 18 9 19\n2 14 1 11\n3 20 3 15\n6 16 1 17\n4 18 8 20\n7 20 3 14\n\nSample Output 2\n\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 559, "cpu_time_ms": 260, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s817186626", "group_id": "codeNet:p03767", "input_text": "\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 compare in\n    let xs = List.rev xs in\n    solve xs ((List.length xs) / 3) 0\n \n", "language": "OCaml", "metadata": {"date": 1493481683, "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/s817186626.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s817186626", "user_id": "u733618878"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "\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 compare in\n    let xs = List.rev xs 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 460, "cpu_time_ms": 2104, "memory_kb": 23424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s966279663", "group_id": "codeNet:p03767", "input_text": "let get_odd lst =\n\tlet rec loop idx acc lst =\n\t\tmatch lst with\n\t\t| [] -> acc\n\t\t| x :: xs ->\n\t\t\tif idx mod 2 = 1 then loop (idx + 1) (x :: acc) xs\n\t\t\telse loop (idx + 1) acc xs\n\tin\n\tloop 0 [] lst\n\nlet rec head n lst =\n\tmatch lst with\n\t| [] -> []\n\t| x :: xs ->\n\t\tif n > 0 then x :: head (n - 1) xs\n\t\telse []\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\tget_odd a\n\t|> head n\n\t|> List.fold_left (+) 0\n\t|> print_int\n\t|> print_newline\n", "language": "OCaml", "metadata": {"date": 1491097131, "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/s966279663.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s966279663", "user_id": "u420267469"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let get_odd lst =\n\tlet rec loop idx acc lst =\n\t\tmatch lst with\n\t\t| [] -> acc\n\t\t| x :: xs ->\n\t\t\tif idx mod 2 = 1 then loop (idx + 1) (x :: acc) xs\n\t\t\telse loop (idx + 1) acc xs\n\tin\n\tloop 0 [] lst\n\nlet rec head n lst =\n\tmatch lst with\n\t| [] -> []\n\t| x :: xs ->\n\t\tif n > 0 then x :: head (n - 1) xs\n\t\telse []\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\tget_odd a\n\t|> head n\n\t|> List.fold_left (+) 0\n\t|> print_int\n\t|> print_newline\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "sample_input": "2\n5 2 8 5 1 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 507, "cpu_time_ms": 160, "memory_kb": 43776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s233480769", "group_id": "codeNet:p03773", "input_text": "let _ = Scanf.sscanf (read_line()) \"%d %d\" (fun a b ->\n  if a + b >= 24 then a + b - 24 else a + b\n) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1584365946, "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/s233480769.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s233480769", "user_id": "u511870776"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line()) \"%d %d\" (fun a b ->\n  if a + b >= 24 then a + b - 24 else a + b\n) |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s553452935", "group_id": "codeNet:p03773", "input_text": "let rec search x y m cd index ans = \nif cd = [] \nthen \n    ans\nelse\n    let (c,d) = (List.hd cd)  in\n    let dis = abs(x-c) + abs(y-d) in\n    if dis <= m \n    then\n        search x y dis (List.tl cd) (index-1) index\n    else\n        search x y m (List.tl cd) (index-1) ans;;\n\n\nlet n,m = Scanf.scanf \"%d %d \" (fun a b -> a,b) in \nlet rec loop i= \n    if i <= 0 \n    then\n         [] \n    else\n        (Scanf.scanf \"%d %d \" (fun a b -> a,b)) :: loop (i-1) in\nlet ab = List.rev (loop n) in \nlet cd = loop m in\nlet rec loop2 ls = \n    match ls with\n        |[] -> () \n        |(a,b)::tail ->  Printf.printf \"%d\\n\" (search a b 1000000000 cd m 0);loop2 tail in\nloop2 ab;;", "language": "OCaml", "metadata": {"date": 1500740207, "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/s553452935.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s553452935", "user_id": "u867933941"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let rec search x y m cd index ans = \nif cd = [] \nthen \n    ans\nelse\n    let (c,d) = (List.hd cd)  in\n    let dis = abs(x-c) + abs(y-d) in\n    if dis <= m \n    then\n        search x y dis (List.tl cd) (index-1) index\n    else\n        search x y m (List.tl cd) (index-1) ans;;\n\n\nlet n,m = Scanf.scanf \"%d %d \" (fun a b -> a,b) in \nlet rec loop i= \n    if i <= 0 \n    then\n         [] \n    else\n        (Scanf.scanf \"%d %d \" (fun a b -> a,b)) :: loop (i-1) in\nlet ab = List.rev (loop n) in \nlet cd = loop m in\nlet rec loop2 ls = \n    match ls with\n        |[] -> () \n        |(a,b)::tail ->  Printf.printf \"%d\\n\" (search a b 1000000000 cd m 0);loop2 tail in\nloop2 ab;;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 665, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s488053540", "group_id": "codeNet:p03773", "input_text": "let a,b = Scanf.scanf \"%d %d\" (fun a b -> a,b) in\n    Printf.printf \"%d\\n\" ((a + b) mod 24);;", "language": "OCaml", "metadata": {"date": 1500579073, "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/s488053540.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488053540", "user_id": "u867933941"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let a,b = Scanf.scanf \"%d %d\" (fun a b -> a,b) in\n    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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s621263854", "group_id": "codeNet:p03773", "input_text": "let rt a b = (a + b) mod 24\n  \nlet _ =\n  Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\\n\" rt\n", "language": "OCaml", "metadata": {"date": 1490577082, "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/s621263854.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621263854", "user_id": "u388783188"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let rt a b = (a + b) mod 24\n  \nlet _ =\n  Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\\n\" rt\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s491701392", "group_id": "codeNet:p03774", "input_text": "let read_array n = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun x y -> x, y))\n\nlet md (x1, y1) (x2, y2) = abs (x1 - x2) + abs (y1 - y2)\n\nlet ans n m ab cd =\n  let rec solve i =\n    if i < n then\n      let abi = ab.(i) in\n      let rec f j d ret =\n        if j = m then ret\n        else\n          let t = md abi cd.(j) in\n          if t < d then f (j + 1) t (j + 1)\n          else f (j + 1) d ret\n      in (Printf.printf \"%d\\n\" (f 0 1000000000 0); solve (i + 1))\n  in solve 0\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let ab = read_array n\n  and cd = read_array m in\n  ans n m ab cd\n", "language": "OCaml", "metadata": {"date": 1585934377, "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/s491701392.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491701392", "user_id": "u752907799"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "let read_array n = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun x y -> x, y))\n\nlet md (x1, y1) (x2, y2) = abs (x1 - x2) + abs (y1 - y2)\n\nlet ans n m ab cd =\n  let rec solve i =\n    if i < n then\n      let abi = ab.(i) in\n      let rec f j d ret =\n        if j = m then ret\n        else\n          let t = md abi cd.(j) in\n          if t < d then f (j + 1) t (j + 1)\n          else f (j + 1) d ret\n      in (Printf.printf \"%d\\n\" (f 0 1000000000 0); solve (i + 1))\n  in solve 0\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let ab = read_array n\n  and cd = read_array m in\n  ans n m ab cd\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "sample_input": "2 2\n2 0\n0 0\n-1 0\n1 0\n"}, "reference_outputs": ["2\n1\n"], "source_document_id": "p03774", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s596896670", "group_id": "codeNet:p03775", "input_text": "open Printf open Scanf\nmodule Lib = struct\n\tlet i32,i64,ist = Int64.(to_int,of_int,to_string)\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n\tlet labs = Int64.abs\n\tlet (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n\tlet (+=) r v = r := !r + v\n\tlet (-=) r v = r := !r - v\n\tlet ( *= ) r v = r := !r * v\n\tlet (/=) r v = r := !r / v\n\tlet (%=) r v = r := !r % v\n\t(* math *)\n\tlet ceildiv p q = (p+q-1L) / q\n\tlet rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n\tlet lcm m n = m / gcd m n * n \n\tmodule I64_infix = struct\n\t\tlet (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n\t\t\tlet open Int64 in\n\t\t\t(logand),(logor),(logxor),lognot,\n\t\t\t(fun u v -> shift_left u (i32 v)),\n\t\t\t(fun u v -> shift_right u (i32 v)),\n\t\t\t(fun u v -> shift_right_logical u (i32 v))\n\tend\n\t(* input *)\n\tlet input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v))\n\tlet get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v)\n\tlet get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v)\n\tlet get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w)\n\tlet get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x)\n\tlet get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y)\n\tlet 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\t(* utils *)\n\texternal id : 'a -> 'a = \"%identity\"\n\tlet ( *< ) f g x = f (g x)\n\tlet ( *> ) f g x = g (f x)\n\tlet rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n\tlet alen a = i64 @@ Array.length a\n\tlet llen l = i64 @@  List.length l\n\tlet string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n\tlet string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n\tlet 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\tlet string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet fail _ = failwith \"fail\"\n\tlet dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n\tlet range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n\tlet cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n\tlet shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n\tlet binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n\t\tlet rec f0 ng ok =\n\t\t\tif labs (ok - ng) <= 1L then ok\n\t\t\telse let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n\t\tin f0 (ng-1L*d) (ok+1L*d)\n\tlet lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n\tlet upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n\tlet equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n\tlet rec fix f x = f (fix f) x\n\t(* imperative *)\n\tlet rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n\tlet repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n\t\tmatch fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n\tlet repm f t ?(stride=1L) m0 fbod =\n\t\tlet i,c,m = ref f,ref true,ref m0 in\n\t\twhile !i<=t && !c do match fbod !m !i with\n\t\t| `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n\tlet repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n\tlet repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n\t\tmatch fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n\tlet repim f t ?(stride=1) m0 fbod =\n\t\tlet i,c,m = ref f,ref true,ref m0 in\n\t\twhile !i<=t && !c do match fbod !m !i with\n\t\t| `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n\tlet rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n\tlet repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n\tlet repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n\tlet repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n\tlet repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n\tlet repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n\t(* output *)\n\tlet print_list_mle f ls = string_of_list f ls |> print_endline\n\tlet print_array_mle f a = string_of_array f a |> print_endline\n\tlet print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n\tlet print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n\t(* debug *)\n\tlet dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n\tlet dump_i64_list ls = print_list ist ls\n\tlet dump_i64_array a = print_array ist a\nend open Lib open Array\n\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 = 0L then i::a\n\t\telse if v mod i = 0L then f0 (i+1L) (i::(v/i)::a)\n\t\telse f0 (i+1L) a in f0 1L []\nlet rec len_i64 v =\n\tlet rec f0 v = if v=0L then 0L else if v<=9L then 1L else 1L+f0 (v/10L)\n\tin f0 (labs v)\nlet () =\n\tlet n = get_i64 0 in\n\tlet d = divisors n in\n\tprintf \"%Ld\\n\" @@ List.fold_left (fun u v -> \n\t\tlet w = n / v in\n\t\tlet p = max (len_i64 v) (len_i64 w) in min u p\n\t) Int64.max_int d\n\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1541404660, "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/s596896670.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s596896670", "user_id": "u481480055"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf open Scanf\nmodule Lib = struct\n\tlet i32,i64,ist = Int64.(to_int,of_int,to_string)\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n\tlet labs = Int64.abs\n\tlet (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n\tlet (+=) r v = r := !r + v\n\tlet (-=) r v = r := !r - v\n\tlet ( *= ) r v = r := !r * v\n\tlet (/=) r v = r := !r / v\n\tlet (%=) r v = r := !r % v\n\t(* math *)\n\tlet ceildiv p q = (p+q-1L) / q\n\tlet rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n\tlet lcm m n = m / gcd m n * n \n\tmodule I64_infix = struct\n\t\tlet (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n\t\t\tlet open Int64 in\n\t\t\t(logand),(logor),(logxor),lognot,\n\t\t\t(fun u v -> shift_left u (i32 v)),\n\t\t\t(fun u v -> shift_right u (i32 v)),\n\t\t\t(fun u v -> shift_right_logical u (i32 v))\n\tend\n\t(* input *)\n\tlet input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v))\n\tlet get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v)\n\tlet get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v)\n\tlet get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w)\n\tlet get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x)\n\tlet get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y)\n\tlet 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\t(* utils *)\n\texternal id : 'a -> 'a = \"%identity\"\n\tlet ( *< ) f g x = f (g x)\n\tlet ( *> ) f g x = g (f x)\n\tlet rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n\tlet alen a = i64 @@ Array.length a\n\tlet llen l = i64 @@  List.length l\n\tlet string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n\tlet string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n\tlet 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\tlet string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet fail _ = failwith \"fail\"\n\tlet dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n\tlet range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n\tlet cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n\tlet shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n\tlet binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n\t\tlet rec f0 ng ok =\n\t\t\tif labs (ok - ng) <= 1L then ok\n\t\t\telse let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n\t\tin f0 (ng-1L*d) (ok+1L*d)\n\tlet lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n\tlet upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n\tlet equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n\tlet rec fix f x = f (fix f) x\n\t(* imperative *)\n\tlet rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n\tlet repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n\t\tmatch fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n\tlet repm f t ?(stride=1L) m0 fbod =\n\t\tlet i,c,m = ref f,ref true,ref m0 in\n\t\twhile !i<=t && !c do match fbod !m !i with\n\t\t| `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n\tlet repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n\tlet repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n\t\tmatch fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n\tlet repim f t ?(stride=1) m0 fbod =\n\t\tlet i,c,m = ref f,ref true,ref m0 in\n\t\twhile !i<=t && !c do match fbod !m !i with\n\t\t| `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n\tlet rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n\tlet repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n\tlet repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n\tlet repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n\tlet repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n\tlet repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n\t(* output *)\n\tlet print_list_mle f ls = string_of_list f ls |> print_endline\n\tlet print_array_mle f a = string_of_array f a |> print_endline\n\tlet print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n\tlet print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n\t(* debug *)\n\tlet dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n\tlet dump_i64_list ls = print_list ist ls\n\tlet dump_i64_array a = print_array ist a\nend open Lib open Array\n\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 = 0L then i::a\n\t\telse if v mod i = 0L then f0 (i+1L) (i::(v/i)::a)\n\t\telse f0 (i+1L) a in f0 1L []\nlet rec len_i64 v =\n\tlet rec f0 v = if v=0L then 0L else if v<=9L then 1L else 1L+f0 (v/10L)\n\tin f0 (labs v)\nlet () =\n\tlet n = get_i64 0 in\n\tlet d = divisors n in\n\tprintf \"%Ld\\n\" @@ List.fold_left (fun u v -> \n\t\tlet w = n / v in\n\t\tlet p = max (len_i64 v) (len_i64 w) in min u p\n\t) Int64.max_int d\n\n\n\n\n\n\n\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5554, "cpu_time_ms": 4, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676750135", "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 k = ref (b + 1)\nlet _ = Array.(iteri (fun i v -> if a <= i && i < !k && v < m then k := 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 (sub vs a (b - a + 1) |> fold_left (fun a v -> if v = vs.(!k) then a + 1 else a) 0))", "language": "OCaml", "metadata": {"date": 1583414510, "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/s676750135.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676750135", "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 k = ref (b + 1)\nlet _ = Array.(iteri (fun i v -> if a <= i && i < !k && v < m then k := 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 (sub vs a (b - a + 1) |> fold_left (fun a v -> if v = vs.(!k) then a + 1 else a) 0))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s149125326", "group_id": "codeNet:p03777", "input_text": "Scanf.scanf \"%c %c\" @@ fun a b -> Printf.printf \"%c\\n\" @@ if a = 'H' then b else if b = 'H' then 'D' else 'H'", "language": "OCaml", "metadata": {"date": 1577870989, "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/s149125326.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s149125326", "user_id": "u732304692"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "Scanf.scanf \"%c %c\" @@ fun a b -> Printf.printf \"%c\\n\" @@ if a = 'H' then b else if b = 'H' then 'D' else 'H'", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "sample_input": "H H\n"}, "reference_outputs": ["H\n"], "source_document_id": "p03777", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s314330333", "group_id": "codeNet:p03777", "input_text": "let () =\n  let s1, s2 = Scanf.scanf \"%s %s \" (fun a b -> a, b) in\n  Printf.printf \"%s\\n\" (if s1 = s2 then \"H\" else \"D\")", "language": "OCaml", "metadata": {"date": 1526216082, "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/s314330333.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314330333", "user_id": "u139013163"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "let () =\n  let s1, s2 = Scanf.scanf \"%s %s \" (fun a b -> a, b) in\n  Printf.printf \"%s\\n\" (if s1 = s2 then \"H\" else \"D\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "sample_input": "H H\n"}, "reference_outputs": ["H\n"], "source_document_id": "p03777", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s501208299", "group_id": "codeNet:p03777", "input_text": "let () =\n  Scanf.scanf \"%c %c\" (fun a b ->\n      match a with\n      | 'H' -> b\n      | _ -> if b = 'H' then 'D' else 'H')\n  |> Printf.printf \"%c\\n\"", "language": "OCaml", "metadata": {"date": 1522117241, "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/s501208299.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501208299", "user_id": "u987869509"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%c %c\" (fun a b ->\n      match a with\n      | 'H' -> b\n      | _ -> if b = 'H' then 'D' else '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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s085379510", "group_id": "codeNet:p03778", "input_text": "Scanf.scanf \"%d %d %d\" (fun w a b ->\n    let a, b = min a b, max a b in\n    Printf.printf \"%d\\n\" @@ max 0 (b - a - w)\n)", "language": "OCaml", "metadata": {"date": 1600660381, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s085379510.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085379510", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun w a b ->\n    let a, b = min a b, max a b in\n    Printf.printf \"%d\\n\" @@ max 0 (b - a - 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s146428397", "group_id": "codeNet:p03778", "input_text": "let w, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ if a + w < b then b - a - w else if b + w < a then a - b - w else 0", "language": "OCaml", "metadata": {"date": 1564929218, "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/s146428397.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146428397", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let w, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ if a + w < b then b - a - w else if b + w < a then a - b - w else 0", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "sample_input": "3 2 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03778", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517957873", "group_id": "codeNet:p03779", "input_text": "let x = read_int ()\nlet s, i = ref 0, ref 1\nlet _ = while !s < x do s := !s + !i; incr i done; Printf.printf \"%d\\n\" @@ !i - 1", "language": "OCaml", "metadata": {"date": 1568934865, "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/s517957873.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517957873", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let x = read_int ()\nlet s, i = ref 0, ref 1\nlet _ = while !s < x do s := !s + !i; incr i done; Printf.printf \"%d\\n\" @@ !i - 1", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s947175255", "group_id": "codeNet:p03779", "input_text": "2.*.read_float()|>sqrt|>Printf.printf\"%.f\"", "language": "OCaml", "metadata": {"date": 1540427802, "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/s947175255.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947175255", "user_id": "u481480055"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "2.*.read_float()|>sqrt|>Printf.printf\"%.f\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 42, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s214301282", "group_id": "codeNet:p03779", "input_text": "let id x = x\nlet x = Scanf.scanf \"%d\" id\n\nlet rec func x i =\n  if i = x then i else\n    if x - i > i then func (x-i) (i+1) else x\n    \nlet ans = func x 1\n\nlet () = Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1489887367, "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/s214301282.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s214301282", "user_id": "u735499035"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let id x = x\nlet x = Scanf.scanf \"%d\" id\n\nlet rec func x i =\n  if i = x then i else\n    if x - i > i then func (x-i) (i+1) else x\n    \nlet ans = func x 1\n\nlet () = Printf.printf \"%d\\n\" ans\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s632900358", "group_id": "codeNet:p03779", "input_text": "let id x = x\nlet xa = Scanf.scanf \"%d\\n\" id\n\nlet x = if xa < 0 then xa * (-1) else xa\n\nlet rec func x i =\n  if i = x then i else\n    if x - i > i then func (x-i) (i+1) else x\n    \nlet ans = func x 1\n\nlet () = Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1489887030, "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/s632900358.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s632900358", "user_id": "u735499035"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let id x = x\nlet xa = Scanf.scanf \"%d\\n\" id\n\nlet x = if xa < 0 then xa * (-1) else xa\n\nlet rec func x i =\n  if i = x then i else\n    if x - i > i then func (x-i) (i+1) else x\n    \nlet ans = func x 1\n\nlet () = Printf.printf \"%d\\n\" ans\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s651249254", "group_id": "codeNet:p03780", "input_text": "let read_int_array n = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n\nlet ans n k a =\n  let rec solve i sum ret =\n    if i = n then ret\n    else if sum + a.(i) < k then solve (i + 1) (sum + a.(i)) (ret + 1)\n    else solve (i + 1) sum 0\n  in solve 0 0 0\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\" (fun n k -> n, k) in\n  let a = read_int_array n in\n  Array.sort (fun x y -> - x + y) a;\n  print_int (ans n k a)\n", "language": "OCaml", "metadata": {"date": 1585932965, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03780.html", "problem_id": "p03780", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03780/input.txt", "sample_output_relpath": "derived/input_output/data/p03780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03780/OCaml/s651249254.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651249254", "user_id": "u752907799"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let read_int_array n = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n\nlet ans n k a =\n  let rec solve i sum ret =\n    if i = n then ret\n    else if sum + a.(i) < k then solve (i + 1) (sum + a.(i)) (ret + 1)\n    else solve (i + 1) sum 0\n  in solve 0 0 0\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\" (fun n k -> n, k) in\n  let a = read_int_array n in\n  Array.sort (fun x y -> - x + y) a;\n  print_int (ans n k a)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03780", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 4, "memory_kb": 1792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751328938", "group_id": "codeNet:p03780", "input_text": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) a;\n\n  let dp = Array.make k false in\n  let rec loop l r =\n    if l >= r then r else\n    let m = (l+r) / 2 in\n    let x = a.(m) in\n    Array.fill dp 0 k false; dp.(0) <- true;\n\n    a |> Array.iteri (fun i v -> \n      if i = m then () else\n      for j = k-1 downto v do\n        dp.(j) <- dp.(j) || dp.(j-v)\n      done);\n\n    Array.init (min k x) (fun i -> dp.(k-1-i))\n    |> Array.fold_left (||) false\n    |> fun b -> if b then loop l m else loop (m+1) r\n  in\n\n  loop 0 n |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1532052194, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03780.html", "problem_id": "p03780", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03780/input.txt", "sample_output_relpath": "derived/input_output/data/p03780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03780/OCaml/s751328938.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751328938", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\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  Array.sort (-) a;\n\n  let dp = Array.make k false in\n  let rec loop l r =\n    if l >= r then r else\n    let m = (l+r) / 2 in\n    let x = a.(m) in\n    Array.fill dp 0 k false; dp.(0) <- true;\n\n    a |> Array.iteri (fun i v -> \n      if i = m then () else\n      for j = k-1 downto v do\n        dp.(j) <- dp.(j) || dp.(j-v)\n      done);\n\n    Array.init (min k x) (fun i -> dp.(k-1-i))\n    |> Array.fold_left (||) false\n    |> fun b -> if b then loop l m else loop (m+1) r\n  in\n\n  loop 0 n |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03780", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 619, "cpu_time_ms": 584, "memory_kb": 4096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s524695603", "group_id": "codeNet:p03785", "input_text": "Scanf.scanf \"%d %d %d\" (fun n c k ->\n    let t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun t -> t )) in\n    Array.sort compare t;\n    \n    let rec loop i cur pop buses =\n        if i = n then (if pop > 0 then buses + 1 else buses) else\n            let tt = t.(i) in\n            if tt <= cur + k then (\n                if pop < c then loop (i + 1) cur (pop + 1) buses else\n                                loop (i + 1) tt  1 (buses + 1)\n            ) else (\n                let buses = if pop > 0 then buses + 1 else buses in\n                loop (i + 1) tt 1 buses\n            )\n    in\n    loop 0 0 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1596598418, "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/s524695603.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s524695603", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n c k ->\n    let t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun t -> t )) in\n    Array.sort compare t;\n    \n    let rec loop i cur pop buses =\n        if i = n then (if pop > 0 then buses + 1 else buses) else\n            let tt = t.(i) in\n            if tt <= cur + k then (\n                if pop < c then loop (i + 1) cur (pop + 1) buses else\n                                loop (i + 1) tt  1 (buses + 1)\n            ) else (\n                let buses = if pop > 0 then buses + 1 else buses in\n                loop (i + 1) tt 1 buses\n            )\n    in\n    loop 0 0 0 0 |> Printf.printf \"%d\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 65, "memory_kb": 6628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s674481563", "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": 1560419002, "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/s674481563.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s674481563", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 64, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380825358", "group_id": "codeNet:p03786", "input_text": "let n, s, l = read_int (), ref 0, ref 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.sort (-) a_s; for i = 0 to n - 2 do s := !s + a_s.(i); if a_s.(i + 1) > 2 * !s then l := i + 1 done; Printf.printf \"%d\\n\" @@ n - !l", "language": "OCaml", "metadata": {"date": 1581511876, "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/s380825358.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380825358", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, s, l = read_int (), ref 0, ref 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.sort (-) a_s; for i = 0 to n - 2 do s := !s + a_s.(i); if a_s.(i + 1) > 2 * !s then l := i + 1 done; Printf.printf \"%d\\n\" @@ n - !l", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "sample_input": "3\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03786", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 65, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s357891517", "group_id": "codeNet:p03786", "input_text": "let n, ans, s = read_int (), ref 0, ref 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.(sort (-) a_s; iteri (fun i a -> s := !s + a; if i = n - 1 || a_s.(i + 1) <= 2 * !s then incr ans else ans := 0) a_s); Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1578867409, "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/s357891517.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357891517", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, ans, s = read_int (), ref 0, ref 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Array.(sort (-) a_s; iteri (fun i a -> s := !s + a; if i = n - 1 || a_s.(i + 1) <= 2 * !s then incr ans else ans := 0) a_s); Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "sample_input": "3\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03786", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 65, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s322186732", "group_id": "codeNet:p03796", "input_text": "Array.(init (read_int ()) succ |> fold_left (fun p n -> p * n mod 1000000007) 1) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1579132579, "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/s322186732.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s322186732", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Array.(init (read_int ()) succ |> fold_left (fun p n -> p * n mod 1000000007) 1) |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s259146678", "group_id": "codeNet:p03796", "input_text": "let n = read_int ()\nlet ans = ref 1\nlet _ = for i = 1 to n do ans := !ans * i mod 1000000007 done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562496954, "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/s259146678.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s259146678", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let n = read_int ()\nlet ans = ref 1\nlet _ = for i = 1 to n do ans := !ans * i mod 1000000007 done; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s763354645", "group_id": "codeNet:p03796", "input_text": "let n = read_int () in\nlet p = ref 1 in\nlet ( * ) a b = a * b mod 1_000_000_007 in\nfor i = 1 to n do\n  p := !p * i\ndone;\nPrintf.printf \"%d\\n\" !p", "language": "OCaml", "metadata": {"date": 1559533405, "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/s763354645.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763354645", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let n = read_int () in\nlet p = ref 1 in\nlet ( * ) a b = a * b mod 1_000_000_007 in\nfor i = 1 to n do\n  p := !p * i\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s349392354", "group_id": "codeNet:p03796", "input_text": "let rec solve n =\n    match n with\n    1 -> 1\n    | n -> (n * (solve (n - 1))) mod 1000000007;;\n\nlet () =\n    let n = read_int () in\n    print_int (solve n);\n    print_newline ();;\n\n", "language": "OCaml", "metadata": {"date": 1543637525, "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/s349392354.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349392354", "user_id": "u280512618"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let rec solve n =\n    match n with\n    1 -> 1\n    | n -> (n * (solve (n - 1))) mod 1000000007;;\n\nlet () =\n    let n = read_int () in\n    print_int (solve n);\n    print_newline ();;\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 3, "memory_kb": 1920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s503268158", "group_id": "codeNet:p03796", "input_text": "let n = read_int ()\nlet m = int_of_float (10. ** 9. +. 7.)\n\nlet fact n =\n  let rec f i n' = \n    if i = 1 then n' mod m else f (i - 1) (i mod m * n' mod m)\n  in \n  f n 1\n\nlet () = Printf.printf \"%d\\n\" (fact n)", "language": "OCaml", "metadata": {"date": 1522130518, "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/s503268158.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s503268158", "user_id": "u987869509"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let n = read_int ()\nlet m = int_of_float (10. ** 9. +. 7.)\n\nlet fact n =\n  let rec f i n' = \n    if i = 1 then n' mod m else f (i - 1) (i mod m * n' mod m)\n  in \n  f n 1\n\nlet () = Printf.printf \"%d\\n\" (fact 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s269392657", "group_id": "codeNet:p03797", "input_text": "let get_2_ints () = Scanf.scanf \"%d %d \" (fun u v -> u,v)\n\nlet () =\n  let (s,c) = get_2_ints ()\n  in\n  (\n    let c_left = c-s*2 in\n    if c_left >= 0 then (\n      s + c_left / 4\n    )else(\n      let s_true = c / 2\n      in s_true\n    )\n  )\n  |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1530782515, "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/s269392657.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269392657", "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 (s,c) = get_2_ints ()\n  in\n  (\n    let c_left = c-s*2 in\n    if c_left >= 0 then (\n      s + c_left / 4\n    )else(\n      let s_true = c / 2\n      in s_true\n    )\n  )\n  |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s199526711", "group_id": "codeNet:p03797", "input_text": "let n, m = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet () =\n  let a = min n (m / 2) in\n  let b = (m - 2 * a) / 4 in\n  Printf.printf \"%d\\n\" (a+b)", "language": "OCaml", "metadata": {"date": 1527971897, "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/s199526711.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199526711", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, m = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet () =\n  let a = min n (m / 2) in\n  let b = (m - 2 * a) / 4 in\n  Printf.printf \"%d\\n\" (a+b)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03797", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 142, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s664497092", "group_id": "codeNet:p03799", "input_text": "let () = Scanf.scanf \"%d %d\" (fun n m ->\n  Printf.printf \"%d\\n\"\n    (if m < 2 * n then m / 2 else (2 * n + m) / 4))\n", "language": "OCaml", "metadata": {"date": 1487470520, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03799.html", "problem_id": "p03799", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03799/input.txt", "sample_output_relpath": "derived/input_output/data/p03799/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03799/OCaml/s664497092.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664497092", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" (fun n m ->\n  Printf.printf \"%d\\n\"\n    (if m < 2 * n then m / 2 else (2 * n + m) / 4))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03799", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s633163842", "group_id": "codeNet:p03803", "input_text": "let split_on_char sep (s : string) =\n    let rec rindex (i: int) =\n        if i < 0 then\n            None\n        else\n            if s.[i] = sep then\n                Some i\n            else\n                rindex (i - 1) in\n    let rec loop i result =\n        match rindex (i - 1) with\n          Some ii -> loop ii (String.sub s (ii + 1) (i - 1 - ii) :: result)\n        | None -> (String.sub s 0 i) :: result in\n    loop (String.length s) []\n\nlet ord s = \n    match int_of_string s with\n            1 -> 14\n        |   n -> n\n\nlet main =\n    let a = read_line () in\n    let x = split_on_char ' ' a in \n      let v = match x with\n        [a; b] ->\n      (match compare (ord a) (ord b) with\n        1 -> \"Alice\"\n        | 0 -> \"Draw\"\n        | -1 -> \"Bob\" )\n        | _ -> \"\" in \n        print_endline v\n", "language": "OCaml", "metadata": {"date": 1572038683, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03803.html", "problem_id": "p03803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03803/input.txt", "sample_output_relpath": "derived/input_output/data/p03803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03803/OCaml/s633163842.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633163842", "user_id": "u912845774"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "let split_on_char sep (s : string) =\n    let rec rindex (i: int) =\n        if i < 0 then\n            None\n        else\n            if s.[i] = sep then\n                Some i\n            else\n                rindex (i - 1) in\n    let rec loop i result =\n        match rindex (i - 1) with\n          Some ii -> loop ii (String.sub s (ii + 1) (i - 1 - ii) :: result)\n        | None -> (String.sub s 0 i) :: result in\n    loop (String.length s) []\n\nlet ord s = \n    match int_of_string s with\n            1 -> 14\n        |   n -> n\n\nlet main =\n    let a = read_line () in\n    let x = split_on_char ' ' a in \n      let v = match x with\n        [a; b] ->\n      (match compare (ord a) (ord b) with\n        1 -> \"Alice\"\n        | 0 -> \"Draw\"\n        | -1 -> \"Bob\" )\n        | _ -> \"\" in \n        print_endline v\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "sample_input": "8 6\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03803", "source_text": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 803, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s223863355", "group_id": "codeNet:p03803", "input_text": "let () =\n  let a, b = Scanf.scanf \"%d %d \" (fun a b -> a, b) in\n  let a = if (a = 1) then 14 else a in\n  let b = if (b = 1) then 14 else b in\n  Printf.printf \"%s\\n\" \n  (if a > b then \"Bob\" else (if a = b then \"Draw\" else \"Alice\")\n  )", "language": "OCaml", "metadata": {"date": 1526215158, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03803.html", "problem_id": "p03803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03803/input.txt", "sample_output_relpath": "derived/input_output/data/p03803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03803/OCaml/s223863355.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s223863355", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "let () =\n  let a, b = Scanf.scanf \"%d %d \" (fun a b -> a, b) in\n  let a = if (a = 1) then 14 else a in\n  let b = if (b = 1) then 14 else b in\n  Printf.printf \"%s\\n\" \n  (if a > b then \"Bob\" else (if a = b then \"Draw\" else \"Alice\")\n  )", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "sample_input": "8 6\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03803", "source_text": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s387336149", "group_id": "codeNet:p03803", "input_text": "let () =\n  let a, b = Scanf.scanf \"%d %d \" (fun a b -> a, b) in\n  Printf.printf \"%s\\n\" \n  (if a > b then \"Bob\" else (if a = b then \"Draw\" else \"Alice\")\n  )", "language": "OCaml", "metadata": {"date": 1526215039, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03803.html", "problem_id": "p03803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03803/input.txt", "sample_output_relpath": "derived/input_output/data/p03803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03803/OCaml/s387336149.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s387336149", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "let () =\n  let a, b = Scanf.scanf \"%d %d \" (fun a b -> a, b) in\n  Printf.printf \"%s\\n\" \n  (if a > b then \"Bob\" else (if a = b then \"Draw\" else \"Alice\")\n  )", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "sample_input": "8 6\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03803", "source_text": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 155, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s740333184", "group_id": "codeNet:p03805", "input_text": "let n, m = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet graph = Array.init n (fun _ -> [])\nlet _ = Array.init m (fun _ -> Scanf.scanf \" %d %d\" (fun a b ->\n  graph.(a-1) <- b-1 :: graph.(a-1);\n  graph.(b-1) <- a-1 :: graph.(b-1)))\nlet visited = Array.make n false\nlet rec dfs i d =\n  if d >= n then 1 else\n    graph.(i) |> List.map (fun j ->\n      if visited.(j) then 0 else (\n        visited.(j) <- true;\n        let v = dfs j (d+1) in\n        visited.(j) <- false;\n        v\n      )\n    ) |> List.fold_left (+) 0\n\nlet () =\n  visited.(0) <- true;\n  dfs 0 1 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1527971595, "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/s740333184.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740333184", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, m = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet graph = Array.init n (fun _ -> [])\nlet _ = Array.init m (fun _ -> Scanf.scanf \" %d %d\" (fun a b ->\n  graph.(a-1) <- b-1 :: graph.(a-1);\n  graph.(b-1) <- a-1 :: graph.(b-1)))\nlet visited = Array.make n false\nlet rec dfs i d =\n  if d >= n then 1 else\n    graph.(i) |> List.map (fun j ->\n      if visited.(j) then 0 else (\n        visited.(j) <- true;\n        let v = dfs j (d+1) in\n        visited.(j) <- false;\n        v\n      )\n    ) |> List.fold_left (+) 0\n\nlet () =\n  visited.(0) <- true;\n  dfs 0 1 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected unweighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s277454744", "group_id": "codeNet:p03805", "input_text": "let scan_words () = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b))\nlet n, m = scan_words ()\nlet h = Hashtbl.create m\nlet ans = ref 0\n\nlet rec search found visited now =\n  if List.exists ((=) now) visited then ()\n  else if found = n then incr ans\n  else\n    let () = Printf.printf \"now: %d, found: %d\\n\" now found in \n    let found' = found + 1 in\n    let visited' = now :: visited in\n    match Hashtbl.find_all h now with\n    | [] -> ()\n    | next_nodes -> List.iter (search found' visited') next_nodes\n\nlet () =\n  for i = 1 to m do\n    let a, b = scan_words () in\n    Hashtbl.add h a b ;\n    Hashtbl.add h b a\n  done ;\n  search 1 [] 1 ;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1522232366, "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/s277454744.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s277454744", "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))\nlet n, m = scan_words ()\nlet h = Hashtbl.create m\nlet ans = ref 0\n\nlet rec search found visited now =\n  if List.exists ((=) now) visited then ()\n  else if found = n then incr ans\n  else\n    let () = Printf.printf \"now: %d, found: %d\\n\" now found in \n    let found' = found + 1 in\n    let visited' = now :: visited in\n    match Hashtbl.find_all h now with\n    | [] -> ()\n    | next_nodes -> List.iter (search found' visited') next_nodes\n\nlet () =\n  for i = 1 to m do\n    let a, b = scan_words () in\n    Hashtbl.add h a b ;\n    Hashtbl.add h b a\n  done ;\n  search 1 [] 1 ;\n  Printf.printf \"%d\\n\" !ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 660, "cpu_time_ms": 11, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s453726720", "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 ps = Array.make 2 0\nlet _ =\n  Array.iter (fun a -> ps.(a mod 2) <- ps.(a mod 2) + 1) a_s;\n  if ps.(1) >= 2 then (ps.(0) <- ps.(0) + 1; ps.(1) <- ps.(1) mod 2);\n  if ps.(0) >= 1 then ps.(0) <- 1;\n  print_endline @@ if ps.(0) + ps.(1) = 1 then \"YES\" else \"NO\"", "language": "OCaml", "metadata": {"date": 1560604554, "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/s453726720.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s453726720", "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 ps = Array.make 2 0\nlet _ =\n  Array.iter (fun a -> ps.(a mod 2) <- ps.(a mod 2) + 1) a_s;\n  if ps.(1) >= 2 then (ps.(0) <- ps.(0) + 1; ps.(1) <- ps.(1) mod 2);\n  if ps.(0) >= 1 then ps.(0) <- 1;\n  print_endline @@ if ps.(0) + ps.(1) = 1 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s409543208", "group_id": "codeNet:p03813", "input_text": "let () =\n\tlet x = read_int () in\n\tif x < 1200 then\n\t\tprint_endline \"ABC\"\n\telse\n\t\tprint_endline \"ARC\"\n", "language": "OCaml", "metadata": {"date": 1485655429, "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/s409543208.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409543208", "user_id": "u420267469"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let () =\n\tlet x = read_int () in\n\tif x < 1200 then\n\t\tprint_endline \"ABC\"\n\telse\n\t\tprint_endline \"ARC\"\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s231896057", "group_id": "codeNet:p03815", "input_text": "let x = read_int () in\nlet n = (x - 1) / 11 + 1 in\nprint_int (if n * 11 - 5 >= x then 2 * n - 1 else 2 * n)", "language": "OCaml", "metadata": {"date": 1585596539, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03815.html", "problem_id": "p03815", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03815/input.txt", "sample_output_relpath": "derived/input_output/data/p03815/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03815/OCaml/s231896057.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231896057", "user_id": "u752907799"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let x = read_int () in\nlet n = (x - 1) / 11 + 1 in\nprint_int (if n * 11 - 5 >= x then 2 * n - 1 else 2 * 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": "p03815", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 107, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s888418883", "group_id": "codeNet:p03815", "input_text": "let x = read_int ()\n\nlet () =\n  (match x mod 11 with\n   | 0 -> (x / 11 * 2)\n   | n when n <= 5 -> (x / 11) * 2 + 1\n   | _ -> (x / 11) * 2 + 2)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1522291835, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03815.html", "problem_id": "p03815", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03815/input.txt", "sample_output_relpath": "derived/input_output/data/p03815/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03815/OCaml/s888418883.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s888418883", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let x = read_int ()\n\nlet () =\n  (match x mod 11 with\n   | 0 -> (x / 11 * 2)\n   | n when n <= 5 -> (x / 11) * 2 + 1\n   | _ -> (x / 11) * 2 + 2)\n  |> Printf.printf \"%d\\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": "p03815", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s475684050", "group_id": "codeNet:p03817", "input_text": "let solve n = if n < 7 then 1 else\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": 1487910175, "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/s475684050.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s475684050", "user_id": "u980152513"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let solve n = if n < 7 then 1 else\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s366818601", "group_id": "codeNet:p03827", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let cs = Batteries.String.to_list s in\n  let is = List.map (fun x -> if x = 'I' then 1 else -1) cs in\n\n  let rec f last res = function\n    | [] -> res\n    | hd :: tl -> \n      f (last+hd) ((last+hd)::res) tl\n  in\n  let max = (f 0 [] (0::is) |> List.sort compare |> List.rev |> List.hd) in\n  Printf.printf \"%d\\n\" max\n\n", "language": "OCaml", "metadata": {"date": 1528726859, "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/s366818601.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s366818601", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let cs = Batteries.String.to_list s in\n  let is = List.map (fun x -> if x = 'I' then 1 else -1) cs in\n\n  let rec f last res = function\n    | [] -> res\n    | hd :: tl -> \n      f (last+hd) ((last+hd)::res) tl\n  in\n  let max = (f 0 [] (0::is) |> List.sort compare |> List.rev |> List.hd) in\n  Printf.printf \"%d\\n\" max\n\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s069170550", "group_id": "codeNet:p03829", "input_text": "let ans, p = ref 0, ref 0\nlet _ = Scanf.scanf \"%d %d %d\" @@ fun n a b -> for i = 1 to n do Scanf.scanf \" %d\" @@ fun x -> if i > 1 then ans := !ans + min b (a * (x - !p)); p := x done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1580126698, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03829.html", "problem_id": "p03829", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03829/input.txt", "sample_output_relpath": "derived/input_output/data/p03829/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03829/OCaml/s069170550.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069170550", "user_id": "u732304692"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let ans, p = ref 0, ref 0\nlet _ = Scanf.scanf \"%d %d %d\" @@ fun n a b -> for i = 1 to n do Scanf.scanf \" %d\" @@ fun x -> if i > 1 then ans := !ans + min b (a * (x - !p)); p := x done; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a line running east-west.\nThe towns are numbered 1 through N, in order from west to east.\nEach point on the line has a one-dimensional coordinate, and a point that is farther east has a greater coordinate value.\nThe coordinate of town i is X_i.\n\nYou are now at town 1, and you want to visit all the other towns.\nYou have two ways to travel:\n\nWalk on the line.\nYour fatigue level increases by A each time you travel a distance of 1, regardless of direction.\n\nTeleport to any location of your choice.\nYour fatigue level increases by B, regardless of the distance covered.\n\nFind the minimum possible total increase of your fatigue level when you visit all the towns in these two ways.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤10^5\n\n1≤X_i≤10^9\n\nFor all i(1≤i≤N-1), X_i<X_{i+1}.\n\n1≤A≤10^9\n\n1≤B≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum possible total increase of your fatigue level when you visit all the towns.\n\nSample Input 1\n\n4 2 5\n1 2 5 7\n\nSample Output 1\n\n11\n\nFrom town 1, walk a distance of 1 to town 2, then teleport to town 3, then walk a distance of 2 to town 4.\nThe total increase of your fatigue level in this case is 2×1+5+2×2=11, which is the minimum possible value.\n\nSample Input 2\n\n7 1 100\n40 43 45 105 108 115 124\n\nSample Output 2\n\n84\n\nFrom town 1, walk all the way to town 7.\nThe total increase of your fatigue level in this case is 84, which is the minimum possible value.\n\nSample Input 3\n\n7 1 2\n24 35 40 68 72 99 103\n\nSample Output 3\n\n12\n\nVisit all the towns in any order by teleporting six times.\nThe total increase of your fatigue level in this case is 12, which is the minimum possible value.", "sample_input": "4 2 5\n1 2 5 7\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03829", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a line running east-west.\nThe towns are numbered 1 through N, in order from west to east.\nEach point on the line has a one-dimensional coordinate, and a point that is farther east has a greater coordinate value.\nThe coordinate of town i is X_i.\n\nYou are now at town 1, and you want to visit all the other towns.\nYou have two ways to travel:\n\nWalk on the line.\nYour fatigue level increases by A each time you travel a distance of 1, regardless of direction.\n\nTeleport to any location of your choice.\nYour fatigue level increases by B, regardless of the distance covered.\n\nFind the minimum possible total increase of your fatigue level when you visit all the towns in these two ways.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤10^5\n\n1≤X_i≤10^9\n\nFor all i(1≤i≤N-1), X_i<X_{i+1}.\n\n1≤A≤10^9\n\n1≤B≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum possible total increase of your fatigue level when you visit all the towns.\n\nSample Input 1\n\n4 2 5\n1 2 5 7\n\nSample Output 1\n\n11\n\nFrom town 1, walk a distance of 1 to town 2, then teleport to town 3, then walk a distance of 2 to town 4.\nThe total increase of your fatigue level in this case is 2×1+5+2×2=11, which is the minimum possible value.\n\nSample Input 2\n\n7 1 100\n40 43 45 105 108 115 124\n\nSample Output 2\n\n84\n\nFrom town 1, walk all the way to town 7.\nThe total increase of your fatigue level in this case is 84, which is the minimum possible value.\n\nSample Input 3\n\n7 1 2\n24 35 40 68 72 99 103\n\nSample Output 3\n\n12\n\nVisit all the towns in any order by teleporting six times.\nThe total increase of your fatigue level in this case is 12, which is the minimum possible value.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 31, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s409797953", "group_id": "codeNet:p03834", "input_text": "let () =\n  String.iter\n    (fun c -> if c = ',' then print_string \" \" else print_char c)\n    (read_line ());\n  print_newline ();", "language": "OCaml", "metadata": {"date": 1527160410, "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/s409797953.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409797953", "user_id": "u987869509"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "let () =\n  String.iter\n    (fun c -> if c = ',' then print_string \" \" else print_char c)\n    (read_line ());\n  print_newline ();", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s366601588", "group_id": "codeNet:p03836", "input_text": "let dx, dy = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> c - a, d - b\nlet f n c = print_string @@ String.make n c\nlet _ = f dy 'U'; f dx 'R'; f dy 'D'; f dx 'L';\n  f 1 'L'; f (dy + 1) 'U'; f (dx + 1) 'R'; f 1 'D'; f 1 'R'; f (dy + 1) 'D'; f (dx + 1) 'L'; f 1 'U'", "language": "OCaml", "metadata": {"date": 1569840444, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/OCaml/s366601588.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s366601588", "user_id": "u732304692"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "let dx, dy = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> c - a, d - b\nlet f n c = print_string @@ String.make n c\nlet _ = f dy 'U'; f dx 'R'; f dy 'D'; f dx 'L';\n  f 1 'L'; f (dy + 1) 'U'; f (dx + 1) 'R'; f 1 'D'; f 1 'R'; f (dy + 1) 'D'; f (dx + 1) 'L'; f 1 'U'", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 263, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s977495900", "group_id": "codeNet:p03838", "input_text": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" @@ fun x y ->\n  [x,y,0; -x,y,1; x,-y,1; -x,-y,2] |> List.fold_left (fun z (x,y,s) ->\n    if x > y then z else min z (y-x+s)) 101010101010", "language": "OCaml", "metadata": {"date": 1534473010, "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/s977495900.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s977495900", "user_id": "u798181098"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" @@ fun x y ->\n  [x,y,0; -x,y,1; x,-y,1; -x,-y,2] |> List.fold_left (fun z (x,y,s) ->\n    if x > y then z else min z (y-x+s)) 101010101010", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "sample_input": "10 20\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03838", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s737015020", "group_id": "codeNet:p03838", "input_text": "let rec calc x y =\n  if x <= y then\n    if x * y <= 0 then min (y-x) (y+x+1) else y-x\n  else if x * y >= 0 then 1 + calc (-x) y\n  else 1 + abs (abs x - abs y)\n\nlet _ = Scanf.scanf \"%d %d\" @@ calc |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1534471360, "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/s737015020.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s737015020", "user_id": "u798181098"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec calc x y =\n  if x <= y then\n    if x * y <= 0 then min (y-x) (y+x+1) else y-x\n  else if x * y >= 0 then 1 + calc (-x) y\n  else 1 + abs (abs x - abs y)\n\nlet _ = Scanf.scanf \"%d %d\" @@ calc |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 148, "memory_kb": 262528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s707315588", "group_id": "codeNet:p03838", "input_text": "let rec calc x y =\n  if x <= y then\n    if x * y < 0 && -x <= y then y - (-x) + 1\n    else y - x\n  else if abs y <= abs x then 1 + calc (-x) y\n  else if x < 0 then 1 + calc (-x) y\n  else - y - x + 1\n\nlet _ = Scanf.scanf \"%d %d\" @@ calc |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1534467685, "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/s707315588.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s707315588", "user_id": "u798181098"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec calc x y =\n  if x <= y then\n    if x * y < 0 && -x <= y then y - (-x) + 1\n    else y - x\n  else if abs y <= abs x then 1 + calc (-x) y\n  else if x < 0 then 1 + calc (-x) y\n  else - y - x + 1\n\nlet _ = Scanf.scanf \"%d %d\" @@ calc |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s738804583", "group_id": "codeNet:p03840", "input_text": "Scanf.scanf \"%d %d %d %d %d %d %d\" (fun ai ao at aj al as_ az ->\n    let k = ao               in let ao = ao - ao in\n    let k = k + (ai / 2) * 2 in let ai = ai - (ai / 2) * 2 in\n    let k = k + (aj / 2) * 2 in let aj = aj - (aj / 2) * 2 in\n    let k = k + (al / 2) * 2 in let al = al - (al / 2) * 2 in\n    let k = if ai * aj * al = 1 then k + 3 else k in\n    Printf.printf \"%d\\n\" k\n)", "language": "OCaml", "metadata": {"date": 1588744043, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03840.html", "problem_id": "p03840", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03840/input.txt", "sample_output_relpath": "derived/input_output/data/p03840/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03840/OCaml/s738804583.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s738804583", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d %d %d %d\" (fun ai ao at aj al as_ az ->\n    let k = ao               in let ao = ao - ao in\n    let k = k + (ai / 2) * 2 in let ai = ai - (ai / 2) * 2 in\n    let k = k + (aj / 2) * 2 in let aj = aj - (aj / 2) * 2 in\n    let k = k + (al / 2) * 2 in let al = al - (al / 2) * 2 in\n    let k = if ai * aj * al = 1 then k + 3 else k in\n    Printf.printf \"%d\\n\" k\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "sample_input": "2 1 1 0 0 0 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03840", "source_text": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 384, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s649558721", "group_id": "codeNet:p03840", "input_text": "let () = Scanf.scanf \"%d %d %d %d %d %d %d\" @@ fun ai ao at aj al as_ az ->\n  Printf.printf \"%d\\n\" @@ ao + max\n    ((ai land (-2)) + (aj land (-2)) + (al land (-2)))\n    ( if ai <= 0 || aj <= 0 || al <= 0\n      then min_int\n      else ((ai - 1) land (-2)) + ((aj - 1) land (-2)) + ((al - 1) land (-2)) + 3 )\n", "language": "OCaml", "metadata": {"date": 1536557238, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03840.html", "problem_id": "p03840", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03840/input.txt", "sample_output_relpath": "derived/input_output/data/p03840/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03840/OCaml/s649558721.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649558721", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d %d %d %d\" @@ fun ai ao at aj al as_ az ->\n  Printf.printf \"%d\\n\" @@ ao + max\n    ((ai land (-2)) + (aj land (-2)) + (al land (-2)))\n    ( if ai <= 0 || aj <= 0 || al <= 0\n      then min_int\n      else ((ai - 1) land (-2)) + ((aj - 1) land (-2)) + ((al - 1) land (-2)) + 3 )\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "sample_input": "2 1 1 0 0 0 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03840", "source_text": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s420909810", "group_id": "codeNet:p03844", "input_text": "let () = \n  Scanf.scanf \"%d %c %d\" (fun a op b ->\n      if op = '+' then a + b else a - b)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1527327372, "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/s420909810.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s420909810", "user_id": "u987869509"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = \n  Scanf.scanf \"%d %c %d\" (fun a op b ->\n      if op = '+' then a + b else a - b)\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s499838365", "group_id": "codeNet:p03852", "input_text": "open Printf\nopen Scanf\n\nlet solve c =\n  let ls = ['a'; 'e'; 'i'; 'o'; 'u'] in\n  if List.mem c ls then \"vowel\" else \"consonant\"\n\nlet () =\n  scanf \"%c \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1583273805, "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/s499838365.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499838365", "user_id": "u388783188"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve c =\n  let ls = ['a'; 'e'; 'i'; 'o'; 'u'] in\n  if List.mem c ls then \"vowel\" else \"consonant\"\n\nlet () =\n  scanf \"%c \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "sample_input": "a\n"}, "reference_outputs": ["vowel\n"], "source_document_id": "p03852", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s860094954", "group_id": "codeNet:p03852", "input_text": "let c = read_line ()\nlet _ = print_endline @@ if String.contains \"aeiou\" c.[0] then \"vowel\" else \"consonant\"", "language": "OCaml", "metadata": {"date": 1562510367, "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/s860094954.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860094954", "user_id": "u732304692"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "let c = read_line ()\nlet _ = print_endline @@ if String.contains \"aeiou\" c.[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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s917408570", "group_id": "codeNet:p03852", "input_text": "let () =\n  (match read_line () with\n   | \"a\" | \"e\" | \"i\" | \"o\" | \"u\" -> \"vowel\"\n   | _ -> \"consonant\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1522658512, "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/s917408570.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s917408570", "user_id": "u987869509"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "let () =\n  (match read_line () with\n   | \"a\" | \"e\" | \"i\" | \"o\" | \"u\" -> \"vowel\"\n   | _ -> \"consonant\")\n  |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "sample_input": "a\n"}, "reference_outputs": ["vowel\n"], "source_document_id": "p03852", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s906397152", "group_id": "codeNet:p03852", "input_text": "let _ =\n\tread_line ()\n\t|> (fun n -> [\"a\";\"i\";\"u\";\"e\";\"o\"]\n\t\t\t|> List.map (fun x -> x = n)\n\t\t\t|> List.fold_left (fun x y -> x || y) false)\n\t|> (fun p ->\n\t\tif p\n\t\tthen print_string \"vowel\"\n\t\telse print_string \"constant\"\n\t\t)\n", "language": "OCaml", "metadata": {"date": 1481428534, "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/s906397152.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s906397152", "user_id": "u604818425"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "let _ =\n\tread_line ()\n\t|> (fun n -> [\"a\";\"i\";\"u\";\"e\";\"o\"]\n\t\t\t|> List.map (fun x -> x = n)\n\t\t\t|> List.fold_left (fun x y -> x || y) false)\n\t|> (fun p ->\n\t\tif p\n\t\tthen print_string \"vowel\"\n\t\telse print_string \"constant\"\n\t\t)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "sample_input": "a\n"}, "reference_outputs": ["vowel\n"], "source_document_id": "p03852", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s491878112", "group_id": "codeNet:p03853", "input_text": "let () =\n  Scanf.scanf \"%d %d\" (fun h _ -> Array.init h (fun _ -> Scanf.scanf \" %s\" (fun s -> s)))\n  |> Array.iter (fun r -> Printf.printf \"%s\\n%s\\n\" r r)\n", "language": "OCaml", "metadata": {"date": 1519721910, "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/s491878112.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491878112", "user_id": "u798181098"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" (fun h _ -> Array.init h (fun _ -> Scanf.scanf \" %s\" (fun s -> s)))\n  |> Array.iter (fun r -> Printf.printf \"%s\\n%s\\n\" r r)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s952175135", "group_id": "codeNet:p03853", "input_text": "let h, w = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet () =\n  for i = 1 to h do\n    let s = Scanf.scanf \"%s\\n\" (fun a -> a) in \n    print_endline s; print_endline s\n  done", "language": "OCaml", "metadata": {"date": 1483034507, "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/s952175135.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952175135", "user_id": "u098968285"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "let h, w = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet () =\n  for i = 1 to h do\n    let s = Scanf.scanf \"%s\\n\" (fun a -> a) in \n    print_endline s; print_endline s\n  done", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "sample_input": "2 2\n*.\n.*\n"}, "reference_outputs": ["*.\n*.\n.*\n.*\n"], "source_document_id": "p03853", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s579629638", "group_id": "codeNet:p03857", "input_text": "(* persistent array *)\nmodule PArray : sig\n  type 'a t\n\n  val init : int -> (int -> 'a) -> 'a t\n  val make : int -> 'a -> 'a t\n  val of_list : 'a list -> 'a t\n  val get : 'a t -> int -> 'a\n  val set : 'a t -> int -> 'a -> 'a t\n  (** [set a n x] returns a persistent array replacing element number [n] of [a] with [x].\n     [a] is *not* modified. *)\n  val length : 'a t -> int\n  val to_list : 'a t -> 'a list\n  val iter : ('a -> unit) -> 'a t -> unit\n  val iteri : (int -> 'a -> unit) -> 'a t -> unit\n  val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a\n  val fold_right : ('b -> 'a -> 'a) -> 'b t -> 'a -> 'a\nend = struct\n  type 'a t = 'a data ref\n  and 'a data = Arr of 'a array | Diff of int * 'a * 'a t\n\n  let init n f = ref (Arr (Array.init n f))\n  let make n v = ref (Arr (Array.make n v))\n  let of_list l = ref (Arr (Array.of_list l))\n\n  let rec reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (i, v, t') } as t ->\n        reroot (fun a ->\n          t' := Diff (i, a.(i), t);\n          a.(i) <- v;\n          k a) t'\n  let reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (_, _, _) } as t ->\n        reroot (fun a -> t := Arr a; k a) t\n\n  let rec get t i = reroot (fun a -> a.(i)) t\n\n  let set t i v =\n    reroot (fun a ->\n      if v = a.(i) then t\n      else begin\n        let result = ref (Arr a) in\n        t := Diff (i, a.(i), result);\n        a.(i) <- v;\n        result\n      end) t\n\n  let length t = reroot Array.length t\n  let to_list t = reroot Array.to_list t\n  let iter f = reroot (Array.iter f)\n  let iteri f = reroot (Array.iteri f)\n  let fold_left f x = reroot (Array.fold_left f x)\n  let fold_right f t x = reroot (fun a -> Array.fold_right f a x) t\nend\n\n(* persistent union-find data structure *)\nmodule PUnionFind : sig\n  type t\n  type class_\n\n  val make : int -> t\n  val find : t -> int -> class_\n  val union : t -> int -> int -> t\nend = struct\n  type t = { rank : int PArray.t; mutable parent : int PArray.t }\n  type class_ = int\n\n  let make n = { rank = PArray.make n 0; parent = PArray.init n (fun i -> i) }\n\n  let rec find parent i k =\n    let j = PArray.get parent i in\n    if i = j then k parent i\n    else find parent j (fun parent r -> k (PArray.set parent i r) r)\n  let find ({ parent } as h) i = find parent i (fun parent r ->\n    h.parent <- parent;\n    r)\n\n  let union uf x y =\n    let cx = find uf x in\n    let cy = find uf y in\n    if cx = cy then uf\n    else begin\n      let rx = PArray.get uf.rank x in\n      let ry = PArray.get uf.rank y in\n      match compare rx ry with\n      | -1 -> { uf with parent = PArray.set uf.parent cx cy }\n      | 1 -> { uf with parent = PArray.set uf.parent cy cx }\n      | 0 -> { rank = PArray.set uf.rank cx (cx + 1); parent = PArray.set uf.parent cy cx }\n    end\nend\n\nmodule SqClassMap = Map.Make (struct\n  type t = PUnionFind.class_ * PUnionFind.class_\n  let compare = compare\nend)\n\nlet () =\n  let n, k, l = Scanf.scanf \"%d %d %d\\n\" (fun n k l -> n, k, l) in\n  let pqs = Array.init k (fun _ -> Scanf.scanf \"%d %d\\n\" (fun p q -> p - 1, q - 1)) in\n  let rss = Array.init l (fun _ -> Scanf.scanf \"%d %d\\n\" (fun r s -> r - 1, s - 1)) in\n  let ufpq = Array.fold_left (fun u (p, q) -> PUnionFind.union u p q) (PUnionFind.make n) pqs in\n  let ufrs = Array.fold_left (fun u (r, s) -> PUnionFind.union u r s) (PUnionFind.make n) rss in\n  Array.init n (fun i -> (i, (PUnionFind.find ufpq i, PUnionFind.find ufrs i)))\n  |> Array.fold_left (fun m (i, key) ->\n      SqClassMap.add key (i :: try SqClassMap.find key m with Not_found -> []) m) SqClassMap.empty\n  |> SqClassMap.bindings\n  |> List.map (fun (_, xs) -> let n = List.length xs in List.map (fun x -> (x, n)) xs)\n  |> List.concat\n  |> List.sort (fun (i, _) (j, _) -> compare i j)\n  |> List.map snd\n  |> List.iter (Printf.printf \"%d \")", "language": "OCaml", "metadata": {"date": 1510529715, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03857.html", "problem_id": "p03857", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03857/input.txt", "sample_output_relpath": "derived/input_output/data/p03857/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03857/OCaml/s579629638.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579629638", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 2 2 1\n", "input_to_evaluate": "(* persistent array *)\nmodule PArray : sig\n  type 'a t\n\n  val init : int -> (int -> 'a) -> 'a t\n  val make : int -> 'a -> 'a t\n  val of_list : 'a list -> 'a t\n  val get : 'a t -> int -> 'a\n  val set : 'a t -> int -> 'a -> 'a t\n  (** [set a n x] returns a persistent array replacing element number [n] of [a] with [x].\n     [a] is *not* modified. *)\n  val length : 'a t -> int\n  val to_list : 'a t -> 'a list\n  val iter : ('a -> unit) -> 'a t -> unit\n  val iteri : (int -> 'a -> unit) -> 'a t -> unit\n  val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a\n  val fold_right : ('b -> 'a -> 'a) -> 'b t -> 'a -> 'a\nend = struct\n  type 'a t = 'a data ref\n  and 'a data = Arr of 'a array | Diff of int * 'a * 'a t\n\n  let init n f = ref (Arr (Array.init n f))\n  let make n v = ref (Arr (Array.make n v))\n  let of_list l = ref (Arr (Array.of_list l))\n\n  let rec reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (i, v, t') } as t ->\n        reroot (fun a ->\n          t' := Diff (i, a.(i), t);\n          a.(i) <- v;\n          k a) t'\n  let reroot k = function\n    | { contents = Arr a } -> k a\n    | { contents = Diff (_, _, _) } as t ->\n        reroot (fun a -> t := Arr a; k a) t\n\n  let rec get t i = reroot (fun a -> a.(i)) t\n\n  let set t i v =\n    reroot (fun a ->\n      if v = a.(i) then t\n      else begin\n        let result = ref (Arr a) in\n        t := Diff (i, a.(i), result);\n        a.(i) <- v;\n        result\n      end) t\n\n  let length t = reroot Array.length t\n  let to_list t = reroot Array.to_list t\n  let iter f = reroot (Array.iter f)\n  let iteri f = reroot (Array.iteri f)\n  let fold_left f x = reroot (Array.fold_left f x)\n  let fold_right f t x = reroot (fun a -> Array.fold_right f a x) t\nend\n\n(* persistent union-find data structure *)\nmodule PUnionFind : sig\n  type t\n  type class_\n\n  val make : int -> t\n  val find : t -> int -> class_\n  val union : t -> int -> int -> t\nend = struct\n  type t = { rank : int PArray.t; mutable parent : int PArray.t }\n  type class_ = int\n\n  let make n = { rank = PArray.make n 0; parent = PArray.init n (fun i -> i) }\n\n  let rec find parent i k =\n    let j = PArray.get parent i in\n    if i = j then k parent i\n    else find parent j (fun parent r -> k (PArray.set parent i r) r)\n  let find ({ parent } as h) i = find parent i (fun parent r ->\n    h.parent <- parent;\n    r)\n\n  let union uf x y =\n    let cx = find uf x in\n    let cy = find uf y in\n    if cx = cy then uf\n    else begin\n      let rx = PArray.get uf.rank x in\n      let ry = PArray.get uf.rank y in\n      match compare rx ry with\n      | -1 -> { uf with parent = PArray.set uf.parent cx cy }\n      | 1 -> { uf with parent = PArray.set uf.parent cy cx }\n      | 0 -> { rank = PArray.set uf.rank cx (cx + 1); parent = PArray.set uf.parent cy cx }\n    end\nend\n\nmodule SqClassMap = Map.Make (struct\n  type t = PUnionFind.class_ * PUnionFind.class_\n  let compare = compare\nend)\n\nlet () =\n  let n, k, l = Scanf.scanf \"%d %d %d\\n\" (fun n k l -> n, k, l) in\n  let pqs = Array.init k (fun _ -> Scanf.scanf \"%d %d\\n\" (fun p q -> p - 1, q - 1)) in\n  let rss = Array.init l (fun _ -> Scanf.scanf \"%d %d\\n\" (fun r s -> r - 1, s - 1)) in\n  let ufpq = Array.fold_left (fun u (p, q) -> PUnionFind.union u p q) (PUnionFind.make n) pqs in\n  let ufrs = Array.fold_left (fun u (r, s) -> PUnionFind.union u r s) (PUnionFind.make n) rss in\n  Array.init n (fun i -> (i, (PUnionFind.find ufpq i, PUnionFind.find ufrs i)))\n  |> Array.fold_left (fun m (i, key) ->\n      SqClassMap.add key (i :: try SqClassMap.find key m with Not_found -> []) m) SqClassMap.empty\n  |> SqClassMap.bindings\n  |> List.map (fun (_, xs) -> let n = List.length xs in List.map (fun x -> (x, n)) xs)\n  |> List.concat\n  |> List.sort (fun (i, _) (j, _) -> compare i j)\n  |> List.map snd\n  |> List.iter (Printf.printf \"%d \")", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "sample_input": "4 3 1\n1 2\n2 3\n3 4\n2 3\n"}, "reference_outputs": ["1 2 2 1\n"], "source_document_id": "p03857", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3812, "cpu_time_ms": 757, "memory_kb": 55740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s805768553", "group_id": "codeNet:p03860", "input_text": "open Scanf\nopen Printf\n\nlet () = scanf \"%s %s %s\" (fun s1 s2 s3 ->\n  \"A\" ^ String.sub s2 0 1 ^ \"C\"\n  ) |> printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1595995310, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s805768553.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805768553", "user_id": "u272377260"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () = scanf \"%s %s %s\" (fun s1 s2 s3 ->\n  \"A\" ^ String.sub s2 0 1 ^ \"C\"\n  ) |> printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s565918076", "group_id": "codeNet:p03860", "input_text": "open Batteries\n(* charのlistをstringに *)\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 _ = Scanf.sscanf (read_line()) \"%s %s %s\" (fun s1 s2 s3 ->\n  [s1.[0]; s2.[0]; s3.[0]]\n) |> string_of_chars |> String.uppercase_ascii |> print_endline", "language": "OCaml", "metadata": {"date": 1584367003, "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/s565918076.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565918076", "user_id": "u511870776"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "open Batteries\n(* charのlistをstringに *)\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 _ = Scanf.sscanf (read_line()) \"%s %s %s\" (fun s1 s2 s3 ->\n  [s1.[0]; s2.[0]; s3.[0]]\n) |> string_of_chars |> String.uppercase_ascii |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s998772633", "group_id": "codeNet:p03860", "input_text": "let () = Scanf.scanf \"AtCoder %s Contest\" @@ fun s ->\n  Printf.printf \"A%cC\\n\" s.[0]\n", "language": "OCaml", "metadata": {"date": 1530678439, "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/s998772633.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s998772633", "user_id": "u504158101"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let () = Scanf.scanf \"AtCoder %s Contest\" @@ fun s ->\n  Printf.printf \"A%cC\\n\" s.[0]\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s492244681", "group_id": "codeNet:p03860", "input_text": "open Batteries\n\nlet solve a b x = Enum.filter (fun i -> i mod x = 0) (a---b) |> Enum.count\nlet () =\n  let [a; b; x] = read_line ()\n                  |> String.nsplit ~by:\" \"\n                  |> List.map int_of_string in\n  solve a b x |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1480909282, "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/s492244681.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s492244681", "user_id": "u702189202"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "open Batteries\n\nlet solve a b x = Enum.filter (fun i -> i mod x = 0) (a---b) |> Enum.count\nlet () =\n  let [a; b; x] = read_line ()\n                  |> String.nsplit ~by:\" \"\n                  |> List.map int_of_string in\n  solve a b x |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s964398916", "group_id": "codeNet:p03861", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b x ->\n    let ans = if a = 0 then b / x + 1 else b / x - (a - 1) / x in\n    Printf.printf \"%d\\n\" ans\n)", "language": "OCaml", "metadata": {"date": 1592968288, "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/s964398916.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s964398916", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b x ->\n    let ans = if a = 0 then b / x + 1 else b / x - (a - 1) / x in\n    Printf.printf \"%d\\n\" ans\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s970990407", "group_id": "codeNet:p03861", "input_text": "let solve a b x =\n\t(b / x + 1) - ((a - 1) / x + 1)\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": 1480910336, "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/s970990407.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s970990407", "user_id": "u420267469"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let solve a b x =\n\t(b / x + 1) - ((a - 1) / x + 1)\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s900853301", "group_id": "codeNet:p03864", "input_text": "let () =\n  let n, x = Scanf.scanf \"%d %d\\n\" (fun n x -> n, x) in\n  let a :: as_ = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  List.fold_left (fun (prev, acc) a ->\n    let cost = max 0 (prev + a - x) in\n    (max 0 (a - cost), cost + acc)) (a, 0) as_\n  |> snd\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1510530362, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03864.html", "problem_id": "p03864", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03864/input.txt", "sample_output_relpath": "derived/input_output/data/p03864/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03864/OCaml/s900853301.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900853301", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  let n, x = Scanf.scanf \"%d %d\\n\" (fun n x -> n, x) in\n  let a :: as_ = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  List.fold_left (fun (prev, acc) a ->\n    let cost = max 0 (prev + a - x) in\n    (max 0 (a - cost), cost + acc)) (a, 0) as_\n  |> snd\n  |> Printf.printf \"%d\\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": "p03864", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N boxes arranged in a row.\nInitially, the i-th box from the left contains a_i candies.\n\nSnuke can perform the following operation any number of times:\n\nChoose a box containing at least one candy, and eat one of the candies in the chosen box.\n\nHis objective is as follows:\n\nAny two neighboring boxes contain at most x candies in total.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ a_i ≤ 10^9\n\n0 ≤ x ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3 3\n2 2 2\n\nSample Output 1\n\n1\n\nEat one candy in the second box.\nThen, the number of candies in each box becomes (2, 1, 2).\n\nSample Input 2\n\n6 1\n1 6 1 2 0 4\n\nSample Output 2\n\n11\n\nFor example, eat six candies in the second box, two in the fourth box, and three in the sixth box.\nThen, the number of candies in each box becomes (1, 0, 1, 0, 0, 1).\n\nSample Input 3\n\n5 9\n3 1 4 1 5\n\nSample Output 3\n\n0\n\nThe objective is already achieved without performing operations.\n\nSample Input 4\n\n2 0\n5 5\n\nSample Output 4\n\n10\n\nAll the candies need to be eaten.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 38, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s092222435", "group_id": "codeNet:p03880", "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 as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n  Array.to_list as_\n  |> List.map (fun a -> a lxor (a - 1))\n  |> List.sort_uniq compare\n  |> List.fold_left (fun m a ->\n      IntMap.fold (fun x n m ->\n        IntMap.add (x lxor a)\n          (min (1 + n) @@\n            try IntMap.find (x lxor a) m\n            with Not_found -> max_int) m) m m)\n    (IntMap.singleton (Array.fold_left ( lxor ) 0 as_) 0)\n  |> fun m ->\n      Printf.printf \"%d\\n\" @@\n        try IntMap.find 0 m with Not_found -> -1\n", "language": "OCaml", "metadata": {"date": 1535943814, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03880.html", "problem_id": "p03880", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03880/input.txt", "sample_output_relpath": "derived/input_output/data/p03880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03880/OCaml/s092222435.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s092222435", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\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 as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n  Array.to_list as_\n  |> List.map (fun a -> a lxor (a - 1))\n  |> List.sort_uniq compare\n  |> List.fold_left (fun m a ->\n      IntMap.fold (fun x n m ->\n        IntMap.add (x lxor a)\n          (min (1 + n) @@\n            try IntMap.find (x lxor a) m\n            with Not_found -> max_int) m) m m)\n    (IntMap.singleton (Array.fold_left ( lxor ) 0 as_) 0)\n  |> fun m ->\n      Printf.printf \"%d\\n\" @@\n        try IntMap.find 0 m with Not_found -> -1\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nA cheetah and a cheater are going to play the game of Nim.\nIn this game they use N piles of stones.\nInitially the i-th pile contains a_i stones.\nThe players take turns alternately, and the cheetah plays first.\nIn each turn, the player chooses one of the piles, and takes one or more stones from the pile.\nThe player who can't make a move loses.\n\nHowever, before the game starts, the cheater wants to cheat a bit to make sure that he can win regardless of the moves by the cheetah.\nFrom each pile, the cheater takes zero or one stone and eats it before the game.\nIn case there are multiple ways to guarantee his winning, he wants to minimize the number of stones he eats.\n\nCompute the number of stones the cheater will eat.\nIn case there is no way for the cheater to win the game even with the cheating, print -1 instead.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ a_i ≤ 10^9\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 answer.\n\nSample Input 1\n\n3\n2\n3\n4\n\nSample Output 1\n\n3\n\nThe only way for the cheater to win the game is to take stones from all piles and eat them.\n\nSample Input 2\n\n3\n100\n100\n100\n\nSample Output 2\n\n-1", "sample_input": "3\n2\n3\n4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03880", "source_text": "Score : 500 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nA cheetah and a cheater are going to play the game of Nim.\nIn this game they use N piles of stones.\nInitially the i-th pile contains a_i stones.\nThe players take turns alternately, and the cheetah plays first.\nIn each turn, the player chooses one of the piles, and takes one or more stones from the pile.\nThe player who can't make a move loses.\n\nHowever, before the game starts, the cheater wants to cheat a bit to make sure that he can win regardless of the moves by the cheetah.\nFrom each pile, the cheater takes zero or one stone and eats it before the game.\nIn case there are multiple ways to guarantee his winning, he wants to minimize the number of stones he eats.\n\nCompute the number of stones the cheater will eat.\nIn case there is no way for the cheater to win the game even with the cheating, print -1 instead.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ a_i ≤ 10^9\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 answer.\n\nSample Input 1\n\n3\n2\n3\n4\n\nSample Output 1\n\n3\n\nThe only way for the cheater to win the game is to take stones from all piles and eat them.\n\nSample Input 2\n\n3\n100\n100\n100\n\nSample Output 2\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 638, "cpu_time_ms": 2107, "memory_kb": 114748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s892736897", "group_id": "codeNet:p03888", "input_text": "open Printf\nopen Scanf\n\nlet solve r1 r2 = r1 *. r2 /. (r1 +. r2)\n\nlet () =\n  scanf \"%f %f \" solve |> printf \"%.10f\\n\"\n", "language": "OCaml", "metadata": {"date": 1594837844, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03888.html", "problem_id": "p03888", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03888/input.txt", "sample_output_relpath": "derived/input_output/data/p03888/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03888/OCaml/s892736897.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892736897", "user_id": "u388783188"}, "prompt_components": {"gold_output": "1.2000000000\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve r1 r2 = r1 *. r2 /. (r1 +. r2)\n\nlet () =\n  scanf \"%f %f \" solve |> printf \"%.10f\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn an electric circuit, when two resistors R_1 and R_2 are connected in parallel, the equivalent resistance R_3 can be derived from the following formula:\n\n\\frac{1}{R_1} + \\frac{1}{R_2} = \\frac{1}{R_3}\n\nGiven R_1 and R_2, find R_3.\n\nConstraints\n\n1 \\leq R_1, R_2 \\leq 100\n\nR_1 and R_2 are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nR_1 R_2\n\nOutput\n\nPrint the value of R_3.\n\nThe output is considered correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n1.2000000000\n\nSample Input 2\n\n100 99\n\nSample Output 2\n\n49.7487437186", "sample_input": "2 3\n"}, "reference_outputs": ["1.2000000000\n"], "source_document_id": "p03888", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn an electric circuit, when two resistors R_1 and R_2 are connected in parallel, the equivalent resistance R_3 can be derived from the following formula:\n\n\\frac{1}{R_1} + \\frac{1}{R_2} = \\frac{1}{R_3}\n\nGiven R_1 and R_2, find R_3.\n\nConstraints\n\n1 \\leq R_1, R_2 \\leq 100\n\nR_1 and R_2 are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nR_1 R_2\n\nOutput\n\nPrint the value of R_3.\n\nThe output is considered correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n1.2000000000\n\nSample Input 2\n\n100 99\n\nSample Output 2\n\n49.7487437186", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s691080603", "group_id": "codeNet:p03888", "input_text": "let r1, r2 = Scanf.scanf \" %f %f\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%.10f\\n\" @@ r1 *. r2 /. (r1 +. r2)", "language": "OCaml", "metadata": {"date": 1566235260, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03888.html", "problem_id": "p03888", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03888/input.txt", "sample_output_relpath": "derived/input_output/data/p03888/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03888/OCaml/s691080603.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s691080603", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1.2000000000\n", "input_to_evaluate": "let r1, r2 = Scanf.scanf \" %f %f\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%.10f\\n\" @@ r1 *. r2 /. (r1 +. r2)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn an electric circuit, when two resistors R_1 and R_2 are connected in parallel, the equivalent resistance R_3 can be derived from the following formula:\n\n\\frac{1}{R_1} + \\frac{1}{R_2} = \\frac{1}{R_3}\n\nGiven R_1 and R_2, find R_3.\n\nConstraints\n\n1 \\leq R_1, R_2 \\leq 100\n\nR_1 and R_2 are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nR_1 R_2\n\nOutput\n\nPrint the value of R_3.\n\nThe output is considered correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n1.2000000000\n\nSample Input 2\n\n100 99\n\nSample Output 2\n\n49.7487437186", "sample_input": "2 3\n"}, "reference_outputs": ["1.2000000000\n"], "source_document_id": "p03888", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn an electric circuit, when two resistors R_1 and R_2 are connected in parallel, the equivalent resistance R_3 can be derived from the following formula:\n\n\\frac{1}{R_1} + \\frac{1}{R_2} = \\frac{1}{R_3}\n\nGiven R_1 and R_2, find R_3.\n\nConstraints\n\n1 \\leq R_1, R_2 \\leq 100\n\nR_1 and R_2 are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nR_1 R_2\n\nOutput\n\nPrint the value of R_3.\n\nThe output is considered correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n1.2000000000\n\nSample Input 2\n\n100 99\n\nSample Output 2\n\n49.7487437186", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s757860236", "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\" @@ function '#' -> 1 | _ -> 0) = h + w - 1 then \"Possible\" else \"Impossible\")", "language": "OCaml", "metadata": {"date": 1576767873, "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/s757860236.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s757860236", "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\" @@ function '#' -> 1 | _ -> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s489693654", "group_id": "codeNet:p03943", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let (a,b,c) = scanf \" %d %d %d\" (fun x y z -> (x,y,z)) in\n  if a + b == c || b + c == a || c + a == b\n  then print_endline \"Yes\"\n  else print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1570850549, "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/s489693654.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s489693654", "user_id": "u806601169"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let (a,b,c) = scanf \" %d %d %d\" (fun x y z -> (x,y,z)) in\n  if a + b == c || b + c == a || c + a == b\n  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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s617111858", "group_id": "codeNet:p03943", "input_text": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = print_endline @@ if a + b = c || b + c = a || c + a = b then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1565187218, "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/s617111858.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s617111858", "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 _ = print_endline @@ if a + b = c || b + c = a || c + a = b 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s383203576", "group_id": "codeNet:p03943", "input_text": "let () = Scanf.scanf \"%d %d %d\"\n(fun a b c -> a+b==c || a==b+c || c+a==b)\n|> (fun a -> if a then \"Yes\" else \"No\")\n|> Printf.printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1560993203, "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/s383203576.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s383203576", "user_id": "u635974378"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\"\n(fun a b c -> a+b==c || a==b+c || c+a==b)\n|> (fun a -> if a then \"Yes\" else \"No\")\n|> Printf.printf \"%s\\n\"\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s217822459", "group_id": "codeNet:p03944", "input_text": "(* O(n) *)\nScanf.scanf \" %d %d %d\" @@ fun w h n ->\n  let left = ref 0 in\n  let right = ref w in\n  let down = ref 0 in\n  let up = ref h in\n  for i = 1 to n do\n    Scanf.scanf \" %d %d %d\" @@ fun x y -> function\n    | 1 -> left := max !left x\n    | 2 -> right := min !right x\n    | 3 -> down := max !down y\n    | 4 -> up := min !up y\n    | _ -> assert false\n  done;\n  let w2 = max 0 @@ !right - !left in\n  let h2 = max 0 @@ !up - !down in\n  Printf.printf \"%d\\n\" @@ w2 * h2", "language": "OCaml", "metadata": {"date": 1559213671, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03944.html", "problem_id": "p03944", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03944/input.txt", "sample_output_relpath": "derived/input_output/data/p03944/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03944/OCaml/s217822459.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s217822459", "user_id": "u732304692"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(* O(n) *)\nScanf.scanf \" %d %d %d\" @@ fun w h n ->\n  let left = ref 0 in\n  let right = ref w in\n  let down = ref 0 in\n  let up = ref h in\n  for i = 1 to n do\n    Scanf.scanf \" %d %d %d\" @@ fun x y -> function\n    | 1 -> left := max !left x\n    | 2 -> right := min !right x\n    | 3 -> down := max !down y\n    | 4 -> up := min !up y\n    | _ -> assert false\n  done;\n  let w2 = max 0 @@ !right - !left in\n  let h2 = max 0 @@ !up - !down in\n  Printf.printf \"%d\\n\" @@ w2 * h2", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "sample_input": "5 4 2\n2 1 1\n3 3 4\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03944", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 469, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s432815682", "group_id": "codeNet:p03946", "input_text": "Scanf.scanf \"%d %d\" (fun n t ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let rec loop i mi ma best count =\n        if i = n then count else\n            if a.(i) < mi then loop (i + 1) a.(i) ma best count else\n                if a.(i) - mi = best then loop (i + 1) mi ma best (count + 1) else\n                    if a.(i) > ma then loop (i + 1) mi a.(i) (a.(i) - mi) 1 else\n                        loop (i + 1) mi ma best count\n    in\n    loop 0 1_000_000_000 0 (-1) 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1587769873, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03946.html", "problem_id": "p03946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03946/input.txt", "sample_output_relpath": "derived/input_output/data/p03946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03946/OCaml/s432815682.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s432815682", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n t ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let rec loop i mi ma best count =\n        if i = n then count else\n            if a.(i) < mi then loop (i + 1) a.(i) ma best count else\n                if a.(i) - mi = best then loop (i + 1) mi ma best (count + 1) else\n                    if a.(i) > ma then loop (i + 1) mi a.(i) (a.(i) - mi) 1 else\n                        loop (i + 1) mi ma best count\n    in\n    loop 0 1_000_000_000 0 (-1) 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "sample_input": "3 2\n100 50 200\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03946", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s503769200", "group_id": "codeNet:p03946", "input_text": "module M = Map.Make(struct type t = int let compare = (-) end)\nlet find_default k m v = try M.find k m with Not_found -> v\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n t ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n  let d = Array.fold_left (fun (d, l) e -> (max d (e-l), min e l)) (0, a.(0)) a |> fst in\n  a |> Array.fold_left (fun (z, m) v ->\n    let p = find_default (v-d) m 0 in\n    let c = find_default v m 0 in\n    (z+p, M.add v (c+1) m)) (0, M.empty)\n  |> fst |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531979741, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03946.html", "problem_id": "p03946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03946/input.txt", "sample_output_relpath": "derived/input_output/data/p03946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03946/OCaml/s503769200.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s503769200", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module M = Map.Make(struct type t = int let compare = (-) end)\nlet find_default k m v = try M.find k m with Not_found -> v\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n t ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n  let d = Array.fold_left (fun (d, l) e -> (max d (e-l), min e l)) (0, a.(0)) a |> fst in\n  a |> Array.fold_left (fun (z, m) v ->\n    let p = find_default (v-d) m 0 in\n    let c = find_default v m 0 in\n    (z+p, M.add v (c+1) m)) (0, M.empty)\n  |> fst |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "sample_input": "3 2\n100 50 200\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03946", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 512, "cpu_time_ms": 136, "memory_kb": 11904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s519606543", "group_id": "codeNet:p03946", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n t ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let maximum = Array.make n (as_.(n - 1), n - 1) in\n  for i = n - 2 downto 0 do\n    maximum.(i) <-\n      if as_.(i) < fst maximum.(i + 1) then maximum.(i + 1)\n      else (as_.(i), i)\n  done;\n  Array.to_list as_\n  |> List.mapi (fun i a -> (fst maximum.(i) - a, snd maximum.(i)))\n  |> List.fold_left (fun (maximum, is) (d, i) ->\n      match compare d maximum with\n      | -1 -> (maximum, is)\n      | 0 ->  (d, i :: is)\n      | 1 ->  (d, [i])) (min_int, [])\n  |> snd\n  |> List.sort_uniq compare\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1530134033, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03946.html", "problem_id": "p03946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03946/input.txt", "sample_output_relpath": "derived/input_output/data/p03946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03946/OCaml/s519606543.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s519606543", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n t ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let maximum = Array.make n (as_.(n - 1), n - 1) in\n  for i = n - 2 downto 0 do\n    maximum.(i) <-\n      if as_.(i) < fst maximum.(i + 1) then maximum.(i + 1)\n      else (as_.(i), i)\n  done;\n  Array.to_list as_\n  |> List.mapi (fun i a -> (fst maximum.(i) - a, snd maximum.(i)))\n  |> List.fold_left (fun (maximum, is) (d, i) ->\n      match compare d maximum with\n      | -1 -> (maximum, is)\n      | 0 ->  (d, i :: is)\n      | 1 ->  (d, [i])) (min_int, [])\n  |> snd\n  |> List.sort_uniq compare\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "sample_input": "3 2\n100 50 200\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03946", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 68, "memory_kb": 17024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676932650", "group_id": "codeNet:p03946", "input_text": "let 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 () =\n  let n, _ = Scanf.scanf \"%d %d\\n\" (fun n t -> n, t) in\n  tabulate n (fun _ -> Scanf.scanf \"%d \" (fun a -> a))\n    |> List.fold_left (fun (acc, min, mins, maxs, pred) a ->\n        if a < pred then ((min, pred, mins, maxs) :: acc, a, 0, 0, a)\n        else (acc, min, (if a = min then mins + 1 else mins), (if a = pred then maxs + 1 else 0) , a)) ([], max_int, 0, 0, max_int)\n    |> (fun (acc, min, mins, maxs, pred) -> (min, pred, mins, maxs) :: acc)\n    |> (fun ranges ->\n        let max = List.fold_left max 0 (List.map (fun (min, pred, _, _) -> pred - min) ranges) in\n        List.filter (fun (min, pred, _, _) -> pred - min = max) ranges)\n    |> List.map (fun (_, _, mins, maxs) -> min mins maxs + 1)\n    |> List.fold_left ( + ) 0\n    |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1478489003, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03946.html", "problem_id": "p03946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03946/input.txt", "sample_output_relpath": "derived/input_output/data/p03946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03946/OCaml/s676932650.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676932650", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let 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 () =\n  let n, _ = Scanf.scanf \"%d %d\\n\" (fun n t -> n, t) in\n  tabulate n (fun _ -> Scanf.scanf \"%d \" (fun a -> a))\n    |> List.fold_left (fun (acc, min, mins, maxs, pred) a ->\n        if a < pred then ((min, pred, mins, maxs) :: acc, a, 0, 0, a)\n        else (acc, min, (if a = min then mins + 1 else mins), (if a = pred then maxs + 1 else 0) , a)) ([], max_int, 0, 0, max_int)\n    |> (fun (acc, min, mins, maxs, pred) -> (min, pred, mins, maxs) :: acc)\n    |> (fun ranges ->\n        let max = List.fold_left max 0 (List.map (fun (min, pred, _, _) -> pred - min) ranges) in\n        List.filter (fun (min, pred, _, _) -> pred - min = max) ranges)\n    |> List.map (fun (_, _, mins, maxs) -> min mins maxs + 1)\n    |> List.fold_left ( + ) 0\n    |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "sample_input": "3 2\n100 50 200\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03946", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 64, "memory_kb": 10812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s434173064", "group_id": "codeNet:p03947", "input_text": "let s = read_line ();;\n\nlet c = ref 0 in\n  for i = 1 to String.length s - 1 do\n    if s.[i] != s.[i-1] then c := !c +1\n  done;\n  print_int !c", "language": "OCaml", "metadata": {"date": 1478489103, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/OCaml/s434173064.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s434173064", "user_id": "u367021138"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let s = read_line ();;\n\nlet c = ref 0 in\n  for i = 1 to String.length s - 1 do\n    if s.[i] != s.[i-1] then c := !c +1\n  done;\n  print_int !c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 3, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s633201213", "group_id": "codeNet:p03952", "input_text": "Scanf.scanf \"%d %d\" (fun n x ->\n    let d = 2 * n - 1 in\n    let prt a b = for i = a to b do Printf.printf \"%d\\n\" i done in\n    if x = 1 || x = d then print_endline \"No\" else (\n        print_endline \"Yes\";\n        if x = n then prt 1 d else\n        if x < n then (\n            prt 1 (x - 2);\n            prt (x + 1) n;\n            prt (x - 1) x; \n            prt (n + 1) d;\n        ) else (\n            prt 1 (n - 1);\n            prt x (x + 1);\n            prt n (x - 1);\n            prt (x + 2) d;\n        )\n    )\n)", "language": "OCaml", "metadata": {"date": 1589592205, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03952.html", "problem_id": "p03952", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03952/input.txt", "sample_output_relpath": "derived/input_output/data/p03952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03952/OCaml/s633201213.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633201213", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n1\n6\n3\n7\n4\n5\n2\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n x ->\n    let d = 2 * n - 1 in\n    let prt a b = for i = a to b do Printf.printf \"%d\\n\" i done in\n    if x = 1 || x = d then print_endline \"No\" else (\n        print_endline \"Yes\";\n        if x = n then prt 1 d else\n        if x < n then (\n            prt 1 (x - 2);\n            prt (x + 1) n;\n            prt (x - 1) x; \n            prt (n + 1) d;\n        ) else (\n            prt 1 (n - 1);\n            prt x (x + 1);\n            prt n (x - 1);\n            prt (x + 2) d;\n        )\n    )\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the integer written into the block of step 1 was x.\n\nConstruct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.\n\nConstraints\n\n2≤N≤10^5\n\n1≤x≤2N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\n\nOutput\n\nIf no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print No.\n\nOtherwise, print Yes in the first line, then print 2N-1 lines in addition.\n\nThe i-th of these 2N-1 lines should contain the i-th element of a possible permutation.\n\nSample Input 1\n\n4 4\n\nSample Output 1\n\nYes\n1\n6\n3\n7\n4\n5\n2\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\nNo\n\nNo matter what permutation was written into the blocks of step N, the integer written into the block of step 1 would be 2.", "sample_input": "4 4\n"}, "reference_outputs": ["Yes\n1\n6\n3\n7\n4\n5\n2\n"], "source_document_id": "p03952", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the integer written into the block of step 1 was x.\n\nConstruct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.\n\nConstraints\n\n2≤N≤10^5\n\n1≤x≤2N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\n\nOutput\n\nIf no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print No.\n\nOtherwise, print Yes in the first line, then print 2N-1 lines in addition.\n\nThe i-th of these 2N-1 lines should contain the i-th element of a possible permutation.\n\nSample Input 1\n\n4 4\n\nSample Output 1\n\nYes\n1\n6\n3\n7\n4\n5\n2\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\nNo\n\nNo matter what permutation was written into the blocks of step N, the integer written into the block of step 1 would be 2.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 42, "memory_kb": 3840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s499251284", "group_id": "codeNet:p03952", "input_text": "let n, x = Scanf.scanf \"%d %d\" (fun x y -> x, y)\n\nlet () = print_string (if x < 3 || x > 2*n - 3 then \"No\" else \"Yes\")", "language": "OCaml", "metadata": {"date": 1477797270, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03952.html", "problem_id": "p03952", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03952/input.txt", "sample_output_relpath": "derived/input_output/data/p03952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03952/OCaml/s499251284.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s499251284", "user_id": "u367021138"}, "prompt_components": {"gold_output": "Yes\n1\n6\n3\n7\n4\n5\n2\n", "input_to_evaluate": "let n, x = Scanf.scanf \"%d %d\" (fun x y -> x, y)\n\nlet () = print_string (if x < 3 || x > 2*n - 3 then \"No\" else \"Yes\")", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the integer written into the block of step 1 was x.\n\nConstruct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.\n\nConstraints\n\n2≤N≤10^5\n\n1≤x≤2N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\n\nOutput\n\nIf no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print No.\n\nOtherwise, print Yes in the first line, then print 2N-1 lines in addition.\n\nThe i-th of these 2N-1 lines should contain the i-th element of a possible permutation.\n\nSample Input 1\n\n4 4\n\nSample Output 1\n\nYes\n1\n6\n3\n7\n4\n5\n2\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\nNo\n\nNo matter what permutation was written into the blocks of step N, the integer written into the block of step 1 would be 2.", "sample_input": "4 4\n"}, "reference_outputs": ["Yes\n1\n6\n3\n7\n4\n5\n2\n"], "source_document_id": "p03952", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the integer written into the block of step 1 was x.\n\nConstruct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.\n\nConstraints\n\n2≤N≤10^5\n\n1≤x≤2N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\n\nOutput\n\nIf no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print No.\n\nOtherwise, print Yes in the first line, then print 2N-1 lines in addition.\n\nThe i-th of these 2N-1 lines should contain the i-th element of a possible permutation.\n\nSample Input 1\n\n4 4\n\nSample Output 1\n\nYes\n1\n6\n3\n7\n4\n5\n2\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\nNo\n\nNo matter what permutation was written into the blocks of step N, the integer written into the block of step 1 would be 2.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s800868316", "group_id": "codeNet:p03954", "input_text": "let head3 lst =\n\tmatch lst with\n\t| e1 :: e2 :: e3 :: _ -> [e1; e2; e3]\n\t| _ -> []\n\nlet median [a; b; c] =\n\tlet [_; m; _] = List.sort compare [a; b; c] in m\n\nlet upstairs step =\n\tlet rec loop lst acc =\n\t\tmatch head3 lst with\n\t\t| [] -> acc\n\t\t| xs -> loop (List.tl lst) (xs :: acc)\n\tin\n\tloop step []\n\t|> List.map median\n\nlet solve step =\n\tlet rec loop step =\n\t\t(* step is never [] *)\n\t\tmatch step with\n\t\t| [_] -> step\n\t\t| _ -> loop (upstairs step)\n\tin\n\tList.hd (loop step)\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 a\n\t|> print_int\n\t|> print_newline\n", "language": "OCaml", "metadata": {"date": 1477799084, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03954.html", "problem_id": "p03954", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03954/input.txt", "sample_output_relpath": "derived/input_output/data/p03954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03954/OCaml/s800868316.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s800868316", "user_id": "u420267469"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let head3 lst =\n\tmatch lst with\n\t| e1 :: e2 :: e3 :: _ -> [e1; e2; e3]\n\t| _ -> []\n\nlet median [a; b; c] =\n\tlet [_; m; _] = List.sort compare [a; b; c] in m\n\nlet upstairs step =\n\tlet rec loop lst acc =\n\t\tmatch head3 lst with\n\t\t| [] -> acc\n\t\t| xs -> loop (List.tl lst) (xs :: acc)\n\tin\n\tloop step []\n\t|> List.map median\n\nlet solve step =\n\tlet rec loop step =\n\t\t(* step is never [] *)\n\t\tmatch step with\n\t\t| [_] -> step\n\t\t| _ -> loop (upstairs step)\n\tin\n\tList.hd (loop step)\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 a\n\t|> print_int\n\t|> print_newline\n", "problem_context": "Score : 1300 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the permutation written into the blocks of step N was (a_1, a_2, ..., a_{2N-1}).\n\nFind the integer written into the block of step 1.\n\nConstraints\n\n2≤N≤10^5\n\n(a_1, a_2, ..., a_{2N-1}) is a permutation of (1, 2, ..., 2N-1).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{2N-1}\n\nOutput\n\nPrint the integer written into the block of step 1.\n\nSample Input 1\n\n4\n1 6 3 7 4 5 2\n\nSample Output 1\n\n4\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2\n1 2 3\n\nSample Output 2\n\n2", "sample_input": "4\n1 6 3 7 4 5 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03954", "source_text": "Score : 1300 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the permutation written into the blocks of step N was (a_1, a_2, ..., a_{2N-1}).\n\nFind the integer written into the block of step 1.\n\nConstraints\n\n2≤N≤10^5\n\n(a_1, a_2, ..., a_{2N-1}) is a permutation of (1, 2, ..., 2N-1).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{2N-1}\n\nOutput\n\nPrint the integer written into the block of step 1.\n\nSample Input 1\n\n4\n1 6 3 7 4 5 2\n\nSample Output 1\n\n4\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2\n1 2 3\n\nSample Output 2\n\n2", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 633, "cpu_time_ms": 2105, "memory_kb": 59132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s482487699", "group_id": "codeNet:p03962", "input_text": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b c ->\n  if a = b && b = c then 1\n  else if a = b || a = c || b = c then 2\n  else 3\n  ) |> printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595996337, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s482487699.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482487699", "user_id": "u272377260"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b c ->\n  if a = b && b = c then 1\n  else if a = b || a = c || b = c then 2\n  else 3\n  ) |> printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 6, "memory_kb": 3784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s409892191", "group_id": "codeNet:p03962", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    Printf.printf \"%d\\n\" @@ \n    if a = b then (\n        if b = c then 1 else 2\n    ) else if a = c || b = c then 2 else 3\n)", "language": "OCaml", "metadata": {"date": 1595303118, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s409892191.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409892191", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    Printf.printf \"%d\\n\" @@ \n    if a = b then (\n        if b = c then 1 else 2\n    ) else if a = c || b = c then 2 else 3\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 6, "memory_kb": 3732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s350727826", "group_id": "codeNet:p03962", "input_text": "open Batteries\nmodule SS = Set.Make(Int)\nlet s = SS.empty\nlet s = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c ->\n  List.fold_right SS.add [a;b;c] s\n)\nlet _ = Printf.printf \"%d\\n\" (List.length @@ SS.elements s)", "language": "OCaml", "metadata": {"date": 1584367794, "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/s350727826.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s350727826", "user_id": "u511870776"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nmodule SS = Set.Make(Int)\nlet s = SS.empty\nlet s = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c ->\n  List.fold_right SS.add [a;b;c] s\n)\nlet _ = Printf.printf \"%d\\n\" (List.length @@ SS.elements s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 5, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s156940355", "group_id": "codeNet:p03963", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ Array.fold_left ( * ) k @@ Array.make (n - 1) @@ k - 1", "language": "OCaml", "metadata": {"date": 1562681291, "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/s156940355.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156940355", "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\" @@ Array.fold_left ( * ) k @@ Array.make (n - 1) @@ k - 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s055321323", "group_id": "codeNet:p03963", "input_text": "Scanf.scanf \" %d %d\" @@ fun n k ->\n  let ans = ref k in\n  for i = 2 to n do\n    ans := !ans * (k - 1)\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1559704098, "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/s055321323.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055321323", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \" %d %d\" @@ fun n k ->\n  let ans = ref k in\n  for i = 2 to n do\n    ans := !ans * (k - 1)\n  done;\n  Printf.printf \"%d\\n\" !ans", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s299579901", "group_id": "codeNet:p03963", "input_text": "let () =\n  let n,k = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n  let pow a n =\n    let rec aux res a n =\n      if n = 0 then res else aux (res*a) a (n-1)\n    in\n    aux 1 a n\n  in\n  Printf.printf \"%d\\n\" @@\n  pow (k-1) (n-1) * k\n", "language": "OCaml", "metadata": {"date": 1528721307, "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/s299579901.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s299579901", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n,k = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n  let pow a n =\n    let rec aux res a n =\n      if n = 0 then res else aux (res*a) a (n-1)\n    in\n    aux 1 a n\n  in\n  Printf.printf \"%d\\n\" @@\n  pow (k-1) (n-1) * k\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s229176422", "group_id": "codeNet:p03963", "input_text": "let rec power m n = match n with\n\t| 0 -> 1\n\t| 1 -> m\n\t| x -> m * power m (n - 1)\n\nlet solve n k = k * power (k - 1) (n - 1)\n\nlet _ =\n\tScanf.scanf \"%d %d\" (fun x y -> solve x y) |> Printf.printf \"%d\"\n", "language": "OCaml", "metadata": {"date": 1477965724, "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/s229176422.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s229176422", "user_id": "u604818425"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec power m n = match n with\n\t| 0 -> 1\n\t| 1 -> m\n\t| x -> m * power m (n - 1)\n\nlet solve n k = k * power (k - 1) (n - 1)\n\nlet _ =\n\tScanf.scanf \"%d %d\" (fun x y -> solve x y) |> Printf.printf \"%d\"\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s890342944", "group_id": "codeNet:p03964", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let tas = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun t a -> t, a in\n  let x, y =\n    Array.fold_left (fun (x, y) (t, a) ->\n      let i = (x + t - 1) / t in\n      let j = (y + a - 1) / a in\n      (t * max i j, a * max i j)) tas.(0) tas in\n  Printf.printf \"%d\\n\" @@ x + y\n", "language": "OCaml", "metadata": {"date": 1575706450, "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/s890342944.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890342944", "user_id": "u504158101"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let tas = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun t a -> t, a in\n  let x, y =\n    Array.fold_left (fun (x, y) (t, a) ->\n      let i = (x + t - 1) / t in\n      let j = (y + a - 1) / a in\n      (t * max i j, a * max i j)) tas.(0) tas in\n  Printf.printf \"%d\\n\" @@ x + y\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s145855903", "group_id": "codeNet:p03964", "input_text": "let step (a, b) (r1, r2) =\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)\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))", "language": "OCaml", "metadata": {"date": 1527926486, "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/s145855903.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s145855903", "user_id": "u798181098"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let step (a, b) (r1, r2) =\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)\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))", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s235007127", "group_id": "codeNet:p03964", "input_text": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet rec solve i sumt suma =\n  if i = 0 then (sumt + suma)\n  else\n    let t, a = Scanf.scanf \"%d %d\\n\" (fun x y -> x, y) in\n    let x = \n      if (suma / a) < (sumt / t) then\n        (if sumt mod t = 0 then sumt / t else (sumt / t) + 1)\n      else\n        (if suma mod a = 0 then suma / a else (suma / a) + 1)\n    in \n    solve (i - 1) (t * x) (a * x)\n\nlet () = solve n 1 1 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1522817592, "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/s235007127.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s235007127", "user_id": "u987869509"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet rec solve i sumt suma =\n  if i = 0 then (sumt + suma)\n  else\n    let t, a = Scanf.scanf \"%d %d\\n\" (fun x y -> x, y) in\n    let x = \n      if (suma / a) < (sumt / t) then\n        (if sumt mod t = 0 then sumt / t else (sumt / t) + 1)\n      else\n        (if suma mod a = 0 then suma / a else (suma / a) + 1)\n    in \n    solve (i - 1) (t * x) (a * x)\n\nlet () = solve n 1 1 |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 437, "cpu_time_ms": 2, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s188508900", "group_id": "codeNet:p03965", "input_text": "let ans s =\n  let n = String.length s in\n  let rec count i ret =\n    if i = n then ret\n    else if s.[i] = 'p' then count (i+1) (ret+1)\n    else count (i+1) ret in\n  let p = count 0 0\n  in n/2 - p;;\n\nScanf.scanf \"%s\" (fun s -> print_int (ans s))\n", "language": "OCaml", "metadata": {"date": 1582595691, "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/s188508900.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s188508900", "user_id": "u752907799"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let ans s =\n  let n = String.length s in\n  let rec count i ret =\n    if i = n then ret\n    else if s.[i] = 'p' then count (i+1) (ret+1)\n    else count (i+1) ret in\n  let p = count 0 0\n  in n/2 - p;;\n\nScanf.scanf \"%s\" (fun s -> print_int (ans s))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s061545458", "group_id": "codeNet:p03965", "input_text": "let s = read_line ()\nlet f s x = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet _ = Printf.printf \"%d\\n\" @@ String.length s / 2 - f s 'p'", "language": "OCaml", "metadata": {"date": 1580315565, "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/s061545458.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061545458", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let s = read_line ()\nlet f s x = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet _ = Printf.printf \"%d\\n\" @@ String.length s / 2 - f s 'p'", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s154149771", "group_id": "codeNet:p03973", "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 cur acc =\n        if i = n then acc else\n            if a.(i) = cur then loop (i + 1) (cur + 1) acc  else\n            if a.(i) < cur then loop (i + 1) cur acc else\n                loop (i + 1) cur (acc + (a.(i) - 1) / cur)\n    in\n    loop 1 2 (a.(0) - 1) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1593834260, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03973.html", "problem_id": "p03973", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03973/input.txt", "sample_output_relpath": "derived/input_output/data/p03973/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03973/OCaml/s154149771.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154149771", "user_id": "u342443598"}, "prompt_components": {"gold_output": "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\n    let rec loop i cur acc =\n        if i = n then acc else\n            if a.(i) = cur then loop (i + 1) (cur + 1) acc  else\n            if a.(i) < cur then loop (i + 1) cur acc else\n                loop (i + 1) cur (acc + (a.(i) - 1) / cur)\n    in\n    loop 1 2 (a.(0) - 1) |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN people are waiting in a single line in front of the Takahashi Store. The cash on hand of the i-th person from the front of the line is a positive integer A_i.\n\nMr. Takahashi, the shop owner, has decided on the following scheme: He picks a product, sets a positive integer P indicating its price, and shows this product to customers in order, starting from the front of the line. This step is repeated as described below.\n\nAt each step, when a product is shown to a customer, if price P is equal to or less than the cash held by that customer at the time, the customer buys the product and Mr. Takahashi ends the current step. That is, the cash held by the first customer in line with cash equal to or greater than P decreases by P, and the next step begins.\n\nMr. Takahashi can set the value of positive integer P independently at each step.\n\nHe would like to sell as many products as possible. However, if a customer were to end up with 0 cash on hand after a purchase, that person would not have the fare to go home. Customers not being able to go home would be a problem for Mr. Takahashi, so he does not want anyone to end up with 0 cash.\n\nHelp out Mr. Takahashi by writing a program that determines the maximum number of products he can sell, when the initial cash in possession of each customer is given.\n\nConstraints\n\n1 ≦ | N | ≦ 100000\n\n1 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\nAll inputs are integers.\n\nInput\n\nInputs are provided from Standard Inputs in the following form.\n\nN\nA_1\n:\nA_N\n\nOutput\n\nOutput an integer representing the maximum number of products Mr. Takahashi can sell.\n\nSample Input 1\n\n3\n3\n2\n5\n\nSample Output 1\n\n3\n\nAs values of P, select in order 1, 4, 1.\n\nSample Input 2\n\n15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 2\n\n18", "sample_input": "3\n3\n2\n5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03973", "source_text": "Score : 700 points\n\nProblem Statement\n\nN people are waiting in a single line in front of the Takahashi Store. The cash on hand of the i-th person from the front of the line is a positive integer A_i.\n\nMr. Takahashi, the shop owner, has decided on the following scheme: He picks a product, sets a positive integer P indicating its price, and shows this product to customers in order, starting from the front of the line. This step is repeated as described below.\n\nAt each step, when a product is shown to a customer, if price P is equal to or less than the cash held by that customer at the time, the customer buys the product and Mr. Takahashi ends the current step. That is, the cash held by the first customer in line with cash equal to or greater than P decreases by P, and the next step begins.\n\nMr. Takahashi can set the value of positive integer P independently at each step.\n\nHe would like to sell as many products as possible. However, if a customer were to end up with 0 cash on hand after a purchase, that person would not have the fare to go home. Customers not being able to go home would be a problem for Mr. Takahashi, so he does not want anyone to end up with 0 cash.\n\nHelp out Mr. Takahashi by writing a program that determines the maximum number of products he can sell, when the initial cash in possession of each customer is given.\n\nConstraints\n\n1 ≦ | N | ≦ 100000\n\n1 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\nAll inputs are integers.\n\nInput\n\nInputs are provided from Standard Inputs in the following form.\n\nN\nA_1\n:\nA_N\n\nOutput\n\nOutput an integer representing the maximum number of products Mr. Takahashi can sell.\n\nSample Input 1\n\n3\n3\n2\n5\n\nSample Output 1\n\n3\n\nAs values of P, select in order 1, 4, 1.\n\nSample Input 2\n\n15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 2\n\n18", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 40, "memory_kb": 6700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s736904785", "group_id": "codeNet:p03986", "input_text": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n\n    let rec loop i tame acc =\n        if i = n then acc else\n            if s.[i] = 'S' then loop (i + 1) (tame + 1) (acc + 1) else\n                if tame > 0 then loop (i + 1) (tame - 1) (acc - 1) else\n                    loop (i + 1) tame (acc + 1)\n    in\n    loop 0 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1595123985, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03986.html", "problem_id": "p03986", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03986/input.txt", "sample_output_relpath": "derived/input_output/data/p03986/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03986/OCaml/s736904785.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s736904785", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n\n    let rec loop i tame acc =\n        if i = n then acc else\n            if s.[i] = 'S' then loop (i + 1) (tame + 1) (acc + 1) else\n                if tame > 0 then loop (i + 1) (tame - 1) (acc - 1) else\n                    loop (i + 1) tame (acc + 1)\n    in\n    loop 0 0 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a string X, which has an even number of characters. Half the characters are S, and the other half are T.\n\nTakahashi, who hates the string ST, will perform the following operation 10^{10000} times:\n\nAmong the occurrences of ST in X as (contiguous) substrings, remove the leftmost one. If there is no occurrence, do nothing.\n\nFind the eventual length of X.\n\nConstraints\n\n2 ≦ |X| ≦ 200,000\n\nThe length of X is even.\n\nHalf the characters in X are S, and the other half are T.\n\nPartial Scores\n\nIn test cases worth 200 points, |X| ≦ 200.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the eventual length of X.\n\nSample Input 1\n\nTSTTSS\n\nSample Output 1\n\n4\n\nIn the 1-st operation, the 2-nd and 3-rd characters of TSTTSS are removed.\nX becomes TTSS, and since it does not contain ST anymore, nothing is done in the remaining 10^{10000}-1 operations.\nThus, the answer is 4.\n\nSample Input 2\n\nSSTTST\n\nSample Output 2\n\n0\n\nX will eventually become an empty string: SSTTST ⇒ STST ⇒ ST ⇒ ``.\n\nSample Input 3\n\nTSSTTTSS\n\nSample Output 3\n\n4\n\nX will become: TSSTTTSS ⇒ TSTTSS ⇒ TTSS.", "sample_input": "TSTTSS\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03986", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a string X, which has an even number of characters. Half the characters are S, and the other half are T.\n\nTakahashi, who hates the string ST, will perform the following operation 10^{10000} times:\n\nAmong the occurrences of ST in X as (contiguous) substrings, remove the leftmost one. If there is no occurrence, do nothing.\n\nFind the eventual length of X.\n\nConstraints\n\n2 ≦ |X| ≦ 200,000\n\nThe length of X is even.\n\nHalf the characters in X are S, and the other half are T.\n\nPartial Scores\n\nIn test cases worth 200 points, |X| ≦ 200.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the eventual length of X.\n\nSample Input 1\n\nTSTTSS\n\nSample Output 1\n\n4\n\nIn the 1-st operation, the 2-nd and 3-rd characters of TSTTSS are removed.\nX becomes TTSS, and since it does not contain ST anymore, nothing is done in the remaining 10^{10000}-1 operations.\nThus, the answer is 4.\n\nSample Input 2\n\nSSTTST\n\nSample Output 2\n\n0\n\nX will eventually become an empty string: SSTTST ⇒ STST ⇒ ST ⇒ ``.\n\nSample Input 3\n\nTSSTTTSS\n\nSample Output 3\n\n4\n\nX will become: TSSTTTSS ⇒ TSTTSS ⇒ TTSS.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 13, "memory_kb": 4492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s317607425", "group_id": "codeNet:p03988", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let d = Array.fold_left max min_int as_ in\n  let count_as = Array.make n 0 in\n  Array.iter (fun a -> count_as.(a) <- 1 + count_as.(a)) as_;\n  print_endline @@\n  if\n    2 <= count_as.(d) &&\n    Array.fold_right (fun n -> ( && ) (n = 0))\n      (Array.sub count_as 0 ((d + 1) / 2)) true &&\n    count_as.((d + 1) / 2) = 1 + d mod 2 &&\n    Array.fold_left ( && ) true\n      (Array.init (d / 2)\n        (fun i -> count_as.((d + 1) / 2 + i) <= count_as.((d + 1) / 2 + i + 1)))\n  then \"Possible\"\n  else \"Impossible\"\n", "language": "OCaml", "metadata": {"date": 1536817837, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03988.html", "problem_id": "p03988", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03988/input.txt", "sample_output_relpath": "derived/input_output/data/p03988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03988/OCaml/s317607425.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s317607425", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Possible\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  let d = Array.fold_left max min_int as_ in\n  let count_as = Array.make n 0 in\n  Array.iter (fun a -> count_as.(a) <- 1 + count_as.(a)) as_;\n  print_endline @@\n  if\n    2 <= count_as.(d) &&\n    Array.fold_right (fun n -> ( && ) (n = 0))\n      (Array.sub count_as 0 ((d + 1) / 2)) true &&\n    count_as.((d + 1) / 2) = 1 + d mod 2 &&\n    Array.fold_left ( && ) true\n      (Array.init (d / 2)\n        (fun i -> count_as.((d + 1) / 2 + i) <= count_as.((d + 1) / 2 + i + 1)))\n  then \"Possible\"\n  else \"Impossible\"\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nAoki loves numerical sequences and trees.\n\nOne day, Takahashi gave him an integer sequence of length N, a_1, a_2, ..., a_N, which made him want to construct a tree.\n\nAoki wants to construct a tree with N vertices numbered 1 through N, such that for each i = 1,2,...,N, the distance between vertex i and the farthest vertex from it is a_i, assuming that the length of each edge is 1.\n\nDetermine whether such a tree exists.\n\nConstraints\n\n2 ≦ N ≦ 100\n\n1 ≦ a_i ≦ N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf there exists a tree that satisfies the condition, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n5\n3 2 2 3 3\n\nSample Output 1\n\nPossible\n\nThe diagram above shows an example of a tree that satisfies the conditions. The red arrows show paths from each vertex to the farthest vertex from it.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n10\n1 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\nPossible\n\nSample Input 4\n\n10\n1 1 2 2 2 2 2 2 2 2\n\nSample Output 4\n\nImpossible\n\nSample Input 5\n\n6\n1 1 1 1 1 5\n\nSample Output 5\n\nImpossible\n\nSample Input 6\n\n5\n4 3 2 3 4\n\nSample Output 6\n\nPossible", "sample_input": "5\n3 2 2 3 3\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03988", "source_text": "Score : 700 points\n\nProblem Statement\n\nAoki loves numerical sequences and trees.\n\nOne day, Takahashi gave him an integer sequence of length N, a_1, a_2, ..., a_N, which made him want to construct a tree.\n\nAoki wants to construct a tree with N vertices numbered 1 through N, such that for each i = 1,2,...,N, the distance between vertex i and the farthest vertex from it is a_i, assuming that the length of each edge is 1.\n\nDetermine whether such a tree exists.\n\nConstraints\n\n2 ≦ N ≦ 100\n\n1 ≦ a_i ≦ N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf there exists a tree that satisfies the condition, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n5\n3 2 2 3 3\n\nSample Output 1\n\nPossible\n\nThe diagram above shows an example of a tree that satisfies the conditions. The red arrows show paths from each vertex to the farthest vertex from it.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n10\n1 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\nPossible\n\nSample Input 4\n\n10\n1 1 2 2 2 2 2 2 2 2\n\nSample Output 4\n\nImpossible\n\nSample Input 5\n\n6\n1 1 1 1 1 5\n\nSample Output 5\n\nImpossible\n\nSample Input 6\n\n5\n4 3 2 3 4\n\nSample Output 6\n\nPossible", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 622, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s028207216", "group_id": "codeNet:p03993", "input_text": "open Hashtbl\nlet n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun i -> Scanf.scanf \" %d\" @@ fun a -> min i @@ a - 1, max i @@ a - 1\nlet h = create n\nlet _ = Array.iteri (fun i a -> replace h a @@ try find h a + 1 with _ -> 1) a_s; fold (fun _ c s -> s + if c = 2 then 1 else 0) h 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1570116037, "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/s028207216.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s028207216", "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 i -> Scanf.scanf \" %d\" @@ fun a -> min i @@ a - 1, max i @@ a - 1\nlet h = create n\nlet _ = Array.iteri (fun i a -> replace h a @@ try find h a + 1 with _ -> 1) a_s; fold (fun _ c s -> s + if c = 2 then 1 else 0) h 0 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "sample_input": "4\n2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03993", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 60, "memory_kb": 10112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s122233780", "group_id": "codeNet:p03994", "input_text": "let s = read_line ()\nlet k = ref @@ read_int ()\nlet f c = Char.(chr @@ (code c - 97 + !k) mod 26 + 97)\nlet _ = String.(mapi (fun i c -> let d = 123 - Char.code c in if i = length s - 1 then f c else if d <= min 25 !k then (k := !k - d; 'a') else c) s) |> print_endline", "language": "OCaml", "metadata": {"date": 1571187831, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03994.html", "problem_id": "p03994", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03994/input.txt", "sample_output_relpath": "derived/input_output/data/p03994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03994/OCaml/s122233780.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s122233780", "user_id": "u732304692"}, "prompt_components": {"gold_output": "aya\n", "input_to_evaluate": "let s = read_line ()\nlet k = ref @@ read_int ()\nlet f c = Char.(chr @@ (code c - 97 + !k) mod 26 + 97)\nlet _ = String.(mapi (fun i c -> let d = 123 - Char.code c in if i = length s - 1 then f c else if d <= min 25 !k then (k := !k - d; 'a') else c) s) |> print_endline", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "sample_input": "xyz\n4\n"}, "reference_outputs": ["aya\n"], "source_document_id": "p03994", "source_text": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 268, "cpu_time_ms": 3, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s742291070", "group_id": "codeNet:p03994", "input_text": "let s = read_line ()\nlet k = ref @@ read_int ()\nlet f c = Char.(chr @@ (code c - 97 + !k) mod 26 + 97)\nlet _ = String.(mapi (fun i c -> let d = (123 - Char.code c) mod 26 in if i = length s - 1 then f c else if d < !k then (k := !k - d; 'a') else c) s) |> print_endline", "language": "OCaml", "metadata": {"date": 1571187349, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03994.html", "problem_id": "p03994", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03994/input.txt", "sample_output_relpath": "derived/input_output/data/p03994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03994/OCaml/s742291070.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s742291070", "user_id": "u732304692"}, "prompt_components": {"gold_output": "aya\n", "input_to_evaluate": "let s = read_line ()\nlet k = ref @@ read_int ()\nlet f c = Char.(chr @@ (code c - 97 + !k) mod 26 + 97)\nlet _ = String.(mapi (fun i c -> let d = (123 - Char.code c) mod 26 in if i = length s - 1 then f c else if d < !k then (k := !k - d; 'a') else c) s) |> print_endline", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "sample_input": "xyz\n4\n"}, "reference_outputs": ["aya\n"], "source_document_id": "p03994", "source_text": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 269, "cpu_time_ms": 2, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s171945894", "group_id": "codeNet:p03997", "input_text": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b h -> (a + b) * h / 2\n  ) |> printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595996490, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/s171945894.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171945894", "user_id": "u272377260"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b h -> (a + b) * h / 2\n  ) |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s626145787", "group_id": "codeNet:p03997", "input_text": "let a = read_int ()\nlet b = read_int ()\nlet h = read_int ()\nlet () =\n  print_int ((a + b) * h / 2);\n  print_newline()\n", "language": "OCaml", "metadata": {"date": 1475168159, "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/s626145787.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626145787", "user_id": "u420267469"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let a = read_int ()\nlet b = read_int ()\nlet h = read_int ()\nlet () =\n  print_int ((a + b) * h / 2);\n  print_newline()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s210083671", "group_id": "codeNet:p03998", "input_text": "Scanf.scanf \"%s %s %s\" (fun sa sb sc ->\n    let rec loop cur ai bi ci =\n        match cur with\n        | 'a' -> if ai = String.length sa then \"A\" else loop sa.[ai] (ai + 1) bi ci\n        | 'b' -> if bi = String.length sb then \"B\" else loop sb.[bi] ai (bi + 1) ci\n        | 'c' -> if ci = String.length sc then \"C\" else loop sc.[ci] ai bi (ci + 1)\n        | _ -> failwith \"??\"\n    in\n    loop 'a' 0 0 0 |> print_endline\n)", "language": "OCaml", "metadata": {"date": 1593660465, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03998.html", "problem_id": "p03998", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03998/input.txt", "sample_output_relpath": "derived/input_output/data/p03998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03998/OCaml/s210083671.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210083671", "user_id": "u342443598"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "Scanf.scanf \"%s %s %s\" (fun sa sb sc ->\n    let rec loop cur ai bi ci =\n        match cur with\n        | 'a' -> if ai = String.length sa then \"A\" else loop sa.[ai] (ai + 1) bi ci\n        | 'b' -> if bi = String.length sb then \"B\" else loop sb.[bi] ai (bi + 1) ci\n        | 'c' -> if ci = String.length sc then \"C\" else loop sc.[ci] ai bi (ci + 1)\n        | _ -> failwith \"??\"\n    in\n    loop 'a' 0 0 0 |> print_endline\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "sample_input": "aca\naccc\nca\n"}, "reference_outputs": ["A\n"], "source_document_id": "p03998", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s962175994", "group_id": "codeNet:p03998", "input_text": "let ans sa sb sc =\n  let na = String.length sa\n  and nb = String.length sb\n  and nc = String.length sc\n  in\n  let rec f ia ib ic = function\n    'a' -> if ia = na then \"A\"  else f (ia+1) ib ic sa.[ia]\n  | 'b' -> if ib = nb then \"B\" else f ia (ib+1) ic sb.[ib]\n  | _ -> if ic = nc then \"C\" else f ia ib (ic+1) sc.[ic]\n  in f 0 0 0 'a';;\n\nScanf.scanf \"%s\\n%s\\n%s\" (fun sa sb sc -> print_string (ans sa sb sc))\n", "language": "OCaml", "metadata": {"date": 1582529246, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03998.html", "problem_id": "p03998", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03998/input.txt", "sample_output_relpath": "derived/input_output/data/p03998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03998/OCaml/s962175994.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962175994", "user_id": "u752907799"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "let ans sa sb sc =\n  let na = String.length sa\n  and nb = String.length sb\n  and nc = String.length sc\n  in\n  let rec f ia ib ic = function\n    'a' -> if ia = na then \"A\"  else f (ia+1) ib ic sa.[ia]\n  | 'b' -> if ib = nb then \"B\" else f ia (ib+1) ic sb.[ib]\n  | _ -> if ic = nc then \"C\" else f ia ib (ic+1) sc.[ic]\n  in f 0 0 0 'a';;\n\nScanf.scanf \"%s\\n%s\\n%s\" (fun sa sb sc -> print_string (ans sa sb sc))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "sample_input": "aca\naccc\nca\n"}, "reference_outputs": ["A\n"], "source_document_id": "p03998", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 407, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s579368934", "group_id": "codeNet:p03998", "input_text": "let ss = Array.init 3 @@ fun _ -> read_line ()\nlet i_s = Array.make 3 0\nlet rec f c = String.(let j = index \"abc\" c in if i_s.(j) >= length ss.(j) then Printf.printf \"%c\\n\" \"ABC\".[j] else (i_s.(j) <- i_s.(j) + 1; f ss.(j).[i_s.(j) - 1]))\nlet _ = i_s.(0) <- 1; f ss.(0).[0]", "language": "OCaml", "metadata": {"date": 1571372373, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03998.html", "problem_id": "p03998", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03998/input.txt", "sample_output_relpath": "derived/input_output/data/p03998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03998/OCaml/s579368934.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579368934", "user_id": "u732304692"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "let ss = Array.init 3 @@ fun _ -> read_line ()\nlet i_s = Array.make 3 0\nlet rec f c = String.(let j = index \"abc\" c in if i_s.(j) >= length ss.(j) then Printf.printf \"%c\\n\" \"ABC\".[j] else (i_s.(j) <- i_s.(j) + 1; f ss.(j).[i_s.(j) - 1]))\nlet _ = i_s.(0) <- 1; f ss.(0).[0]", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "sample_input": "aca\naccc\nca\n"}, "reference_outputs": ["A\n"], "source_document_id": "p03998", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 272, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s289216734", "group_id": "codeNet:p03999", "input_text": "(* O(2^|s|) *)\nlet s = read_line () in\nlet ds = Array.to_list @@ Array.init (String.length s) @@ fun i -> int_of_char s.[i] - 48 in\nlet rec calc sum n = function\n| [] -> sum + n\n| d :: ds2 -> calc (sum + n) d ds2 + calc sum (10 * n + d) ds2 in\ncalc 0 (List.hd ds) (List.tl ds) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1559103525, "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/s289216734.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289216734", "user_id": "u732304692"}, "prompt_components": {"gold_output": "176\n", "input_to_evaluate": "(* O(2^|s|) *)\nlet s = read_line () in\nlet ds = Array.to_list @@ Array.init (String.length s) @@ fun i -> int_of_char s.[i] - 48 in\nlet rec calc sum n = function\n| [] -> sum + n\n| d :: ds2 -> calc (sum + n) d ds2 + calc sum (10 * n + d) ds2 in\ncalc 0 (List.hd ds) (List.tl ds) |> Printf.printf \"%d\\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s562053985", "group_id": "codeNet:p04003", "input_text": "module 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  val dijkstra :\n    (* 隣接リスト *)\n    (Vertex.t -> (Vertex.t * Weight.t) list) ->\n    (* 始点 *)\n    Vertex.t ->\n    (* 始点から辿り着けなければNoneを返す *)\n    (Vertex.t -> Weight.t option)\nend =\nstruct\n  module WMap = Map.Make (Weight)\n  module VMap = Map.Make (Vertex)\n\n  (* ダイクストラ法のメインループ *)\n  (* d に入っていない頂点への距離は無限大とみなす *)\n  let rec dijkstra_aux e (d, q) =\n    match WMap.min_binding q with\n    | exception Not_found -> d\n    | (w, us) ->\n        dijkstra_aux e @@ List.fold_left (fun (d, q) u ->\n          if Weight.compare (VMap.find u d) w < 0\n          (* 既に頂点uを訪れていた *)\n          then (d, q)\n          (* w = d.(u) *)\n          else List.fold_left (fun (d, q) (v, c) ->\n            let open Weight in\n            if\n              (* d.(v) <= d.(u) + c *)\n              try Weight.compare (VMap.find v d) (w + c) <= 0\n              with Not_found -> false (* d.(v) は無限大 *)\n            then (d, q)\n            else\n              VMap.add v (w + c) d,\n              WMap.add (w + c) (v :: try WMap.find (w + c) q with Not_found -> []) q)\n          (d, q) (e u)) (d, WMap.remove w q) us\n\n  let dijkstra e s =\n    let d =\n      dijkstra_aux e\n        (VMap.singleton s Weight.zero, WMap.singleton Weight.zero [s]) in\n    fun t -> try Some (VMap.find t d) with Not_found -> None\nend\n\nmodule G = WeightedDirectedGraph\n  (struct\n    type t = int * int\n    let compare = compare\n  end)\n  (struct\n    type t = int\n    let zero = 0\n    let ( + ) = ( + )\n    let compare = compare\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 %d\\n\" @@ fun p q c ->\n      es.(p - 1) <- (q - 1, c) :: es.(p - 1);\n      es.(q - 1) <- (p - 1, c) :: es.(q - 1)\n  done;\n  match\n    G.dijkstra (function\n      | (v, 0) -> List.map (fun (_, c) -> ((v, c), 1)) es.(v)\n      | (v, c) -> ((v, 0), 0) :: List.concat (List.map (fun (v, c') -> if c = c' then [((v, c), 0)] else []) es.(v))) (0, 0) (n - 1, 0)\n  with \n  | None -> print_endline \"-1\"\n  | Some d -> Printf.printf \"%d\\n\" d\n", "language": "OCaml", "metadata": {"date": 1533412660, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/OCaml/s562053985.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s562053985", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module 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  val dijkstra :\n    (* 隣接リスト *)\n    (Vertex.t -> (Vertex.t * Weight.t) list) ->\n    (* 始点 *)\n    Vertex.t ->\n    (* 始点から辿り着けなければNoneを返す *)\n    (Vertex.t -> Weight.t option)\nend =\nstruct\n  module WMap = Map.Make (Weight)\n  module VMap = Map.Make (Vertex)\n\n  (* ダイクストラ法のメインループ *)\n  (* d に入っていない頂点への距離は無限大とみなす *)\n  let rec dijkstra_aux e (d, q) =\n    match WMap.min_binding q with\n    | exception Not_found -> d\n    | (w, us) ->\n        dijkstra_aux e @@ List.fold_left (fun (d, q) u ->\n          if Weight.compare (VMap.find u d) w < 0\n          (* 既に頂点uを訪れていた *)\n          then (d, q)\n          (* w = d.(u) *)\n          else List.fold_left (fun (d, q) (v, c) ->\n            let open Weight in\n            if\n              (* d.(v) <= d.(u) + c *)\n              try Weight.compare (VMap.find v d) (w + c) <= 0\n              with Not_found -> false (* d.(v) は無限大 *)\n            then (d, q)\n            else\n              VMap.add v (w + c) d,\n              WMap.add (w + c) (v :: try WMap.find (w + c) q with Not_found -> []) q)\n          (d, q) (e u)) (d, WMap.remove w q) us\n\n  let dijkstra e s =\n    let d =\n      dijkstra_aux e\n        (VMap.singleton s Weight.zero, WMap.singleton Weight.zero [s]) in\n    fun t -> try Some (VMap.find t d) with Not_found -> None\nend\n\nmodule G = WeightedDirectedGraph\n  (struct\n    type t = int * int\n    let compare = compare\n  end)\n  (struct\n    type t = int\n    let zero = 0\n    let ( + ) = ( + )\n    let compare = compare\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 %d\\n\" @@ fun p q c ->\n      es.(p - 1) <- (q - 1, c) :: es.(p - 1);\n      es.(q - 1) <- (p - 1, c) :: es.(q - 1)\n  done;\n  match\n    G.dijkstra (function\n      | (v, 0) -> List.map (fun (_, c) -> ((v, c), 1)) es.(v)\n      | (v, c) -> ((v, 0), 0) :: List.concat (List.map (fun (v, c') -> if c = c' then [((v, c), 0)] else []) es.(v))) (0, 0) (n - 1, 0)\n  with \n  | None -> print_endline \"-1\"\n  | Some d -> Printf.printf \"%d\\n\" d\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2374, "cpu_time_ms": 3158, "memory_kb": 99960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s728758669", "group_id": "codeNet:p04003", "input_text": "exception Found of int\n\nmodule IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\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 %d\\n\" @@ fun p q c ->\n      es.(p - 1) <- (c, q - 1) :: es.(p - 1);\n      es.(q - 1) <- (c, p - 1) :: es.(q - 1)\n  done;\n  let visited = Array.make n IntSet.empty in\n  let rec bfs01 d t = function\n    | [] -> ()\n    | cvs ->\n        List.map (fun (c, v) -> dfs t c d [] v) cvs\n        |> List.concat\n        |> bfs01 (1 + d) t\n  and dfs t c d acc v =\n    if IntSet.mem c visited.(v) then acc\n    else begin\n      (if v = t then raise (Found d));\n      visited.(v) <- IntSet.add c visited.(v);\n      List.fold_left (fun acc (c', u) ->\n        if c = c' then dfs t c d acc u\n        else (c', u) :: acc) acc es.(v)\n    end in\n  try\n    bfs01 1 (n - 1) es.(0);\n    print_endline \"-1\"\n  with Found d -> Printf.printf \"%d\\n\" d\n", "language": "OCaml", "metadata": {"date": 1533410946, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/OCaml/s728758669.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s728758669", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "exception Found of int\n\nmodule IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\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 %d\\n\" @@ fun p q c ->\n      es.(p - 1) <- (c, q - 1) :: es.(p - 1);\n      es.(q - 1) <- (c, p - 1) :: es.(q - 1)\n  done;\n  let visited = Array.make n IntSet.empty in\n  let rec bfs01 d t = function\n    | [] -> ()\n    | cvs ->\n        List.map (fun (c, v) -> dfs t c d [] v) cvs\n        |> List.concat\n        |> bfs01 (1 + d) t\n  and dfs t c d acc v =\n    if IntSet.mem c visited.(v) then acc\n    else begin\n      (if v = t then raise (Found d));\n      visited.(v) <- IntSet.add c visited.(v);\n      List.fold_left (fun acc (c', u) ->\n        if c = c' then dfs t c d acc u\n        else (c', u) :: acc) acc es.(v)\n    end in\n  try\n    bfs01 1 (n - 1) es.(0);\n    print_endline \"-1\"\n  with Found d -> Printf.printf \"%d\\n\" d\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 946, "cpu_time_ms": 3173, "memory_kb": 1105000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s975708606", "group_id": "codeNet:p04003", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\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 %d\\n\" @@ fun p q c ->\n      es.(p - 1) <- (c, q - 1) :: es.(p - 1);\n      es.(q - 1) <- (c, p - 1) :: es.(q - 1)\n  done;\n  let visited = Array.make n IntSet.empty in\n  let dist = Array.make n None in\n  let rec bfs01 d = function\n    | [] -> ()\n    | cvs ->\n        List.map (fun (c, v) -> dfs c d [] v) cvs\n        |> List.concat\n        |> bfs01 (1 + d)\n  and dfs c d acc v =\n    if IntSet.mem c visited.(v) then acc\n    else begin\n      visited.(v) <- IntSet.add c visited.(v);\n      (if dist.(v) = None then dist.(v) <- Some d);\n      List.fold_left (fun acc (c', u) ->\n        if c = c' then dfs c d acc u\n        else (c', u) :: acc) acc es.(v)\n    end in\n  dist.(0) <- Some 0;\n  bfs01 1 es.(0);\n  match dist.(n - 1) with\n  | None -> print_endline \"-1\"\n  | Some d -> Printf.printf \"%d\\n\" d\n\n", "language": "OCaml", "metadata": {"date": 1533410225, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/OCaml/s975708606.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s975708606", "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 () = 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 %d\\n\" @@ fun p q c ->\n      es.(p - 1) <- (c, q - 1) :: es.(p - 1);\n      es.(q - 1) <- (c, p - 1) :: es.(q - 1)\n  done;\n  let visited = Array.make n IntSet.empty in\n  let dist = Array.make n None in\n  let rec bfs01 d = function\n    | [] -> ()\n    | cvs ->\n        List.map (fun (c, v) -> dfs c d [] v) cvs\n        |> List.concat\n        |> bfs01 (1 + d)\n  and dfs c d acc v =\n    if IntSet.mem c visited.(v) then acc\n    else begin\n      visited.(v) <- IntSet.add c visited.(v);\n      (if dist.(v) = None then dist.(v) <- Some d);\n      List.fold_left (fun acc (c', u) ->\n        if c = c' then dfs c d acc u\n        else (c', u) :: acc) acc es.(v)\n    end in\n  dist.(0) <- Some 0;\n  bfs01 1 es.(0);\n  match dist.(n - 1) with\n  | None -> print_endline \"-1\"\n  | Some d -> Printf.printf \"%d\\n\" d\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 996, "cpu_time_ms": 3169, "memory_kb": 1102440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s520668781", "group_id": "codeNet:p04005", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    let ( *@) = min in\n    let check a b c =\n        let q = a / 2 in\n        b * c * (a - 2 * q)\n    in\n    Printf.printf \"%d\\n\" @@ check a b c *@ check b c a *@ check c a b \n)", "language": "OCaml", "metadata": {"date": 1596253642, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/OCaml/s520668781.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s520668781", "user_id": "u342443598"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    let ( *@) = min in\n    let check a b c =\n        let q = a / 2 in\n        b * c * (a - 2 * q)\n    in\n    Printf.printf \"%d\\n\" @@ check a b c *@ check b c a *@ check c a b \n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 9, "memory_kb": 3764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s267811000", "group_id": "codeNet:p04005", "input_text": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet m, p = if a > b then if a > c then a, b * c else c, a * b else if b > c then b, a * c else c, a * b\nlet _ = Printf.printf \"%d\\n\" @@ if a mod 2 = 0 || b mod 2 = 0 || c mod 2 = 0 then 0 else (m - m / 2 * 2) * p", "language": "OCaml", "metadata": {"date": 1571907272, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/OCaml/s267811000.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s267811000", "user_id": "u732304692"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet m, p = if a > b then if a > c then a, b * c else c, a * b else if b > c then b, a * c else c, a * b\nlet _ = Printf.printf \"%d\\n\" @@ if a mod 2 = 0 || b mod 2 = 0 || c mod 2 = 0 then 0 else (m - m / 2 * 2) * p", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s740945719", "group_id": "codeNet:p04005", "input_text": "let f x y z = (x - x/2*2) * y * z\nlet _ = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d %d\" @@ fun a b c ->\n  min (f a b c) (min (f b c a) (f c a b))", "language": "OCaml", "metadata": {"date": 1534415203, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/OCaml/s740945719.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740945719", "user_id": "u798181098"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let f x y z = (x - x/2*2) * y * z\nlet _ = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d %d\" @@ fun a b c ->\n  min (f a b c) (min (f b c a) (f c a b))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s564890985", "group_id": "codeNet:p04011", "input_text": "let () =\n\tlet n, k, x, y = Scanf.scanf \"%d\\n%d\\n%d\\n%d\\n\" (fun a b c d -> a,b,c,d) in\n    Printf.printf \"%d\\n\" ((if n<=k then 0 else (k-n)*y) + n*x)", "language": "OCaml", "metadata": {"date": 1581950678, "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/s564890985.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s564890985", "user_id": "u307426615"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "let () =\n\tlet n, k, x, y = Scanf.scanf \"%d\\n%d\\n%d\\n%d\\n\" (fun a b c d -> a,b,c,d) in\n    Printf.printf \"%d\\n\" ((if n<=k then 0 else (k-n)*y) + n*x)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 148, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s262506494", "group_id": "codeNet:p04011", "input_text": "let n = read_int ()\nlet k = read_int ()\nlet x = read_int ()\nlet y = read_int ()\n\nlet () =\n  if n > k then\n    begin print_int @@ k * x + (n - k) * y; print_newline () end\n  else\n    begin print_int @@ n * x; print_newline () end", "language": "OCaml", "metadata": {"date": 1473471157, "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/s262506494.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262506494", "user_id": "u098968285"}, "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 ()\n\nlet () =\n  if n > k then\n    begin print_int @@ k * x + (n - k) * y; print_newline () end\n  else\n    begin print_int @@ n * x; print_newline () end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s558824757", "group_id": "codeNet:p04012", "input_text": "(* O(n) *)\nlet w = read_line ()\nlet n = String.length w\nlet _ =\n  for i = Char.code 'a' to Char.code 'z' do\n    let c = ref 0 in\n    String.iter (fun x -> if x = Char.chr i then incr c) w;\n    if !c mod 2 <> 0 then (print_endline \"No\"; exit 0)\n  done;\n  print_endline \"Yes\"", "language": "OCaml", "metadata": {"date": 1560534486, "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/s558824757.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558824757", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* O(n) *)\nlet w = read_line ()\nlet n = String.length w\nlet _ =\n  for i = Char.code 'a' to Char.code 'z' do\n    let c = ref 0 in\n    String.iter (fun x -> if x = Char.chr i then incr c) w;\n    if !c mod 2 <> 0 then (print_endline \"No\"; exit 0)\n  done;\n  print_endline \"Yes\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "sample_input": "abaccaba\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p04012", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s801364976", "group_id": "codeNet:p04012", "input_text": "let arr_of_str s = Array.init (String.length s) (fun i -> s.[i])\nlet f b c = b lxor (1 lsl (int_of_char c - 97))\nlet () =\n  let st = Scanf.scanf \"%s\" arr_of_str |> Array.fold_left f 0 in\n  print_endline (if st = 0 then \"Yes\" else \"No\")\n", "language": "OCaml", "metadata": {"date": 1519719506, "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/s801364976.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s801364976", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let arr_of_str s = Array.init (String.length s) (fun i -> s.[i])\nlet f b c = b lxor (1 lsl (int_of_char c - 97))\nlet () =\n  let st = Scanf.scanf \"%s\" arr_of_str |> Array.fold_left f 0 in\n  print_endline (if st = 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s511719570", "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\nmodule Int64 = struct\n\tinclude Int64\n\tlet (+|) p q = Int64.add p q\n\tlet (-|) p q = Int64.sub p q\n\tlet ( *|) p q = Int64.mul p q\n\tlet (/|) p q = Int64.div p q\n\tlet (<|) p q = \n\t\tif Int64.compare p q < 0 then true \n\t\telse false\n\tlet (>|) p q = \n\t\tif Int64.compare p q > 0 then true\n\t\telse false\n\tlet (>=|) p q = not (p < q)\n\tlet (<=|) p q = not (p > q)\n\tlet labs p = if p <| 0L then -1L*|p else p\n\tlet (~|) p = Int64.of_int p\nend\n\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\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 in let open Int64\n\tin\n\tlet dp = Bigarray.Array3.create int64 c_layout (n+5) (n+5) (mx+1)\n\tin dp.{0,0,0} <- 1L;\n\tfor i=0 to n-1 do\n\t\tfor j=0 to n do\n\t\t\tfor k=0 to mx do\n\t\t\t\tdp.{i+1,j,k} <- dp.{i,j,k} +| (\n\t\t\t\t\tlet v = k-ar.(i) in\n\t\t\t\t\tif j>=1 && v>=0 then dp.{i,j-1,v} else 0L\n\t\t\t\t)\n\t\t\tdone\n\t\tdone\n\tdone;\n\tlet s = ref 0L in\n\tfor k=1 to n do\n\t\tif a*k <= mx then\n\t\ts := !s +| dp.{n,k,a*k}\n\tdone;\n\t!s |> printf \"%Ld\\n\"", "language": "OCaml", "metadata": {"date": 1531220686, "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/s511719570.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511719570", "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\nmodule Int64 = struct\n\tinclude Int64\n\tlet (+|) p q = Int64.add p q\n\tlet (-|) p q = Int64.sub p q\n\tlet ( *|) p q = Int64.mul p q\n\tlet (/|) p q = Int64.div p q\n\tlet (<|) p q = \n\t\tif Int64.compare p q < 0 then true \n\t\telse false\n\tlet (>|) p q = \n\t\tif Int64.compare p q > 0 then true\n\t\telse false\n\tlet (>=|) p q = not (p < q)\n\tlet (<=|) p q = not (p > q)\n\tlet labs p = if p <| 0L then -1L*|p else p\n\tlet (~|) p = Int64.of_int p\nend\n\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\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 in let open Int64\n\tin\n\tlet dp = Bigarray.Array3.create int64 c_layout (n+5) (n+5) (mx+1)\n\tin dp.{0,0,0} <- 1L;\n\tfor i=0 to n-1 do\n\t\tfor j=0 to n do\n\t\t\tfor k=0 to mx do\n\t\t\t\tdp.{i+1,j,k} <- dp.{i,j,k} +| (\n\t\t\t\t\tlet v = k-ar.(i) in\n\t\t\t\t\tif j>=1 && v>=0 then dp.{i,j-1,v} else 0L\n\t\t\t\t)\n\t\t\tdone\n\t\tdone\n\tdone;\n\tlet s = ref 0L in\n\tfor k=1 to n do\n\t\tif a*k <= mx then\n\t\ts := !s +| dp.{n,k,a*k}\n\tdone;\n\t!s |> printf \"%Ld\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "sample_input": "4 8\n7 9 8 9\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04013", "source_text": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1530, "cpu_time_ms": 76, "memory_kb": 58112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s050532066", "group_id": "codeNet:p04019", "input_text": "let s = read_line ()\nlet f = String.contains s\nlet _ = print_endline @@ if f 'N' = f 'S' && f 'E' = f 'W' then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1571725737, "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/s050532066.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s050532066", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line ()\nlet f = String.contains s\nlet _ = print_endline @@ if f 'N' = f 'S' && f 'E' = f 'W' 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s685067920", "group_id": "codeNet:p04019", "input_text": "let arr_of_str s = Array.init (String.length s) (fun i -> s.[i])\nlet _ = print_endline @@ Scanf.scanf \"%s\" @@ fun d ->\n  let n,w,s,e =\n    arr_of_str d |> Array.fold_left (fun (n,w,s,e) c ->\n    (n||c='N', w||c='W', s||c='S', e||c='E')) (0=1,0=1,0=1,0=1)\n  in if n = s && w = e then \"Yes\" else \"No\"\n", "language": "OCaml", "metadata": {"date": 1534416958, "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/s685067920.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685067920", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let arr_of_str s = Array.init (String.length s) (fun i -> s.[i])\nlet _ = print_endline @@ Scanf.scanf \"%s\" @@ fun d ->\n  let n,w,s,e =\n    arr_of_str d |> Array.fold_left (fun (n,w,s,e) c ->\n    (n||c='N', w||c='W', s||c='S', e||c='E')) (0=1,0=1,0=1,0=1)\n  in if n = s && w = e then \"Yes\" else \"No\"\n", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s758004321", "group_id": "codeNet:p04020", "input_text": "Scanf.scanf \"%d\" @@ fun n ->\n  Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0))\n  |> Array.fold_left (fun (s, l) x ->\n      let c = if x = 0 then 0 else l + x mod 2 in\n      s + x/2 + c/2, c mod 2) (0, 0)\n  |> fst |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1534566142, "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/s758004321.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s758004321", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.scanf \"%d\" @@ fun n ->\n  Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0))\n  |> Array.fold_left (fun (s, l) x ->\n      let c = if x = 0 then 0 else l + x mod 2 in\n      s + x/2 + c/2, c mod 2) (0, 0)\n  |> fst |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s279585550", "group_id": "codeNet:p04030", "input_text": "open Bytes\nlet s = read_line ()\nlet b = of_string s\nlet i = ref 0\nlet _ = String.iter (function 'B' -> i := max 0 @@ !i - 1 | c -> set b !i c; incr i) s; print_endline @@ sub_string b 0 !i", "language": "OCaml", "metadata": {"date": 1564212409, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/OCaml/s279585550.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s279585550", "user_id": "u732304692"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "open Bytes\nlet s = read_line ()\nlet b = of_string s\nlet i = ref 0\nlet _ = String.iter (function 'B' -> i := max 0 @@ !i - 1 | c -> set b !i c; incr i) s; print_endline @@ sub_string b 0 !i", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s668746048", "group_id": "codeNet:p04030", "input_text": "let step out key =\n    match key with\n    | \"B\" -> \n        begin match out with\n        | [] -> []\n        | _ :: xs -> xs\n        end\n    | _ ->\n        key :: out\n\nlet () =\n    read_line ()\n    |> Str.split (Str.regexp \"\")\n    |> List.fold_left step []\n    |> List.rev\n    |> String.concat \"\"\n    |> print_endline\n", "language": "OCaml", "metadata": {"date": 1476120569, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/OCaml/s668746048.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s668746048", "user_id": "u420267469"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "let step out key =\n    match key with\n    | \"B\" -> \n        begin match out with\n        | [] -> []\n        | _ :: xs -> xs\n        end\n    | _ ->\n        key :: out\n\nlet () =\n    read_line ()\n    |> Str.split (Str.regexp \"\")\n    |> List.fold_left step []\n    |> List.rev\n    |> String.concat \"\"\n    |> print_endline\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 317, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s884319233", "group_id": "codeNet:p04031", "input_text": "let 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 as_ = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  let cost x =\n    Array.fold_left ( + ) 0 @@\n    Array.map (fun y -> (x - y) * (x - y)) as_ in\n  Printf.printf \"%d\\n\" @@ cost @@ upper_bound (-10000) 10000 @@ fun i ->\n    cost i - cost (i - 1) <= 0\n", "language": "OCaml", "metadata": {"date": 1530684878, "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/s884319233.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s884319233", "user_id": "u504158101"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let 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 as_ = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  let cost x =\n    Array.fold_left ( + ) 0 @@\n    Array.map (fun y -> (x - y) * (x - y)) as_ in\n  Printf.printf \"%d\\n\" @@ cost @@ upper_bound (-10000) 10000 @@ fun i ->\n    cost i - cost (i - 1) <= 0\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 475, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s785998963", "group_id": "codeNet:p04033", "input_text": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = print_endline @@ if a * b <= 0 then \"Zero\" else if a > 0 || (b - a) mod 2 = 1 then \"Positive\" else \"Negative\"", "language": "OCaml", "metadata": {"date": 1571637962, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04033.html", "problem_id": "p04033", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04033/input.txt", "sample_output_relpath": "derived/input_output/data/p04033/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04033/OCaml/s785998963.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s785998963", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Positive\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = print_endline @@ if a * b <= 0 then \"Zero\" else if a > 0 || (b - a) mod 2 = 1 then \"Positive\" else \"Negative\"", "problem_context": "Problem Statement\n\nYou are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.\n\nConstraints\n\na and b are integers.\n\n-10^9≤a≤b≤10^9\n\nPartial Score\n\nIn test cases worth 100 points, -10≤a≤b≤10.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nPositive\n\n1×2×3=6 is positive.\n\nSample Input 2\n\n-3 -1\n\nSample Output 2\n\nNegative\n\n(-3)×(-2)×(-1)=-6 is negative.\n\nSample Input 3\n\n-1 1\n\nSample Output 3\n\nZero\n\n(-1)×0×1=0.", "sample_input": "1 3\n"}, "reference_outputs": ["Positive\n"], "source_document_id": "p04033", "source_text": "Problem Statement\n\nYou are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.\n\nConstraints\n\na and b are integers.\n\n-10^9≤a≤b≤10^9\n\nPartial Score\n\nIn test cases worth 100 points, -10≤a≤b≤10.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nPositive\n\n1×2×3=6 is positive.\n\nSample Input 2\n\n-3 -1\n\nSample Output 2\n\nNegative\n\n(-3)×(-2)×(-1)=-6 is negative.\n\nSample Input 3\n\n-1 1\n\nSample Output 3\n\nZero\n\n(-1)×0×1=0.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s357548327", "group_id": "codeNet:p04034", "input_text": "let rs, cs, xys = Scanf.(Array.(scanf \"%d %d\" @@ fun n m -> make n 0, make n 1, init m @@ fun _ -> scanf \" %d %d\" @@ fun a b -> a - 1, b - 1))\nlet _ = rs.(0) <- 1; Array.(iter (fun (x, y) -> rs.(y) <- max rs.(y) rs.(x); cs.(y) <- cs.(y) + 1; cs.(x) <- cs.(x) - 1; rs.(x) <- min rs.(x) cs.(x)) xys; fold_left (+) 0 rs) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1583427413, "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/s357548327.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357548327", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rs, cs, xys = Scanf.(Array.(scanf \"%d %d\" @@ fun n m -> make n 0, make n 1, init m @@ fun _ -> scanf \" %d %d\" @@ fun a b -> a - 1, b - 1))\nlet _ = rs.(0) <- 1; Array.(iter (fun (x, y) -> rs.(y) <- max rs.(y) rs.(x); cs.(y) <- cs.(y) + 1; cs.(x) <- cs.(x) - 1; rs.(x) <- min rs.(x) cs.(x)) xys; fold_left (+) 0 rs) |> Printf.printf \"%d\\n\"", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 57, "memory_kb": 7936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s059263292", "group_id": "codeNet:p04040", "input_text": "let rec power ( * ) one m = function\n  | 0 -> one\n  | n when n mod 2 = 0 ->\n      power ( * ) one (m * m) (n / 2)\n  | n ->\n      m * power ( * ) one m (n - 1)\n\nlet memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x k =\n    try k @@ Hashtbl.find dp x with\n    | Not_found ->\n        f get x @@ fun y ->\n          Hashtbl.add dp x y; k y in get\n\nlet m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet inv n = power ( *^ ) 1 n (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d %d\" @@ fun h w a b ->\n  let fact = memoize (h + w) @@ fun fact n k ->\n    if n <= 1 then k 1\n    else fact (n - 1) @@ fun x -> k @@ n *^ x in\n  let fact n = fact n @@ fun x -> x in\n  let inv_fact = memoize (h + w) @@ fun inv_fact n k ->\n    if n <= 1 then k 1\n    else inv_fact (n - 1) @@ fun x -> k @@ inv n *^ x in\n  let inv_fact n = inv_fact n @@ fun x -> x in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( +^ ) 0 @@ Array.init (h - a) @@ fun i ->\n    fact(i + b - 1) *^ fact(h + w - 2 - i - b) *^ inv_fact(i) *^ inv_fact(b - 1) *^ inv_fact(h - i - 1) *^ inv_fact(w - b - 1)\n", "language": "OCaml", "metadata": {"date": 1531651252, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04040.html", "problem_id": "p04040", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04040/input.txt", "sample_output_relpath": "derived/input_output/data/p04040/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04040/OCaml/s059263292.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s059263292", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec power ( * ) one m = function\n  | 0 -> one\n  | n when n mod 2 = 0 ->\n      power ( * ) one (m * m) (n / 2)\n  | n ->\n      m * power ( * ) one m (n - 1)\n\nlet memoize n f =\n  let dp = Hashtbl.create n in\n  let rec get x k =\n    try k @@ Hashtbl.find dp x with\n    | Not_found ->\n        f get x @@ fun y ->\n          Hashtbl.add dp x y; k y in get\n\nlet m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\nlet inv n = power ( *^ ) 1 n (m - 2)\n\nlet () = Scanf.scanf \"%d %d %d %d\" @@ fun h w a b ->\n  let fact = memoize (h + w) @@ fun fact n k ->\n    if n <= 1 then k 1\n    else fact (n - 1) @@ fun x -> k @@ n *^ x in\n  let fact n = fact n @@ fun x -> x in\n  let inv_fact = memoize (h + w) @@ fun inv_fact n k ->\n    if n <= 1 then k 1\n    else inv_fact (n - 1) @@ fun x -> k @@ inv n *^ x in\n  let inv_fact n = inv_fact n @@ fun x -> x in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( +^ ) 0 @@ Array.init (h - a) @@ fun i ->\n    fact(i + b - 1) *^ fact(h + w - 2 - i - b) *^ inv_fact(i) *^ inv_fact(b - 1) *^ inv_fact(h - i - 1) *^ inv_fact(w - b - 1)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a large square grid with H rows and W columns.\nIroha is now standing in the top-left cell.\nShe will repeat going right or down to the adjacent cell, until she reaches the bottom-right cell.\n\nHowever, she cannot enter the cells in the intersection of the bottom A rows and the leftmost B columns. (That is, there are A×B forbidden cells.) There is no restriction on entering the other cells.\n\nFind the number of ways she can travel to the bottom-right cell.\n\nSince this number can be extremely large, print the number modulo 10^9+7.\n\nConstraints\n\n1 ≦ H, W ≦ 100,000\n\n1 ≦ A < H\n\n1 ≦ B < W\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nPrint the number of ways she can travel to the bottom-right cell, modulo 10^9+7.\n\nSample Input 1\n\n2 3 1 1\n\nSample Output 1\n\n2\n\nWe have a 2×3 grid, but entering the bottom-left cell is forbidden. The number of ways to travel is two: \"Right, Right, Down\" and \"Right, Down, Right\".\n\nSample Input 2\n\n10 7 3 4\n\nSample Output 2\n\n3570\n\nThere are 12 forbidden cells.\n\nSample Input 3\n\n100000 100000 99999 99999\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100000 100000 44444 55555\n\nSample Output 4\n\n738162020", "sample_input": "2 3 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04040", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a large square grid with H rows and W columns.\nIroha is now standing in the top-left cell.\nShe will repeat going right or down to the adjacent cell, until she reaches the bottom-right cell.\n\nHowever, she cannot enter the cells in the intersection of the bottom A rows and the leftmost B columns. (That is, there are A×B forbidden cells.) There is no restriction on entering the other cells.\n\nFind the number of ways she can travel to the bottom-right cell.\n\nSince this number can be extremely large, print the number modulo 10^9+7.\n\nConstraints\n\n1 ≦ H, W ≦ 100,000\n\n1 ≦ A < H\n\n1 ≦ B < W\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nPrint the number of ways she can travel to the bottom-right cell, modulo 10^9+7.\n\nSample Input 1\n\n2 3 1 1\n\nSample Output 1\n\n2\n\nWe have a 2×3 grid, but entering the bottom-left cell is forbidden. The number of ways to travel is two: \"Right, Right, Down\" and \"Right, Down, Right\".\n\nSample Input 2\n\n10 7 3 4\n\nSample Output 2\n\n3570\n\nThere are 12 forbidden cells.\n\nSample Input 3\n\n100000 100000 99999 99999\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100000 100000 44444 55555\n\nSample Output 4\n\n738162020", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1080, "cpu_time_ms": 151, "memory_kb": 34176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s766276684", "group_id": "codeNet:p04043", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun a b c -> if a+b+c=17 && a*b*c=175 then \"YES\" else \"NO\")\n|> print_endline\n", "language": "OCaml", "metadata": {"date": 1519656105, "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/s766276684.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s766276684", "user_id": "u798181098"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun a b c -> if a+b+c=17 && a*b*c=175 then \"YES\" else \"NO\")\n|> print_endline\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:s608318654", "group_id": "codeNet:p04043", "input_text": "let 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 print_list str list = Printf.printf \"%s: [ \" str; List.iter (fun (q,r) -> Printf.printf \"(%d, %d); \" q r) list; Printf.printf \"]\\n\"\n\nlet solve a b c = match (a,b,c) with\n    (5,7,5) -> \"YES\"\n  | (7,5,5) -> \"YES\"\n  | (5,5,7) -> \"YES\"\n  | _ -> \"NO\"\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%d %d %d\\n\" solve ) in\n        Printf.printf \"%s\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\n;;\n", "language": "OCaml", "metadata": {"date": 1472398320, "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/s608318654.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s608318654", "user_id": "u980152513"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let 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 print_list str list = Printf.printf \"%s: [ \" str; List.iter (fun (q,r) -> Printf.printf \"(%d, %d); \" q r) list; Printf.printf \"]\\n\"\n\nlet solve a b c = match (a,b,c) with\n    (5,7,5) -> \"YES\"\n  | (7,5,5) -> \"YES\"\n  | (5,5,7) -> \"YES\"\n  | _ -> \"NO\"\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%d %d %d\\n\" solve ) in\n        Printf.printf \"%s\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 581, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s221043581", "group_id": "codeNet:p04045", "input_text": "let js = Array.make 10 true\nlet rec f n = if n <= 9 then js.(n) else js.(n mod 10) && f (n / 10)\nlet _ = Scanf.scanf \" %d %d\" @@ fun n k -> for _ = 1 to k do js.(Scanf.scanf \" %d\" (+) 0) <- false done; for i = n to 100000 do if f i then (Printf.printf \"%d\\n\" i; exit 0) done", "language": "OCaml", "metadata": {"date": 1579780954, "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/s221043581.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s221043581", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "let js = Array.make 10 true\nlet rec f n = if n <= 9 then js.(n) else js.(n mod 10) && f (n / 10)\nlet _ = Scanf.scanf \" %d %d\" @@ fun n k -> for _ = 1 to k do js.(Scanf.scanf \" %d\" (+) 0) <- false done; for i = n to 100000 do if f i then (Printf.printf \"%d\\n\" i; exit 0) done", "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s917215491", "group_id": "codeNet:p04045", "input_text": "let n, k = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet ds =\n  Array.init k (fun _ -> Scanf.scanf \"%c \" (fun x -> x))\n  |> Array.to_list\n\nlet rec solve p =\n  let s = string_of_int p in\n  if List.exists (fun c -> String.contains s c) ds then solve (p + 1)\n  else p\n\nlet () = solve n |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1523136781, "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/s917215491.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s917215491", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "let n, k = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet ds =\n  Array.init k (fun _ -> Scanf.scanf \"%c \" (fun x -> x))\n  |> Array.to_list\n\nlet rec solve p =\n  let s = string_of_int p in\n  if List.exists (fun c -> String.contains s c) ds then solve (p + 1)\n  else p\n\nlet () = solve n |> 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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 20, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s655248507", "group_id": "codeNet:p04045", "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      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, false)\n              | (n, true) -> (10 * n + IntSet.min_elt ds, true))\n\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": 1469324620, "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/s655248507.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s655248507", "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      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, false)\n              | (n, true) -> (10 * n + IntSet.min_elt ds, true))\n\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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 919, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s093016445", "group_id": "codeNet:p04045", "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\n  | n ->\n      let m, n = n mod 10, n / 10 in\n      tabulate 10 (fun n -> n)\n      |> List.filter (fun n -> IntSet.mem n ds && m <= n)\n      |> (function\n          | [] -> 10 * solve ds (n + 1) + IntSet.min_elt ds\n          | m :: _ -> 10 * solve ds n + m)\n\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\" (solve ds n)\n", "language": "OCaml", "metadata": {"date": 1469323926, "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/s093016445.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s093016445", "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\n  | n ->\n      let m, n = n mod 10, n / 10 in\n      tabulate 10 (fun n -> n)\n      |> List.filter (fun n -> IntSet.mem n ds && m <= n)\n      |> (function\n          | [] -> 10 * solve ds (n + 1) + IntSet.min_elt ds\n          | m :: _ -> 10 * solve ds n + m)\n\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\" (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": "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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 760, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s571603521", "group_id": "codeNet:p04046", "input_text": "let modulo = 1000000007\nlet (+@) a b = (a + b) mod modulo\nlet ( *@ ) a b = (a * b) mod modulo\n\nlet rec mod_pow a n =\n  if n <= 0 then 1\n  else if n mod 2 = 1 then a *@ mod_pow a (n-1)\n  else let h = mod_pow a (n/2) in h *@ h\nlet mod_inv a = mod_pow a (modulo-2)\n\nlet lim = 200010\n\nlet fact =\n  let res = Array.make lim 1 in\n  for i = 1 to lim-1 do res.(i) <- i *@ res.(i-1) done;\n  res\n\nlet inv_fact = Array.map mod_inv fact\n\nlet comb n k =\n  if n < k then 0 else fact.(n) *@ inv_fact.(k) *@ inv_fact.(n-k)\n\nlet r h w = comb (h+w) h\n\nlet () =\n  Scanf.scanf \"%d %d %d %d\" @@ fun h w a b ->\n  Array.init (h-a) (fun i -> r i (b-1) *@ r (h-1-i) (w-b-1))\n  |> Array.fold_left (+@) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531944703, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04046.html", "problem_id": "p04046", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04046/input.txt", "sample_output_relpath": "derived/input_output/data/p04046/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04046/OCaml/s571603521.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571603521", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let modulo = 1000000007\nlet (+@) a b = (a + b) mod modulo\nlet ( *@ ) a b = (a * b) mod modulo\n\nlet rec mod_pow a n =\n  if n <= 0 then 1\n  else if n mod 2 = 1 then a *@ mod_pow a (n-1)\n  else let h = mod_pow a (n/2) in h *@ h\nlet mod_inv a = mod_pow a (modulo-2)\n\nlet lim = 200010\n\nlet fact =\n  let res = Array.make lim 1 in\n  for i = 1 to lim-1 do res.(i) <- i *@ res.(i-1) done;\n  res\n\nlet inv_fact = Array.map mod_inv fact\n\nlet comb n k =\n  if n < k then 0 else fact.(n) *@ inv_fact.(k) *@ inv_fact.(n-k)\n\nlet r h w = comb (h+w) h\n\nlet () =\n  Scanf.scanf \"%d %d %d %d\" @@ fun h w a b ->\n  Array.init (h-a) (fun i -> r i (b-1) *@ r (h-1-i) (w-b-1))\n  |> Array.fold_left (+@) 0\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a large square grid with H rows and W columns.\nIroha is now standing in the top-left cell.\nShe will repeat going right or down to the adjacent cell, until she reaches the bottom-right cell.\n\nHowever, she cannot enter the cells in the intersection of the bottom A rows and the leftmost B columns. (That is, there are A×B forbidden cells.) There is no restriction on entering the other cells.\n\nFind the number of ways she can travel to the bottom-right cell.\n\nSince this number can be extremely large, print the number modulo 10^9+7.\n\nConstraints\n\n1 ≦ H, W ≦ 100,000\n\n1 ≦ A < H\n\n1 ≦ B < W\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nPrint the number of ways she can travel to the bottom-right cell, modulo 10^9+7.\n\nSample Input 1\n\n2 3 1 1\n\nSample Output 1\n\n2\n\nWe have a 2×3 grid, but entering the bottom-left cell is forbidden. The number of ways to travel is two: \"Right, Right, Down\" and \"Right, Down, Right\".\n\nSample Input 2\n\n10 7 3 4\n\nSample Output 2\n\n3570\n\nThere are 12 forbidden cells.\n\nSample Input 3\n\n100000 100000 99999 99999\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100000 100000 44444 55555\n\nSample Output 4\n\n738162020", "sample_input": "2 3 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04046", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a large square grid with H rows and W columns.\nIroha is now standing in the top-left cell.\nShe will repeat going right or down to the adjacent cell, until she reaches the bottom-right cell.\n\nHowever, she cannot enter the cells in the intersection of the bottom A rows and the leftmost B columns. (That is, there are A×B forbidden cells.) There is no restriction on entering the other cells.\n\nFind the number of ways she can travel to the bottom-right cell.\n\nSince this number can be extremely large, print the number modulo 10^9+7.\n\nConstraints\n\n1 ≦ H, W ≦ 100,000\n\n1 ≦ A < H\n\n1 ≦ B < W\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nPrint the number of ways she can travel to the bottom-right cell, modulo 10^9+7.\n\nSample Input 1\n\n2 3 1 1\n\nSample Output 1\n\n2\n\nWe have a 2×3 grid, but entering the bottom-left cell is forbidden. The number of ways to travel is two: \"Right, Right, Down\" and \"Right, Down, Right\".\n\nSample Input 2\n\n10 7 3 4\n\nSample Output 2\n\n3570\n\nThere are 12 forbidden cells.\n\nSample Input 3\n\n100000 100000 99999 99999\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100000 100000 44444 55555\n\nSample Output 4\n\n738162020", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 703, "cpu_time_ms": 88, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s727084839", "group_id": "codeNet:p04047", "input_text": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let l_lst = Array.to_list @@ Array.init (n*2) (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let len = List.length l_lst in\n  List.sort compare l_lst |> \n  List.filteri (fun i x -> i mod 2 = 0 && i <> len-1) |>\n  List.fold_left (+) 0 |>\n  Printf.printf \"%d\\n\" \n  \n\n\n\n", "language": "OCaml", "metadata": {"date": 1529300608, "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/s727084839.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s727084839", "user_id": "u139013163"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let l_lst = Array.to_list @@ Array.init (n*2) (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let len = List.length l_lst in\n  List.sort compare l_lst |> \n  List.filteri (fun i x -> i mod 2 = 0 && i <> len-1) |>\n  List.fold_left (+) 0 |>\n  Printf.printf \"%d\\n\" \n  \n\n\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 2, "memory_kb": 3200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s324734544", "group_id": "codeNet:p04047", "input_text": "let id x = x\n\nlet read_ints =\n  let rec aux acc = function\n    | 0 -> acc\n    | n -> aux ((Scanf.scanf \"%d \" id) :: acc) (n-1) in\n  aux []\n\nlet odd_sum =\n  let rec aux acc = function\n    | [] -> acc\n    | hd1 :: hd2 :: tl -> aux (hd1 + acc) tl in\n  aux 0\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" id in\n  let l = read_ints (2*n) in\n  print_int (odd_sum (List.sort compare l))\n", "language": "OCaml", "metadata": {"date": 1468736360, "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/s324734544.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324734544", "user_id": "u367021138"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let id x = x\n\nlet read_ints =\n  let rec aux acc = function\n    | 0 -> acc\n    | n -> aux ((Scanf.scanf \"%d \" id) :: acc) (n-1) in\n  aux []\n\nlet odd_sum =\n  let rec aux acc = function\n    | [] -> acc\n    | hd1 :: hd2 :: tl -> aux (hd1 + acc) tl in\n  aux 0\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" id in\n  let l = read_ints (2*n) in\n  print_int (odd_sum (List.sort compare l))\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": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s711478244", "group_id": "codeNet:p04048", "input_text": "let main =\n    Scanf.sscanf (read_line()) \"%d %d\" (\n        fun n x ->\n            let rec gcd a b =\n                if a < b\n                then gcd b a\n                else if b = 0\n                then a\n                else gcd b (a mod b)\n            in\n            print_int (3 * (n - gcd n x));\n            print_string \"\\n\"\n    )", "language": "OCaml", "metadata": {"date": 1468810757, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04048.html", "problem_id": "p04048", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04048/input.txt", "sample_output_relpath": "derived/input_output/data/p04048/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04048/OCaml/s711478244.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711478244", "user_id": "u779353743"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let main =\n    Scanf.sscanf (read_line()) \"%d %d\" (\n        fun n x ->\n            let rec gcd a b =\n                if a < b\n                then gcd b a\n                else if b = 0\n                then a\n                else gcd b (a mod b)\n            in\n            print_int (3 * (n - gcd n x));\n            print_string \"\\n\"\n    )", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysterious Light.\n\nThree mirrors of length N are set so that they form an equilateral triangle.\nLet the vertices of the triangle be a, b and c.\n\nInside the triangle, the rifle is placed at the point p on segment ab such that ap = X.\n(The size of the rifle is negligible.)\nNow, the rifle is about to fire a ray of Mysterious Light in the direction of bc.\n\nThe ray of Mysterious Light will travel in a straight line, and will be reflected by mirrors, in the same ways as \"ordinary\" light.\nThere is one major difference, though: it will be also reflected by its own trajectory as if it is a mirror!\nWhen the ray comes back to the rifle, the ray will be absorbed.\n\nThe following image shows the ray's trajectory where N = 5 and X = 2.\n\nIt can be shown that the ray eventually comes back to the rifle and is absorbed, regardless of the values of N and X.\nFind the total length of the ray's trajectory.\n\nConstraints\n\n2≦N≦10^{12}\n\n1≦X≦N-1\n\nN and X are integers.\n\nPartial Points\n\n300 points will be awarded for passing the test set satisfying N≦1000.\n\nAnother 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the total length of the ray's trajectory.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n12\n\nRefer to the image in the Problem Statement section.\nThe total length of the trajectory is 2+3+2+2+1+1+1 = 12.", "sample_input": "5 2\n"}, "reference_outputs": ["12\n"], "source_document_id": "p04048", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysterious Light.\n\nThree mirrors of length N are set so that they form an equilateral triangle.\nLet the vertices of the triangle be a, b and c.\n\nInside the triangle, the rifle is placed at the point p on segment ab such that ap = X.\n(The size of the rifle is negligible.)\nNow, the rifle is about to fire a ray of Mysterious Light in the direction of bc.\n\nThe ray of Mysterious Light will travel in a straight line, and will be reflected by mirrors, in the same ways as \"ordinary\" light.\nThere is one major difference, though: it will be also reflected by its own trajectory as if it is a mirror!\nWhen the ray comes back to the rifle, the ray will be absorbed.\n\nThe following image shows the ray's trajectory where N = 5 and X = 2.\n\nIt can be shown that the ray eventually comes back to the rifle and is absorbed, regardless of the values of N and X.\nFind the total length of the ray's trajectory.\n\nConstraints\n\n2≦N≦10^{12}\n\n1≦X≦N-1\n\nN and X are integers.\n\nPartial Points\n\n300 points will be awarded for passing the test set satisfying N≦1000.\n\nAnother 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the total length of the ray's trajectory.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n12\n\nRefer to the image in the Problem Statement section.\nThe total length of the trajectory is 2+3+2+2+1+1+1 = 12.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s898718736", "group_id": "codeNet:p04048", "input_text": "let solve n x =\n  let rec aux acc n x =\n    if n = x then acc + x\n    else if n > x then aux (2*x + acc) (n-x) x\n    else aux (2*n + acc) (x-n) n in\n  aux n (n-x) x\n\nlet () = print_int (Scanf.scanf \"%d %d\" solve)\n", "language": "OCaml", "metadata": {"date": 1468738199, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04048.html", "problem_id": "p04048", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04048/input.txt", "sample_output_relpath": "derived/input_output/data/p04048/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04048/OCaml/s898718736.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s898718736", "user_id": "u367021138"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let solve n x =\n  let rec aux acc n x =\n    if n = x then acc + x\n    else if n > x then aux (2*x + acc) (n-x) x\n    else aux (2*n + acc) (x-n) n in\n  aux n (n-x) x\n\nlet () = print_int (Scanf.scanf \"%d %d\" solve)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysterious Light.\n\nThree mirrors of length N are set so that they form an equilateral triangle.\nLet the vertices of the triangle be a, b and c.\n\nInside the triangle, the rifle is placed at the point p on segment ab such that ap = X.\n(The size of the rifle is negligible.)\nNow, the rifle is about to fire a ray of Mysterious Light in the direction of bc.\n\nThe ray of Mysterious Light will travel in a straight line, and will be reflected by mirrors, in the same ways as \"ordinary\" light.\nThere is one major difference, though: it will be also reflected by its own trajectory as if it is a mirror!\nWhen the ray comes back to the rifle, the ray will be absorbed.\n\nThe following image shows the ray's trajectory where N = 5 and X = 2.\n\nIt can be shown that the ray eventually comes back to the rifle and is absorbed, regardless of the values of N and X.\nFind the total length of the ray's trajectory.\n\nConstraints\n\n2≦N≦10^{12}\n\n1≦X≦N-1\n\nN and X are integers.\n\nPartial Points\n\n300 points will be awarded for passing the test set satisfying N≦1000.\n\nAnother 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the total length of the ray's trajectory.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n12\n\nRefer to the image in the Problem Statement section.\nThe total length of the trajectory is 2+3+2+2+1+1+1 = 12.", "sample_input": "5 2\n"}, "reference_outputs": ["12\n"], "source_document_id": "p04048", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysterious Light.\n\nThree mirrors of length N are set so that they form an equilateral triangle.\nLet the vertices of the triangle be a, b and c.\n\nInside the triangle, the rifle is placed at the point p on segment ab such that ap = X.\n(The size of the rifle is negligible.)\nNow, the rifle is about to fire a ray of Mysterious Light in the direction of bc.\n\nThe ray of Mysterious Light will travel in a straight line, and will be reflected by mirrors, in the same ways as \"ordinary\" light.\nThere is one major difference, though: it will be also reflected by its own trajectory as if it is a mirror!\nWhen the ray comes back to the rifle, the ray will be absorbed.\n\nThe following image shows the ray's trajectory where N = 5 and X = 2.\n\nIt can be shown that the ray eventually comes back to the rifle and is absorbed, regardless of the values of N and X.\nFind the total length of the ray's trajectory.\n\nConstraints\n\n2≦N≦10^{12}\n\n1≦X≦N-1\n\nN and X are integers.\n\nPartial Points\n\n300 points will be awarded for passing the test set satisfying N≦1000.\n\nAnother 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the total length of the ray's trajectory.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n12\n\nRefer to the image in the Problem Statement section.\nThe total length of the trajectory is 2+3+2+2+1+1+1 = 12.", "split": "validation", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2101, "memory_kb": 384}, "variant": "low_resource"}