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 main() {
	let mut buf = String::new();
	io::stdin().read_line(&mut buf).expect("");
	let s = buf.clone();
	let v:Vec<char> = buf.trim().chars().collect();
	let n:i32 = s.trim().parse().ok().unwrap();
	let mut dig:i32 = 0;
	for i in 0..v.len() {
		dig += (v[i] as i32) - ('0' as i32);
	}
	if n%dig == 0 {
		println!("Yes");
	}else{
		println!("No");
	}
}