Submit solution

Points:
15 (partial)

Time limit:
0.6s

Memory limit:
128M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

##### Baltic Olympiad in Informatics: 2013 Day 1, Problem 2

A string is a palindrome if it remains the same when it is read backwards. A number is palindromefree if it does not contain a palindrome with a length greater than as a substring. For example, the number is palindrome-free whereas the number is not because it contains the palindrome .

Your task is to calculate the total number of palindrome-free numbers in a given range.

#### Input

The input contains two integers, and .

#### Output

The output should contain one integer: the total number of palindrome-free numbers in the range (including and ).

#### Constraints

In test cases worth points: .

#### Sample Input 1

`123 321`

#### Sample Output 1

`153`

#### Sample Input 2

`123456789 987654321`

#### Sample Output 2

`167386971`

## Comments