Submission #1452951
Source Code Expand
module IntSet = Set.Make (struct type t = int let compare = compare end) let () = let n = Scanf.scanf "%d\n" (fun n -> n) in let ps = Array.init n (fun _ -> Scanf.scanf "%d " (fun p -> p)) in Array.fold_left (fun s p -> IntSet.fold (fun p' -> IntSet.add (p + p')) s s) (IntSet.singleton 0) ps |> IntSet.cardinal |> Printf.printf "%d\n"
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | fetburner |
Language | OCaml (4.02.3) |
Score | 2 |
Code Size | 365 Byte |
Status | AC |
Exec Time | 77 ms |
Memory | 3504 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 2 / 2 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00, 01, 02, 90, 91 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00 | AC | 1 ms | 640 KB |
01 | AC | 20 ms | 3328 KB |
02 | AC | 77 ms | 3504 KB |
90 | AC | 1 ms | 384 KB |
91 | AC | 1 ms | 384 KB |