|Online MIPT programming contest||РУССКИЙ|
Time limit = 1 secondChess association decided to assign new phone numbers to all the members. The new numbers should be produced with a knight's move on a phone keypad. 0 and 8 are not valid leading digits. For instance, the number 340-49-27 matches the criteria.
Create a program that computes the number of different phone numbers with a length N.
Input Integer N ( 1 ≤ N ≤ 56'789 )
Output Number of valid phone numbers
Peculiarities of national computer science problems
© acm.mipt DevGroup
The page was generated in 210ms