What's up competitive programmers :> !
Welcome, to another installment of CP TITANS! Get ready to unleash your coding skills as we present to you CP TITANS 5.O : The Code Heist. Organized by the Developers & Coders Club, NIT Agartala, this contest promises an electrifying experience filled with thrilling challenges.
Contest Details
Date: March 19th, 2024
Time: 9:00 PM — 11:00 PM, IST (+5:30 GMT)
Penalty: 10 minutes for each wrong submission
You will be offered 6 problems and 2 hours to solve them! We tried to make interesting, beautiful, problems with strong pretests. Contest will follow ICPC guidelines.
We would like to thank :
Raj Raj_Tiwari Tiwari, Vedant vedant_vaidya_77 Vaidya for helping and proposing problems :3
Chetan chetan_saini Saini, Tejas wintersoldier2004 Jha, Kavi kavi_khalique Khalique, Payal li_ght Singh for testing. :>
MikeMirzayanov and the entire Codeforces team for creating the wonderful platforms Codeforces and Polygon <3
Contest Link: Click on the below link to take part in the contest. Registration for the contest will start 6 hours before the contest. CP TITANS 5.0 : The Code Heist
This incredible event is co-/sponsored by the revered AlgoZenith.
About CP TITANS
CP TITANS is a prestigious coding competition organized by the Developers & Coders Club at NIT Agartala. With each edition, we strive to push the boundaries of innovation and excellence in the field of competitive programming. Join us as we embark on another thrilling adventure filled with coding challenges. For more information about Developers and Coders Club, NIT Agartala and updates regarding the contest, follow us on:
Mark your calendars and gear up for an unforgettable coding experience at CP TITANS 5: The Code Heist. See you all on March 19th! :)
Yay so excited !
lets gooo
This round clashes with the upcoming div.3 though
Upcoming div.3 will be from 13:35 UTC and CP Titans 5.0 will start at 21:00 UTC, so it wont clash, you can give both contests..
Cool!
Let's goo After all this wait Finally its here :) "Can't wait to witness the impressive skills and creativity of our fellow students. Let the coding journey begin, and may the best solutions prevail!"
:D
Prizes?
Will be notified soon..
Soon before contest start?
Prizes are only for students from NIT Agartala and IIIT Agartala.
Let the code heist begins
:)
Ready to tackle some tough coding problems and showcase what I've learned. Let's do this...!
Lets Gooo:))))))
i am excited to participate in this and i wanted to know where i am lagging in and know about my skills
Hehe
Finally, the long-awaited Battle Night is upon us.
orz
Okay! it's been long, I have solved any problem. Need to clean my sword.
Gonna need that Chandrahansa sword clean and ready, orz
Good Luck to everyone who is participating in this contest. I hope you all enjoy the challenges and have fun in taking them on. So excited to see you guys there in the contest.
Go on Titans!!
lets go
Пришло время тренировать наши навыки кодирования.....хе-хе-хе
As a tester, I can assure this contest is going to be amazing!!
:D
Excited ✈️
Time to flex our coding skills...hehehehe
Excited
Wow!!! Time to clash ;p
Could have done F,but just don't how to implement seg tree correctly!!!
were you able to find a way to solve sample cases on paper? I was unable to do it. Can you please tell me how are there 15 subsequences in the array
2 2 2 2
it can be n! = 4! = 24. It got me very confused.
Your way to count the number of subsequence is wrong.Total number of subsequence is 2^4,ignoring the null set we get (2^4)-1=15.
How to D?
priority queue
whenever you get your curr_sum<0 just decrease the sum by the largest negative number and decrease the count by 1
i was thinking that way but couldnt implement correctly :( thanks btw
Hint: Potions(Easy Version). google this.
https://codeforces.net/contest/1526/submission/117722897
i had solved that question, but couldnt solve it here :(
hints for F?