TechNite's blog

By TechNite, 2 years ago, In English

Hello Codeforces!

The Algorithms and Coding Club, IIT Delhi (ANCC) in collaboration with Tryst, IIT Delhi, will host the following two events and would like to invite you all for the same:

Participation is open to all, but the prizes are only for Indian college students. We encourage everyone to participate in these contests.


ICPC de Tryst

$$$\textbf{ICPC de Tryst}$$$ is an ICPC style team contest where you would be given 7-9 problems to solve in the span of 4 hours, for teams of 1-3 members.

$$$\textbf{Details}$$$:

  • Each participant is allowed to use their own laptop.
  • Participants will be required to submit their code on Codeforces and will receive a verdict accordingly. Ranking will be done based on the number of solves and in case of a tie, a time penalty will be used as a tie-breaker.
  • Registration Link
  • Rulebook
  • Time: 15th April 2022, 9 PM IST to 16th April 2022, 1 AM IST
  • Total prize pool: INR 8K (top 3 teams with only Indian college students).

Problemsetters: nor, islingr, tamajitbuba, _Erased, WAtoAC2001

Update 1: Here is the invite link for ICPC-de-Tryst.

Update 2: The editorial can be found here or here.

Congratulations to the winners!

  1. CoderAnshu, demoralizer, rivalq
  2. Savior-of-Cross
  3. SorahISA

As mentioned earlier, the prizes would be for the top 3 teams with only Indian college students, and they will be announced in due time.


CodeMod

$$$\textbf{CodeMod}$$$ is a Project-Euler-style individual contest where you would be given 6-7 challenging mathematical problems with an integer answer to solve in the span of 3 hours. You can optionally write programs in your favorite programming language to aid in computing the answers.

$$$\textbf{Details:}$$$

  • The computer can only be used to code and compute.
  • Participants will be required to submit the final answer to the problems along with the code/brief calculations through Google forms.
  • Registration Link
  • Rulebook
  • Time: 17th April 2022, 9 AM IST to 12:10 PM IST
  • Total prize pool: INR 8K (top 3 Indian college students).

Problemsetters: nor, rishabh.ranjan, The_Kings_Gambit, jvidit

Update 1: This is the submission link. For any clarifications during the contest, either mail your queries to [email protected] or join exactly one of the WhatsApp groups below and ask the admins. Please do not join more than one link.

The problemset will be available in the form link once the contest is live, and we will also share it here when the contest starts.

Update 2: The contest has started, and the form link is up. The problems can be found on the form link or here.

Update 3: The contest has ended. The editorial can be found here.


We would like to thank MikeMirzayanov for the great system Polygon and Codeforces, and you all for participating.

Looking forward to seeing you all in the standings. Make sure you read all the problems carefully. Good luck and have fun!

Visit our website to know more about our events. Happy coding!

Full text and comments »

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

By TechNite, 4 years ago, In English

I was getting WA on testcase 2 for the mastermind problem(DIV2E/DIV1C) in codeforces round 658. Here is my submission 87685109. The basic idea is that for perfect matching i choose thethe color with maximum frequency at each step. And after that i swap the two most frequent colors in n-x indices taking care of the odd case.(In odd case i do right cyclic shift for 3 most frequent colors)

Can anyone help me why i am getting wrong answer for this

Thanks

Full text and comments »

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