Hi codeforces, I'm trying to solve a dp on tree problem and it's hard for me. I need a help to find a right solution for it. plz help me... Problems decription: You have a tree with n nodes. Count the number of ways to delete some nodes such as the tree will be split into exactly k subtrees. (1 <= K, N <= 100). Sorry for my bad english... I really need a hint for that problems.