ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 209 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
abortmozga.ru	`06 apr 2009`	Ruby	28	00.02	7
abortmozga.ru	`06 apr 2009`	Ruby	29	00.02	7
abortmozga.ru	`06 apr 2009`	Ruby	30	00.02	7
abortmozga.ru	`06 apr 2009`	Ruby	31	00.02	7
abortmozga.ru	`06 apr 2009`	Ruby	32	00.02	7
Jacob	`06 apr 2009`	Ruby	6	00.01	12
814_Vadik	`15 may 2009`	Ruby	15	00.02	18
814_Vadik	`15 may 2009`	Ruby	13	00.02	22
814_Vadik	`15 may 2009`	Ruby	14	00.02	22
Vladimir_Sitnikov	`04 apr 2009`	Ruby	1	00.02	63
stasg7	`03 dec 2009`	Ruby	7	00.03	71
LOD	`04 jun 2017`	Python	4	00.05	103
814_Vadik	`15 may 2009`	Ruby	12	00.02	111
814_Vadik	`15 may 2009`	Ruby	11	00.02	113
bush	`13 jan 2013`	Ruby	2	00.02	115
Kopyrin_37.5	`08 nov 2013`	Ruby	11	00.02	127
bush	`13 jan 2013`	Ruby	1	00.02	138
ethanhunt	`25 may 2011`	Python	7	00.07	144
ethanhunt	`25 may 2011`	Python	8	00.06	147
ethanhunt	`25 may 2011`	Python	6	00.06	148
asp	`09 jun 2009`	Ruby	1	00.03	150
ethanhunt	`25 may 2011`	Python	5	00.06	150

Languages
C++	118
Java	40
Ruby	22
C	17
FPC	16
Python	6
Kylix	5
Haskell	2

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Knight's move

Time limit = 1 second

Chess 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.

7	8	9
4	5	6
1	2	3
	0

Create a program that computes the number of different phone numbers with a length N.

Input Integer N ( 1 ≤ N ≤ 100 )

Output Number of valid phone numbers

Input#1

Output#1

Author:
Peculiarities of national computer science problems
2000