1996 Canadian Computing Competition, Stage 1
Problem C: Pattern Generator
Write a program that repeatedly reads two numbers n and k and prints all bit patterns of length n with k ones in descending order (when the bit patterns are considered as binary numbers). You may assume that 30 ≥ n > 0, 8 > k ≥ 0, and n ≥ k. The first number in the input gives the number of pairs n and k. The numbers n and k are separated by a single space. Leading zeroes in a bit pattern should be included. See the example below.
3 2 1 2 0 4 2
The bit patterns are 10 01 The bit patterns are 00 The bit patterns are 1100 1010 1001 0110 0101 0011
Point Value: 10
Time Limit: 10.00s
Memory Limit: 16M
Added: Sep 28, 2008
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3
My samples are right but I just cannot get any point.Thanks a lot !
Your logic is simply incorrect.
Only asking because it says in problem type "recursion" and a comment says you need to use recursion
Edit: However, after looking a bit more, it's not your only problem. Try some more test cases.
//made the same mistake
also your algorithm does not print the patterns in the order specifieddsdss
"Write a program that prints all bit patterns of length n with k ones in descending order "
Maybe read the problem statement more carefully next time.