Module: (Python) Subroutines. recursion


Problem

12 /12


Iterating over lines #2

Problem

In the alphabet of the language of the tribe «Tumba-Yumba» four letters: "K", "L", "M" and "N". We need to display all possible words consisting of n letters (n > 1) in which the second letter is «K». Count the number of such words. 
 
Examples
# Input Output
1 2 KK
LK
MK
NK
4

(c)  K.Yu. Polyakov

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!