We invite you to participate in CodeChef’s July Lunchtime, running this Saturday, 25th July, from 7:30 pm to 10:30 pm IST. The contest features 5 problems and is 3 hours long.
Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.
Here is the problemsetting panel:
- Setters: Aman Retired_cherry Dwivedi, Shyam codemaster3840 Bajaj, Ahmad ahmad_salah Salah, Shashwat shashwatchan Chandra
- Admin : Teja teja349 Vardhan Reddy
- Tester: Yash yashChandnani Chandnani
- Editorialist: Rajarshi RestingRajarshi Basu
- Statement Verifier: Jakub Xellos Safin
- Mandarin Translator: Gedi gediiiiiii Zheng
- Vietnamese Translator: Team VNOI
- Russian Translator: Fedor Mediocrity Korobeinikov
- Bengali Translator: Mohammad solaimanope Solaiman
- Hindi Translator: Akash Shrivastava
Prizes:
The top 10 Indian and top 10 Global school students from ranklist will receive certificates and CodeChef laddus, with which they can claim cool CodeChef goodies. Know more here.
Good luck and have fun!
5 problems in Div1 too? What happened to the idea of putting div2 problems in div1 as seen in the last cookoff?
That was the shittiest idea ever.
What were they trying to do? Preventing div2 guys to solve hardest 2 problems which they were not going to read anyway.
Instead that should have been div1+div2
I guess it was a mistake, putting DIV-2 problems in DIV-1.
What is the observation/logic required for solving Binary Concatenation?
Try fixing the number of bits in both numbers you're choosing and write down the expression.
The function essentially returns $$$2^{MSB_Y}*X+Y - (2^{MSB_X}*Y+X)$$$. Here, MSB stands for most significant bit (1-indexed).
Notice that if both the MSB's are fixed, increasing $$$X$$$ never lowers the value, and similarly decreasing $$$Y$$$ never lowers the value. So for each ordered pair of MSB's, we check the max and min respectively.
Test cases were weak this got accepted Your text to link here...
Yeah, I think many got Binary Concatenation Accepted like that. shashwatchan Is it possible to do anything now?
Hello,
I sincerely apologize for this. I did try running some heuristics, but that was, evidently, not enough.
The constraint of having only two files per subtask coupled with preparing problems at a four days' notice did not help either.
Regardless, I will do better.
Thanks for participating!
I don't know if my solution was intended to work or not, but i simply bruteforced $$$A_i$$$ and $$$A_j$$$, with $$$A_i$$$ as one of the maximum or second maximum number, and $$$A_j$$$ as elements of array. It got accepted surprisingly lol
I must say that I'm so happy to see high quality CodeChef problems recently, one more competition that was quite interesting to solve.
.
How to solve Golomb ?