https://www.codechef.com/problems/TREES
How to solve this one?detailed approach please.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
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.
Name |
---|