Hi codeforces
In some recently contest. I have found many problem with "constructive" tag. In this such problem, we solve it by the way like : "If you construct a algorithm like ... you will reach the result. We can prove that ..." Example : E and C in Global round 15 : https://codeforces.net/contest/1552/problem/E https://codeforces.net/contest/1552/problem/C
Some time I feel it's too difficult to solve constructive problem. So I want to ask you how did you figure out a solution for such that problem ?
btw// I have learnt cp for 3 years, yah, not practive so much on codeforces but many on another platform. Recently, I dicide to practice on cf more to reach at least CM on it. But, I feel it still impossible for me. But I will never give up (booyah!). Uhm, if you have any experience, pls share to me, I will damn grateful for that
Thanks for reading! (and sorry because my English).
Actually what I feel is if you construct some test cases on pen and paper for constructive problems then the pattern hidden comes out and then we have to just code it so just writing out some test cases is the key for me when constructive Algorithm is concerned
are you still trying to become CM? just ask