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.42.0) (judge verdict: Accepted)

use proconio::fastout;
use whiteread::parse_line;

#[fastout]
fn main() {
    let (a, b): (usize, usize) = parse_line().unwrap();

    let mut ret = 0;
    for i in a..=b {
        let s: Vec<_> = i.to_string().chars().collect();
        let mut s_rev: Vec<_> = i.to_string().chars().collect();
        s_rev.reverse();
        if &s == &s_rev {
            ret += 1;
        }
    }
    println!("{}", ret);
}