Non-palindrome number - FlandreOJ: Flandre Online Judge

Non-palindrome number

Time limit: 1000 ms
Memory limit: 256 MB
Count all the numbers within the range $[L, R]$ which do not contain any palindrome substring of length greater than $1$ in their decimal representation. ### Input - A single line contains two integers $L, R$. ### Output - Print the number of satisfied numbers. ### Constraints - $0 \le L\le R \le 10^{18}$. ### Example Input: ``` 10 15 ``` Output: ``` 5 ```