HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Unsorted > problem:


50266 - Kovrov

Guest
• Discussion of problem (1)

Section problems

• 51114 - The traveling vehicle
• 50937 - Calculate the Average
• 50947 - Calculate the Average
• 50964 - Increasing or Decreasing
• 50948 - Translate Score into Grade
• 50280 - Division
• 50256 - Sequence
• 50257 - Galls village
• 50266 - Kovrov
• 50254 - Lawyers Council
• 50260 - What about judges?
• 50259 - Many-coloured roads
• 50278 - ATM
• 50277 - Unusual Lottery
• 50283 - Tetris 3D
• 50285 - Meat store
• 50279 - Bit Decoder

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Автор: Павел Кузнецов, ПГУ.

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.

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

Input 1 Output 1
1000
0
Input 2 Output 2
5000
3

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

www.contester.ru