GreedyMind's blog

By GreedyMind, 5 years ago, In English

Hello Codeforces!

Hack36 2020 and Computer Club, MNNIT Allahabad, India are glad to invite you to the first edition of a new programming competition of MNNIT Allahabad, CODENIGHT v1, which is an ACM-ICPC style team programming contest of 2 hours duration to be held on CodeChef during its annual hackathon event Hack36. A team can consist of up to 4 members.

Contest Details:

Top 3 global teams will get 300 CodeChef laddus each and few top Indian teams get direct entry to Hack36 to be held at MNNIT Allahabad.

The problem setting panel includes GreedyMind (myself), xian02, acIN1go and ayushghd.

We have an exciting problemset awaiting for you. Good luck and have fun!

UPD 1: Thank you everyone for participating! And congratulations to the global winners:

  1. Team HullCut Jawani (acraider, nitixkrai, fsociety00)
  2. Team Kohra hi kohra (sardhara_preet, Rutvik_Kothari, deepsavani, _Mr_Fab)
  3. Team LuckiestUnlucky (_Jaykishan_Parmar, Learner99, ayush_1998, bhavyashah9873)

Some stats for the contest:

Since it was the first edition of Codenight, we would like you to share your opinion in the comments about the contest. How was the level of difficulty for the problems? Should we've added more number of problems?

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

»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Is it rated ?

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

The contest begins in less than 3 hours! Register soon.

»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Nice Contest guys! Did the problem "A Not-so-easy Task" had a greedy solution cause my idea was that sum of all previous terms won't exceed the current one leading to a greedy approach. Unfortunately ran out of time :(

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

    Glad that you liked the contest :)

    Yes you are correct! The greedy approach would indeed work due to the same reason that you mentioned.