vedant_vaidya_77's blog

CP TITANS 5.0 : The Code Heist
By vedant_vaidya_77, 8 months ago, In English

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 :

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! :)

  • Vote: I like it
  • +19
  • Vote: I do not like it

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Yay so excited !

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

lets gooo

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This round clashes with the upcoming div.3 though

→ Reply
  • »
    »
    8 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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..

    → Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

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!"

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Prizes?

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Let the code heist begins

→ Reply
»
8 months ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

Ready to tackle some tough coding problems and showcase what I've learned. Let's do this...!

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Lets Gooo:))))))

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

i am excited to participate in this and i wanted to know where i am lagging in and know about my skills

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hehe

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Finally, the long-awaited Battle Night is upon us.

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Okay! it's been long, I have solved any problem. Need to clean my sword.

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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!!

→ Reply
»
8 months ago, # |
  Vote: I like it -23 Vote: I do not like it

lets go

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

As a tester, I can assure this contest is going to be amazing!!

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Excited ✈️

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Time to flex our coding skills...hehehehe

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Excited

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Wow!!! Time to clash ;p

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Could have done F,but just don't how to implement seg tree correctly!!!

→ Reply
  • »
    »
    8 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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.

    → Reply
    • »
      »
      »
      8 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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.

      → Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to D?

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

hints for F?

→ Reply