Painting the Fence — Solution & Editorial
The first plank has K choices, each subsequent one has K−1: K·(K−1)N−1 with fast exponentiation.
Complexity: O(log N)
The first plank has K choices, each subsequent one has K−1: K·(K−1)N−1 with fast exponentiation.
Complexity: O(log N)