Problem Statement

Program $1$: Read Adjacency Matrices and output Adjacency Lists.

Recall the adjacency matrix format as described in the CS$220$ textbook. Here, the first line for each digraph is an integer $n$ indicating the order of the digraph. This is followed by $n$ white space separated lists of $0$ and $1$ values, where the $j-$th item on row i indicates whether the arc $(i,j)$ is included in the digraph. We have nodes labeled $0$ to $n-1.$

In both problem cases we will have a sequence of digraphs to process. The digraphs maycontain up to a thousand nodes. The last digraph of the sequence will be a digraph of order $0.$In both input cases you output a digraph of order $0$ in the desired format. Input comes from

stdin $($keyboard$)$ and output goes to stdout $($console$).$

I have already answered the list to matrix question already but I need help with matrix to list.

Below are the provided example Adjacency Matrixes and Adjacency Lists that the code is supposed to be able to convert to$.$

Adjacency Matrix:

$3$

$010$

$001$

$110$

$5$

$00101$

$10001$

$00001$

$10000$

$01100$

$8$

$01110100$

$10001111$

$11000010$

$00001011$

$01010011$

$00000000$

$11001001$

$01101100$

$8$

Adjacency List:

$3$

$1$

$2$

$01$

$5$

$24$

$04$

$4$

$0$

$12$

$8$

$1235$

$04567$

$016$

$467$

$1367$

$0147$

$1245$