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)

use std::io::*;
 
fn read_spc<T: std::str::FromStr>() -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().split_whitespace()
        .map(|e| e.parse().ok().unwrap()).collect()
}

fn main() {
    palindromic_numbers();
}

fn palindromic_numbers() {
    let ab: Vec<i64> = read_spc();
    let a = ab[0];
    let b = ab[1];
    let mut m: i64 = 0;
    for i in a..(b + 1) {
        let mut istr = i.to_string().chars().collect::<Vec<char>>();
        if istr[0] == istr[4] && istr[1] == istr[3] {
            m += 1;
        }
    }
    println!("{}", m);
}