What should I do,when n=k.For example n=k=3
Possible ways
LBL
BLB
BBB
BBL
LBB
LLB

AND
LLL.
Should I count LLL too?
Problem says:
заменить некоторые «лимоны» на гораздо более политкорректные «бананы» таким образом, чтобы задача всё-таки была допущена к контесту. Сколькими способами это можно сделать?
I think I shouldn't count LLL too.Am I right?
Thank!

Edited by author 31.08.2007 18:17

Read the problem statement carefully:

"if a word "lemon" occurs more than K times successively, the problem will be immediately disqualified from the contest"

Why don't you count case LLL and (what is more strange) case BLL??? They both satisfy problem statement requirement. Right answer for test 3 3 is 8.

Thank you very much!

Thank you very much!!!It helps me.P.S.I forget BLL.

Edited by author 31.08.2007 23:58