Painting the Fence
Paint a row of N planks with K colours so no two adjacent planks share a colour. Count the ways, modulo 109+7.
Input: one line with two integers N and K.
Output: the number of valid colourings mod 109+7.
Constraints:
- 1 ≤ N ≤ 1018
- 1 ≤ K ≤ 109
Sample Tests
Input 1
3 2
Output 1
2
Input 2
1 5
Output 2
5
Discussion (opens after you solve — no spoilers before)
No comments yet.