CCC '96 S3 - Pattern Generator - DMOJ: Modern Online Judge

CCC '96 S3 - Pattern Generator

View as PDF

Submit solution

All submissions

Best submissions

Points: 5

Time limit: 2.0s

Memory limit: 256M

Problem type

Write a program that repeatedly reads two numbers $n$ ~n~ and $k$ ~k~ and prints all bit patterns of length $n$ ~n~ with $k$ ~k~ ones in descending order (when the bit patterns are considered as binary numbers). You may assume that $0 < n \le 30$ ~0 < n \le 30~, $0 \le k < 8$ ~0 \le k < 8~, and $k \le n$ ~k \le n~. The first number in the input gives the number of pairs $n$ ~n~ and $k$ ~k~. The numbers $n$ ~n~ and $k$ ~k~ are separated by a single space. Leading zeroes in a bit pattern should be included. See the example below.

Sample Input

Sample Output

The bit patterns are
10
01

The bit patterns are
00

The bit patterns are
1100
1010
1001
0110
0101
0011

Comments

4

maxcruickshanks commented on Dec. 19, 2022, 4:04 a.m.

Since the checker was not implemented properly, it was fixed, and all submissions were rejudged.