From adjacency matrix to the list of edges#2471
A simple undirected graph is given by adjacency matrix. Print its representation as a list of edges.
The first line contains the number of vertices n~(1 \le n \le 100) in the graph. The next lines contain the adjacency matrix of the graph.
Print the list of edges of the graph, ordered by the first vertex in each pair.
Example 1