TechNite's blog

By TechNite, 3 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 ancclubiitd@gmail.com 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!

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

| Write comment?
»
3 years ago, # |
  Vote: I like it +42 Vote: I do not like it

nor sir orz

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there some Group where we get the link which i have to join??

»
3 years ago, # |
  Vote: I like it +25 Vote: I do not like it

Contest link?

»
3 years ago, # |
  Vote: I like it -11 Vote: I do not like it

Is it rated?

»
3 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Reminder: The contest starts in 10 minutes from now!

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Only one of my teammates is able to access the contest. Rest have not received any mail.

  • »
    »
    3 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Your teammate has probably registered for the mashup individually and not as a team. Please register as a team at the mashup link shared in the update (of the blog). You will be able to access the contest then.

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone share their solution for E?

I was trying to find all the numbers <=10^5 that are divisors for >= n — 1 numbers and was then trying to check if that could be a possible gcd for a spanning tree by trying to visit all nodes through edges that are a multiple of that number. As expected this approach was giving tle.

»
3 years ago, # |
Rev. 2   Vote: I like it +40 Vote: I do not like it

Thanks for the great participation in ICPC de Tryst! The editorial can be found here (or here, in case for some reason the previous link is inaccessible).

We encourage you to participate in CodeMod 2022 as well!

»
3 years ago, # |
Rev. 4   Vote: I like it +9 Vote: I do not like it

Reminder: CodeMod 2022 starts in about 1 hour and 15 minutes from now. Registrations are still open (and will be open till 45 minutes from now)! Details related to submission logistics will be updated soon and sent via email to registrants as well.

Edit: The contest logistics have been updated in the post. The email will be sent out soon.

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +22 Vote: I do not like it

    Quite irresponsible of you guys to make the email ids of all participants public like this, there's a thing called BCC, smh.

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it +14 Vote: I do not like it

      We accidentally sent the emails without BCC. We are extremely sorry for the blunder.

»
3 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Thanks to everyone who participated in CodeMod 2022! The editorial can be found here. Feel free to discuss alternative approaches!