Hello - please reach out of you can teach competitive programming: USACO levels based on C++ or Java.
Hi - a beginner here who is trying to coach his 8th grader for CP. I wanted to know the difficulty level of ZCO as compared to Codeforces Div2 A/B/C/D/E level. I understand the ZCO difficulty level could be changing from year to year. I just wanted to get a ballpark estimate so that I know where my son needs to be by December 2019. (he just finished all the Div 2A problems listed on "junior training sheet" by one Dr. Mostafa). Hope to get a response from more experienced people here.
Can someone please give me some hints to solve this problem. Thanks in Advance!!
This is a DP on Trees problem. Unless I'm mistaken, the question basically requires us to:
Divide the tree into a number of (different) connected subsets of nodes (or sub-trees) in the tree, with at least one of the sub-trees having exactly K nodes. Then, output the number of edges connecting the different sub-trees.
Any hints? The editorial is unavailable unfortunately. :/
EDIT:
Solution here at my blog, if anyone is interested:
Here's a problem from SnackDown 2019- Online Elimination Round which has bugged me for quite sometime today.
Please have a look at the problem below.
Can someone help with the implementation of this problem. I have understood the concept but having problem implementing it.
Thanks.