What is the approach for this problem ?

Revision en1, by Optimal_Aces, 2019-09-29 19:36:16

https://www.codechef.com/problems/CKISSHUG

My method :- if first place is H then there are 2^(n-1) possibilities if first place is K then there are 2^(n-1/2) possibilities but this method is not right .

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Optimal_Aces 2019-09-29 19:36:16 259 Initial revision (published)