Hello everyone!
Infero, the competitive programming club of IIT Hyderabad is glad to invite you to Code Clash, our programming event conducted as part of our annual techno-cultural fest, Elan & ηVision. The contest will last for 2 hours and scoring will be based on the ICPC format. It is an individual event, no teams will be allowed. The contest is open for all to participate.
Contest details:
- The contest will be held online on Codeforces.
- Start Time: 22nd February,2025 at 15:00 IST
- Duration: 2 hours
- All the problems were authored and prepared by Ceilings, ragi_bytes, vashednwoid, gopalvarun03, WrathOfGod01 and me.
- Contest Link: Elan & ηVision 2025 Code Clash
The top 3 Indian participants will receive prizes worth INR 15,000! Make sure to register yourself here to be eligible for prizes.
We hope to see you on the leaderboard!
UPD : The contest link has been added.
UPD1: We hope you enjoyed the problem set. The editorial to the contest can be found here.
Congratulations to the top 5 participants!
We will contact the top 3 participants for prizes soon.
UPD2 : The model solution for D assumes max k for which a solution exists is $$$\frac{n(n - 1)}{2}$$$, which is incorrect, however, the checker does not reject valid solutions, so we have decided to keep the problem. We are really sorry for this mistake. Thanks to wakanda-forever for pointing this out.
Auto comment: topic has been updated by Siddarth_MSR (previous revision, new revision, compare).
Siddarth_MSR orz!
Will the GOAT of IIT Hyderabad participate in this contest? Can't wait to be humiliated by him again
Goat humiliators ?
Auto comment: topic has been updated by Siddarth_MSR (previous revision, new revision, compare).
Is there an offline round after the online one?
I have the same question, but they mentioned
The contest link will be provided later.So I think it will be an online contest.No, its a single online contest.
Will there be Hyderabadi Biryani?
Is it only the form that we have to fill , or is there any other form or registration process?? Also when are we gonna get the contest link?
You only need to fill the form, and the contest link will be updated in the blog a few hours before the contest.
The contest link has been added
Auto comment: topic has been updated by Siddarth_MSR (previous revision, new revision, compare).
Reminder for the contest, it starts in 10 minutes.
Really nice problems. Any hint for C2?
Look at the number of zeros and number of ones in the bit representation of the number, if zeros_cnt>=ones_cnt we can flip, so with one number we are guaranteed to set max(zero_cnt,one_cnt) bits
I solved it a minute after the contest ended..
Here's a hint- try solving these cases:
$$$[3, 3, 4]$$$
$$$[1, 3, 4]$$$
$$$[1, 4, 5, 8]$$$
Hey I can't view others submissions for upsolving, please allow view submissions
You should be able to see the others submissions and all the test cases now.
How to solve D ?
Really Nice problems , Loved it !
Also are the standings final? or is it account to some changes yet to be done?
Auto comment: topic has been updated by Siddarth_MSR (previous revision, new revision, compare).
Auto comment: topic has been updated by Siddarth_MSR (previous revision, new revision, compare).