JeevanJyot's blog

By JeevanJyot, 7 weeks ago,

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:

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!

• +22

 » 7 weeks ago, # |   0 So how much can I get if I propose a problem?
•  » » 7 weeks ago, # ^ |   +1 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 (´；ω；｀)
 » 7 weeks ago, # |   0 Reminder: Just 8 min Left.
 » 7 weeks ago, # |   0 Great contest, particularly "KBG and GN-Theory"
 » 7 weeks ago, # |   +1 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
 » 7 weeks ago, # |   +3 How to solve Cringe Queries? I couldn't think of any approach. Any hints would help!
•  » » 7 weeks ago, # ^ | ← Rev. 4 →   +11 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)}$
•  » » 7 weeks ago, # ^ |   +14 Complete editorial will be posted by tomorrow
•  » » 7 weeks ago, # ^ |   +1 Just as an update, the editorials of last 2 problems are available now
•  » » » 7 weeks ago, # ^ |   0 Thank you!