TREE COLOURING

CodeChefOpen on judge ↗

You are given a tree of N vertices, and an integer K. How many ways are there to colour the tree with K colours such that no edge is adjacent to vertices of the same colour. Since the answer may be large, output the answer modulo 1,000,000,007. Input - The first line consists of a single integer T, the number of test-cases. Each test-case is formatted as follows. - The second line consists of

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI