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 Kotlin (1.0.0) (judge verdict: Accepted)

fun main(args: Array<String>) {

    val list = readLine()!!.split(" ").map(String::toInt)

    var result = mutableListOf<Int>()

    for (i in list[0]..list[1]) {

        // ロジックが汚い。やりたいことは剰余と商を求めること
        // 商と余りのPair型で返却するfunctionを作成してみる？
        // 冷静に考えると、順次割り算を再起的にする必要もなく(桁数が決まっているので)
        // 順次割って行かないと桁数おかしくなる。
        val one = devidePair(i)
        val two = devidePair(one.first)
        val three = devidePair(two.first)
        val four = devidePair(three.first)
        val five = devidePair(four.first)
        if (one.second == five.second && two.second == four.second)
            result.add(i)
    }
    println(result.size)
}

fun devidePair(num: Int): Pair<Int, Int> {

    // LOOK Pairの初期化
    return Pair(num / 10, num % 10)
}