GetRekt's blog

By GetRekt, 5 days ago, In English

Attention Coders!

Gear up for the Competitive Programming Contest of NITS HACKS 7.0, brought to you by the Coding Club of NIT Silchar, in association with the grand Tecnoesis festival at NIT Silchar! Dive into the excitement of team-based coding challenges and vie for fantastic prizes!

Who Can Join? Everyone is welcome to participate in the contest! However, only undergraduate students enrolled in Bachelor’s or Dual Degree programs in India are eligible to receive prizes.

Contest Format:

  • The contest will follow ICPC guidelines.

  • Preliminary Round: Open to all teams—show us your skills!

  • Final Round: A total of $$$30$$$ teams from prelims will compete for glory, with $$$10$$$ reserved spots exclusively for NIT Silchar teams (excluding the top 20).

If you’re ready to take on the challenge, join us for a coding showdown. Don’t miss this chance to prove yourself among the best!

Rules:

  • A team of 2-3 members from the same college is required to participate in the contest.

  • An eligible individual may join only one team.

  • Each participant must have a Codeforces account.

  • A team must be created in Codeforces composed of the members.

  • Finally, you should register for the contest using the formed team.

  • The team must also register through the link below; not adhering to this requirement will make the team ineligible for winning prizes.

Registration Link

Contest Time:

Click on the link below to take part in the contest. Registration for the contest will start 6 hours before the contest.

Contest Link

The problems are authored by sroid_03, Amartya3, rainb0ySimp, sohailkazi, and me (GetRekt).

We would like to thank :

See You on the leaderboard!

UPD 1: There will be 7 — 9 problems. There can be at most 69 interactive problems, so we suggest you go through this guide.

UPD 2: Registration has begun.

UPD 3:

Full text and comments »

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

By GetRekt, history, 16 months ago, In English

For this problem, i wanted to know if there was a solution using Hopcroft-Karp algorithm or bipartite matching ... Thank you

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it