Pattern Generator | 프로그래밍의 벗 PivotOJ
PivotOJ

Pattern Generator

시간 제한: 1000ms메모리 제한: 128MB출처: CCC 1996BOJ 6977

문제

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.

예제

예제 1

입력
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
코드를 제출하려면 로그인하세요.