ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Сборники > Kovrov IT 2007 > задача:


G. Strange Numbers

Задачи сборника

• A. Phalanx
• B. Bitsorting
• C. Cubes
• D. Factorial
• E. Lights
• F. Parliament
• G. Strange Numbers
• H. Two Captains
• I. Boundary Troops
• J. Wedding

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Автор: Павел Кузнецов, ПГУ. Сложность Гамма

Let a number be called strange if in its decimal notation each digit (beginning with the second digit on the left) has another digit left to it, differing form it exactly by one. For example, the number 54632 is a strange one because the 4 has a 5, the 6 has a 5, and the 2 has a 3 on the left. The number 54622 is not a strange one because the first 2 on the left has no 1 or 3. Your task is to find out the quantity of strange numbers within the segment from L to R inclusive.

Input
The first line of the input contains integers L and R (1 ≤ R ≤ 1018; 1 ≤ LR).
Output
The output should contain only one number which represents the answer to the question.

Input 1 Output 1
11 30
3
Comment: the strange numbers within the section from 11 to 30 are 12, 21, 23.

Для отправки решений необходимо выполнить вход.

www.contester.ru