Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

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

fn is_palindromic(n: &i32) -> bool {
    let mut digits = [0; 5]; 
    let mut tmp = *n; 
    for i in 0..5 {
        digits[i] = tmp % 10; 
        tmp = tmp / 10; 
    }   
    digits[0] == digits[4] && digits[1] == digits[3]
}
fn main() {
    let stdin = std::io::stdin();
    let mut line = String::new();
    stdin.read_line(&mut line).ok();
    let inputs: Vec<&str> = line.split_whitespace().collect();
    let A: i32 = inputs[0].parse().unwrap();
    let B: i32 = inputs[1].parse().unwrap();
    let numbers = A..B+1;
    let x = numbers.filter(is_palindromic).count();
    println!("{}", x); 
}