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 Rust (1.15.1) (judge verdict: Accepted)

use std::io;

fn abc(n:i32) -> String {
    let mut s_n:i32 = 0;
    let str_n:String = n.to_string();

    for x in str_n.chars() {
        let x_int:i32 = x as i32 - 48;
        s_n += x_int; 
    }

    if n % s_n == 0 {
        return "Yes".to_string();
    }
    else {
        return "No".to_string();
    }
}


fn main() {
    /*
    assert_eq!(abc(12), "Yes");
    assert_eq!(abc(101), "No");
    assert_eq!(abc(999999999), "Yes");
    */

    let stdin = io::stdin();
    let mut line = String::new();
    stdin.read_line(&mut line).ok();
    let txt:Vec<_> = line.trim().split(' ').collect();
    let n:i32 = txt[0].parse().unwrap();

    let result = abc(n);
    println!("{}", result);
}