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 whiteread::parse_line;

fn main() {
    let (a, b): (u32, u32) = parse_line().unwrap();
    let mut cnt = 0;

    for n in a..=b {
        let mut n = n.to_string();
        let mut ans = true;
        while n.len() > 1 {
            if Some(n.remove(0)) != n.pop() {
                ans = false;
                break;
            }
        }
        if ans {
            cnt += 1;
        }
    }
    println!("{}", cnt);
}