[gofer]

Thanks for the reply. The language is irrelevant - I can do it in a language that best suits the task (although I was planning to use C++).

However I still don't understand how am I supposed to use permutations to solve the problem. Permutations simply change the order of the elements in a set. What's the set?

Are you suggesting to generate every possible combination of 1s and 0s of length 30 and then search for consecutive sequences in all of them? Because that seems awfully slow to me...