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

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

E. Kovrov

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

• A. Tetris 3D
• B. Knights of the Rook
• C. Meat store
• D. Many-coloured roads
• E. Kovrov
• F. Interesting permutations
• G. What about judges?
• H. Triangles
• I. ATM

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

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

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

Kovrov celebrates its anniversary at 1st September, because in 1778 in that day empress Catherine the Great issued the decree about foundation of Kovrov district and the town itself.

In this problem you have to find amount of all positive numbers between 1 and N such that they contain at least one '1' digit, two '7' digits and one '8' digit in decimal notation. I.e. you can get enough digits from the number to write down 1778.

The first line contains a single number N (1 ≤ N ≤ 1000000).
Output a single integer number - the answer for the problem.

Input 1 Output 1
Input 2 Output 2

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