Editorial for Another Contest 7 Problem 4 - Team Assignments - Olympiads Online Judge

Editorial for Another Contest 7 Problem 4 - Team Assignments

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

The graph structure does not matter - there are $K(K-1)^{N-1}$ $K (K - 1)^{N - 1}$ ways to $K$ $K$ -color a tree with $N$ $N$ vertices.

To count the number of such colorings that use all $K$ $K$ colors, use inclusion-exclusion.

Comments

There are no comments at the moment.