Closed Walks on Octagon — Solution & Editorial

Back to the Problem

The (1,1) entry of the adjacency matrix's N-th power via fast exponentiation.

Complexity: O(V³ log N)