We invite you to participate in CodeChef’s Starters 45, this Wednesday, 29th June, rated for Div 2, 3 & 4 Coders.

Time: 8 PM — 11:00 PM IST

Joining us on the problem setting panel are:

Contest Admins: Jeevan Jyot JeevanJyot Singh, Utkarsh Utkarsh.25dec Gupta

Setters: Valerio TheScrasse Stancanelli, Dinmukhamed DimmyT Tursynbay, Jeevan Jyot JeevanJyot Singh, Utkarsh Utkarsh.25dec Gupta, Kishan kg1910 Gadhiya, Rudro Rudro25 Debnath, Abhinav Gupta

Testers: Takuki tabr Kurokawa, Nishank IceKnight1093 Suresh

Statement Verifier: Hriday the_hyp0cr1t3 G

Editorialists: Yash kulyash Kulkarni

The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.

Also, if you have some original and engaging problem ideas and are interested in them being used in CodeChef's contests, you can share them here.

Hope to see you participating. Good Luck!

So how much can I get if I propose a problem?

You won't, because they will pay you at least 4 months after your problem is used. Or maybe i sent the wrong paypal account (´；ω；｀)

Reminder: Just 8 min Left.

Great contest, particularly "KBG and GN-Theory"

Somebody have posted the solution of KBG and GN-Theory 54 minutes prior of the end of contest . Please remove cheaters first before taking the next contest . Its very unfair for those who give the contest honestly . https://www.youtube.com/watch?v=K9rFvMblCtE

How to solve Cringe Queries? I couldn't think of any approach. Any hints would help!

Short Solution Outlinelet find the number of arrays where $$$a_i \neq a_{i-1}$$$ is $$$1$$$. When we apply query $$$i$$$ we can see that $$$a_{l-1} \neq a_r$$$, so let us create the graph and add edge from $$$l_{i}-1$$$ to $$$r_i$$$. Now problem is two find the number of coloring for each components and multiply it. Since the xor in component should be 0 the answer is $$$2^{(\text{number of nodes in component} - 1)}$$$

Complete editorial will be posted by tomorrow

Just as an update, the editorials of last 2 problems are available now

Thank you!