Problem:
Score : 200 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(101) = 1 + 0 + 1 = 2.

Given an integer N, determine if S(N) divides N.

Constraints

1 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:

N

Output

If S(N) divides N, print Yes; if it does not, print No.

Sample Input 1

12

Sample Output 1

Yes

In this input, N=12.
As S(12) = 1 + 2 = 3, S(N) divides N.

Sample Input 2

101

Sample Output 2

No

As S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.

Sample Input 3

999999999

Sample Output 3

Yes

Solution in OCaml (4.02.3) (judge verdict: Accepted)

let rec arr_string str =
        let length = String.length str in
        match length with
        | 0 -> []
       | len ->
                let first = String.sub str 0 1 in
                let rest = String.sub str 1 (len - 1) in
                (String.get first 0) :: (arr_string rest)
                
let print_intline num = print_endline (string_of_int num)
                
let rec sum ls = match ls with
    | [] -> 0
    | (x::xs) -> x + (sum xs)            
                
let digits n =
    let rec loop n acc =
        if n = 0 then acc
        else loop (n/10) (n mod 10::acc) in
    match n with
    | 0 -> [0]
    | _ -> loop n []

let () =
    let line = read_line () in
    let input = int_of_string line in
    let ans = sum (digits input) in
    let resp = input mod ans in
    match resp with
        | 0 -> print_endline "Yes"
         | _ -> print_endline "No"