Bro you write really neat code
Nice work!
Bro you write really neat code
Nice work!
Thanks for the kind words.
I have failed my wishes
did anyone get the laddus?
nope
Hi all,
Really sorry for the delays. The good thing is that, now almost all of my personal life issues are resolved, and within few coming days you will see editorials popping one by one.
I will following the following schdule-
Thank you for your patience. I will update here as and when things progress so you guys can track them.
Your editorials are awesome Bhai, the way you write motivates everyone giving up stage to lets do it now. You make the logic so simple to understand Bhai. Thank you .
Nope
Aren’t you the Number 1 Speedcuber from India?
“Ujjawal Pabreja”
Yeah, I’m that guy
Wow I’m a cuber myself ( a terrible one). My average solve takes 18-19 secs. I have seen your YouTube channel and you’re fast as f_-_. I just didn’t expect to see you here
Haha. It’s great to see more cubers here! And, no cuber is terrible! It’s just about time and practice, you’ll get there
I also do cubing(not professionaly though) take around 25 sec on average and 17 is pb. just can say that there are a lot of common people in cp ,math ,cubing and chess.
Ada also solves Rubik’s cubes … in around a minute
Unofficial editorial of ENGLISH can now be requested. The editorial is pending approval from setter and admin.
@alei Hi! I liked the anthill problem! Thanks!
I just had a question about it, what is your optimal solution for it? (Or rather your best approximate solution).
When you said contestants found cliques, I’m not sure how they did that, since as far as I know finding max cliques is NP hard.
And even once you find cliques, I’m not sure the best way to connect neighboring cliques, do you construct it edge by edge?
Thanks again
Hi! Not sure how to request for the unofficial editorial?
Mail vijju123 on his email id.
I only had some general ideas of the possible approaches. The problem is based in that finding the square root of graphs is an unsolved problem. One idea is to find a covering with special subgraphs e.g if we divide the graph in many triangles we can save one operation, is not necessary to find exactly the max clique because there are also remove edge operations.
Hi all,
Sorry for not being very prompt in updating - had a lot of things going on in personal life. All editorials are finished and already published on discuss. Out of all the editorials, I really recommend you all to read the following:
Thanks to @kmaaszraa for the set of interesting problems - all the three problems were proposed by him.