https://www.codechef.com/problems/TREES
How to solve this one?detailed approach please.
https://www.codechef.com/problems/TREES
How to solve this one?detailed approach please.
How to solve this simple problem?
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.
Please explain how did u arrive at the result?
i want an help beecause it is a difficult questions (sorry for mine poor english)
https://www.codechef.com/problems/SUBLCM need help in this problem.anyone to give a detailed explanation please?
Thanks in advance.
Somebody please give some good approach.