Submission #112061

---

Source Code Expand

let (n,m) = Scanf.scanf "%d %d\n" (fun n m -> (n,m));;

let e =
    let rec add_edge t =
        if t = 0
        then []
        else (Scanf.scanf "%d %d\n" (fun a b -> (a-1,b-1)) :: (add_edge (t-1)))
    in add_edge m;;

let rec is_clique2 h t e =
    match t with
      [] -> true
    | (hh::tt) -> if ((List.mem (h,hh) e) ||(List.mem (hh,h) e))
                  then is_clique2 h tt e
                  else false;;

let rec is_clique l e sz =
    match l with
      [] -> sz
    | h::t -> if (is_clique2 h t e)
              then (is_clique t e sz)
              else 0;;

let solve =
    let rec search l i m e sz =
        if i = m
        then (is_clique l e sz)
        else (let t1 = search (i::l) (i+1) m e (sz+1) in
              let t2 = search l (i+1) m e sz in
              (max t1 t2))
    in search [] 0 n e 0;;

Printf.printf "%d\n" solve;;

Submission Info

Judge Result