/* -------------- NOTE :- check the comment section of the code for link to original post containg the challange by @frogged -------------- MY OBSERVATION :- cosidering 💟 as 0 and 💜 as 1 For any matrix (when divided into four quadrants), all quadrants except the first one are bitwise NOT (or ones compliment) of first quadrant for example a 2x2 matrix will be something like this :- 0 1 1 1 this can be used to recursively construct the entire patern till the time rows of the matrix are in the form 2^k (where k is any natural number) */ #include /* change the value of 'n' to form a (nxn) matrix (for best results, keep it in form n = 2^k { where k is any natural number}) */ #define n 8 bool matrix[n][n]; /*** Function Declarations ***/ void make_pattern(int); void print_pattern(int); /*** main() function ***/ int main() { make_pattern(n); print_pattern(n); return 0; } /*** Function Definations ***/ void make_pattern(int rank) { // Base case if(rank == 1) { matrix[0][0] = 1; return; } // recursively make pattern in the first quadrant of the matrix make_pattern(rank/2); // Fill the rest three with compliment matrix of the first quadrant of the matrix // find the compliment matrix bool compliment_matrix[rank/2][rank/2]; for (int i = 0; i < rank/2; ++i) { for (int j = 0; j < rank/2; ++j) { // flip the bit of the matrix from 0 to 1 and vice versa compliment_matrix[i][j] = 1 ^ matrix[i][j]; } } //second quadrant int k ,l; k = 0; for(int i = rank/2; i < rank ;i++) { l = 0; for (int j = 0; j < rank/2; j++) { matrix[i][j] = compliment_matrix[k][l]; l++; } k++; } //third quadrant k = 0; for(int i = 0; i < rank/2 ;i++) { l = 0; for (int j = rank/2; j < rank; j++) { matrix[i][j] = compliment_matrix[k][l]; l++; } k++; } //fourth quadrant k = 0; for(int i = rank/2; i < rank ;i++) { l = 0; for (int j = rank/2; j < rank; j++) { matrix[i][j] = compliment_matrix[k][l]; l++; } k++; } } // print the resultant matrix void print_pattern(int rank) { for (int i = 0; i < rank; ++i) { for (int j = 0; j < rank; ++j) { // converting 0 and 1 to respective emoji std::cout<<(matrix[i][j] == 1?"💟":"💜"); } std::cout<<"\n"; } }

heart pattern (frogged challange)