We are given n by n boolean matrix ( n <= 20). Output of matrix should be such that every row and every column should have only one true value ( true=1, false=0). Input matrix can have any number of 1's and there will be no row or column having all zero values. Example: let n=4
Input Matrix: 1 0 1 1 0 1 0 1 0 1 1 0 1 0 0 1 Final Matrix could have many correct answers. One of them is: 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 We've to find out the number of ways to get the desiered output. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
