Problem:
Score : 200 points

Problem Statement

An integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.

Given an integer N, determine whether it is a Harshad number.

Constraints

1?N?10^8

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print Yes if N is a Harshad number; print No otherwise.

Sample Input 1

12

Sample Output 1

Yes

f(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.

Sample Input 2

57

Sample Output 2

No

f(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.

Sample Input 3

148

Sample Output 3

No

Solution in Rust (1.15.1) (judge verdict: Runtime Error)

extern crate core;

use std::io::{self, Read};

fn main() {
    let mut input = String::new();
    io::stdin().read_to_string(&mut input).unwrap();
    let output = run(input);
    println!("{}", output);
}

fn run(input: String) -> String {
    let list: Vec<i32> = input
        .split_whitespace()
        .map(|x| x.parse::<i32>().unwrap())
        .collect();
    let n = list[0];
    let a = list[1];
    let b = list[2];

    (1..(n + 1))
        .map(|x| {
            (
                x,
                x.to_string()
                    .chars()
                    .map(|y| y.to_string().parse::<i32>().unwrap())
                    .fold(0, |sum, i| sum + i),
            )
        })
        .filter(|&(_, x)| a <= x && x <= b)
        .map(|(x, _)| x)
        .fold(0, |sum, i| sum + i)
        .to_string()
}

#[test]
fn test() {
    let tests = vec![("20 2 5", "84"), ("10 1 2", "13"), ("100 4 16", "4554")];
    for (i, &(input, output)) in tests.iter().enumerate() {
        println!("test:{}", i);
        assert_eq!(run(input.to_string()), output.to_string());
    }
}