Hello CodeChef Community!
We’re excited to invite you for the July Long Challenge 2018 sponsored by ShareChat. Join us for ten intense days of coding challenges! Joining me on the problem setting panel are:
Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.
Prizes: Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: How do I win a CodeChef Goodie? - faq - CodeChef Discuss.
(For those who have not yet got their previous winning, please send an email to winners@codechef.com)
Can someone from Problem setting panel explain the sample test case of Reach Equilibrium as it seems a little unclear…
Please provide P and Q instead of the final answer for better understanding if possible…
Thanks…
My first challenge here and NMNMX already became my most hated problem ever. First day I quickly tried brute force on it and got 20 points. Last 5 days have been working on it day and night and improved a lot but still getting 20 points. Is it possible to solve that problem with Python (in normal ways, I got a way to solve it but it’s kinda cheating :P)?