题库练习 Little Elephant and Interval
← 上一题 下一题 →

A8617 | Little Elephant and Interval

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

The Little Elephant very much loves sums on intervals.

This time he has a pair of integers $l$ and $r$ $(l<=r)$ . The Little Elephant has to find the number of such integers $x$ $(l<=x<=r)$ , that the first digit of integer $x$ equals the last one (in decimal notation). For example, such numbers as $101$ , $477474$ or $9$ will be included in the answer and $47$ , $253$ or $1020$ will not.

Help him and count the number of described numbers $x$ for a given pair $l$ and $r$ .

输入格式

The single line contains a pair of integers $l$ and $r$ $(1<=l<=r<=10^{18})$ — the boundaries of the interval.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

输出格式

On a single line print a single integer — the answer to the problem.

输入输出样例

输入 #1
2 47
输出 #1
12
输入 #2
47 1024
输出 #2
98
C++ 编辑器
输入
输出