Counting Cycles

View as PDF

Submit solution

Points: 10
Time limit: 1.0s
Memory limit: 16M

Problem type

Given a graph as an adjacency matrix, calculate the total number of distinct simple cycles.
Remember that A - B - C - A is not the same as A - C - B - A, and that A - B - A is the same as B - A - B.

Input Specification

...same as before.
N \le 10.

Output Specification

The number of distinct simple cycles of any length.

Sample Input

3
0 1 0
0 0 1
1 0 0

Sample Output

1

Comments

There are no comments at the moment.