Problem:
Score : 200 points

Problem Statement

Find the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).

Constraints

1 \leq N \leq 10^4

1 \leq A \leq B \leq 36

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).

Sample Input 1

20 2 5

Sample Output 1

84

Among the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.

Sample Input 2

10 1 2

Sample Output 2

13

Sample Input 3

100 4 16

Sample Output 3

4554

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::io::{stdin, Stdin, BufRead};

fn main() {
    let stdin = stdin();
    let args = read(&stdin);
    let args = args.split_whitespace();
    let args = args.into_iter().map(|s| s.parse().unwrap()).collect::<Vec<i32>>();
    let n = args[0];
    let a = args[1];
    let b = args[2];

    let mut numbers = Vec::new();
    for i in a..n+1 {
        let mut sum = 0;
        let mut res = i;
        loop {
            let modulo = res % 10;
            sum += modulo;

            res = (res / 10) as i32;
            if res < 10 {
                sum += res;
                break;
            }
        }

        if a <= sum && sum <= b {
            numbers.push(i);
        }

    }
    println!("{}", numbers.iter().sum::<i32>());
}

fn read(stdin: &Stdin) -> String {
    let mut buf = String::new();
    stdin.lock().read_line(&mut buf).unwrap();
    buf
}