Blue Bridge cup basic exercise 01 string [brute force solution], Blue Bridge string
Basic exercise 01 string time limit: 1.0 s memory limit: 256.0 MB Problem description
For a 01 string with a length of 5 digits, each digit may be 0 or 1, a total of 32 possibilities. The first few of them are:
00000
00001
00010
00011
00100
Output these 32 01 strings in ascending order.
The input format is not entered. The output format outputs 32 rows. Each row has a 01 string of 5 in ascending order. Sample output 00000
00001
00010
00011
<The following part is omitted>
#include<stdio.h>int main(){printf("00000\n");printf("00001\n");printf("00010\n");printf("00011\n");printf("00100\n");printf("00101\n");printf("00110\n");printf("00111\n");printf("01000\n");printf("01001\n");printf("01010\n");printf("01011\n");printf("01100\n");printf("01101\n");printf("01110\n");printf("01111\n");printf("10000\n");printf("10001\n");printf("10010\n");printf("10011\n");printf("10100\n");printf("10101\n");printf("10110\n");printf("10111\n");printf("11000\n");printf("11001\n");printf("11010\n");printf("11011\n");printf("11100\n");printf("11101\n");printf("11110\n");printf("11111\n");return 0;}