hmehta's blog

2021 Humblefool Cup w/ $600 in Prizes
By hmehta, history, 3 years ago, In English

2021 Humblefool Cup Prelims

The fifth edition of the much-coveted Humblefool Cup is here. While we couldn’t host the finals of the 2020 event because of the pandemic and lockdowns during this time last year, we hope to bring you an exciting tournament this year.

Topcoder and the Indian Institute of Information Technology (IIIT) Allahabad are excited to bring back the Humblefool Cup Algorithm Match in fond memory of Harsha Suryanarayana [humblefool].

Harsha is considered to be the best coder India has ever produced. A Topcoder member since 2005, humblefool – as he is known within the coding community –  was a TCO Finalist twice. Up until his tragic death in an accident in 2014, humblefool was at the top of his game in SRMs and personally trained and motivated many other members.

The Humblefool Cup is organized every year to preserve his legacy and contribution to the Community.

2021 Humblefool Cup Prelims is scheduled to start at 12:00 UTC-4 on March 17, 2021. Registration is now open for the SRM in the Arena or Applet and closes at 11:55 UTC-5. The coding phase will start at 12:05 UTC-5, so make sure that you are all ready to go. Click here to what time it starts in your area

Prizes:

Qualifying Round

The top thirty(30) students located in India will be invited to compete onsite or online at the Indian Institute of Information Technology, Allahabad. The best-ranked student in the qualifying round (not located in India) will be awarded $100 prize money.

Onsite Finals

The top thirty students from the qualifying round will compete onsite or online (to be announced later) to win the Humblefool Cup Medal and $600 in cash and goodies. The finalists will also receive Topcoder Humblefool Cup t-shirts.

Choose Your Competition Arena

There are two ways to compete in Algorithm Competitions or Single Round Matches (SRMs). Read here to find which works best for you.

Some Important Links

Match Results (match results, rating changes, challenges, individual test case results), Problem Archive, Problem Writing, Algorithm Rankings, Editorials and Older Editorials(SRM 710 and before),

Learn more about problem writing and testing opportunities.

Best of luck!
- the Topcoder Team

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

Comments Comments (27)
| Write comment?
»
3 years ago, # |
  Vote: I like it +28 Vote: I do not like it

It clashes with CF Round 708. Can anything be done about that?

→ Reply
»
3 years ago, # |
  Vote: I like it +20 Vote: I do not like it

Note: As the primary goal of this round is to select the top 30 Indian students for the Humblefool Cup finals, the difficulty of the round will be significantly easier than a usual Division 1 SRM. The round is open for everyone, but top contestants will probably find the problems too easy.

→ Reply
»
3 years ago, # |
  Vote: I like it +41 Vote: I do not like it

Is this rated for everyone?

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

Gentle Reminder: Round begins in 2 hours :)

→ Reply
  • »
    »
    3 years ago, # ^ |
    ← Rev. 2   Vote: I like it -12 Vote: I do not like it

    Hi hmehta I solved the problem Divide the Plane[300pt] just as it is in the editorial. Still it Failed. Since I am new to the topcoder interface, so couldn't find any forum, that's why writing the issue here. The code is below. My topcoder handle is pratyaydeep. Please please please look into it.

    class DivideThePlane:
    def makeCuts(self, H, V, N):
    	h=H+1
    	v=V+1
    	cnt=0
    	while(h*v<N):
    		if h<v:
    			h+=1
    		else:
    			v+=1
    		cnt+=1

        return cnt

    [edit] if anyone thinks I am not doing what it was supposed to do as in the editorial, please reply me.

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

      It is probably a TLE, in the worst case of 0 0 1e14 your code will need to run 2e7 times to get the ans.

      More help
      → Reply
      • »
        »
        »
        »
        3 years ago, # ^ |
        ← Rev. 2   Vote: I like it -17 Vote: I do not like it

        Then it is also true regarding the Editorials code. Why this discrimination ?

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

          It is just my speculation but in any case your code does not seem to be wrong in any other way. Well 2e7 is probably cutting it close to the time limit so maybe they didn't adjust the judge to give python a x5 multiplier for time constraints, anyways stop worrying about why ur unoptimised solution didn't pass and learn concepts and try to optimise it, will help u in a long run.

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

      It's probably overflow if your $$$h$$$ and $$$v$$$ are ints.

      → Reply
»
3 years ago, # |
  Vote: I like it -27 Vote: I do not like it

Editorial draft

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

    Hi, thanks a lot for the problems!!. Was there any need to change the constraints in 450-problem in middle of the contest? and that too a boundary condition. My solution fails for the case where R=1, while initially it was written R>=2. Given that the problem has a constructive solution, I didn't bother checking the constraints carefully on the examples. In fact the one example with wrong constraint had C=1 which will give correct output for my code. This is not fair really especially considering the fact that you changed the constraints after most people submitted the solution.

    → Reply
    • »
      »
      »
      3 years ago, # ^ |
      ← Rev. 2   Vote: I like it +6 Vote: I do not like it

      Sorry about that, the bad constraints in the statement are my mistake, I somehow accidentally kept the old version of the constraint section even though it should have been updated when the validator changed.

      We had to change something because at that point the constraints and the examples section were not consistent. As this was discovered only shortly before the end of the round and testing on the examples should hopefully have caught it for most people, the easiest solution at that point was to keep the test data intact.

      We did make an announcement that still applies: if you believe that your solution failed only due to R=1 or C=1 tests, we can re-evaluate it. I'll take a look at yours (message me your TC handle please), and if this applies to anyone else please send me a PM here within the next 24 hours.

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

        Hey! I am not sure but my solution might have got FST due to that. I am unable to check my code right now to confirm that.

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

        Any update on this? Next srm is about to start

        → Reply
  • »
    »
    3 years ago, # ^ |
    ← Rev. 2   Vote: I like it +3 Vote: I do not like it

    Also my plugins didnt parsed last sample in hardest problem which makes me believe it wasn't present when I opened this problem for the first time which in turn means that this sample was added in between the contest.

    Also, there were some announcements as well which sadly I missed and couldn't find a way to read them later. Would be helpful if you can share how can I access those missed announcements after closing that popup.

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

      That is correct, there was a clarification announced and the last example was then added as part of that clarification. Those announcements should still be available after you close the popup (In the applet look for a button that says "messages", and IIRC in the web arena there is an envelope icon in the top right corner).

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

Thanks for the interesting problems today! How soon do the problems normally appear in the practice area? I feel itchy to upsolve :)

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

    Which problem (apart from the 3rd) do you think was interesting?

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

      Well, I'm quite easy to please. For a noob like me, it was fun ¯\_(ツ)_/¯

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

The top thirty(30) students located in India will be invited to compete onsite or online at the Indian Institute of Information Technology, Allahabad.

So how will you check if a student is located in India? Some students might have not added their country in profile info.

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

    The university will be reaching out to you to share your college identity cards and some other information to confirm the same :)

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

      When will the list of selected participants be announced?

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

        Hey, It will take some time to reach out to members and verify the eligibility, so expect at least a week for the same :)

        → Reply
»
3 years ago, # |
  Vote: I like it +36 Vote: I do not like it

I have received an invitation to the Final Round of Humblefool Cup, is student (but not Indian) eligible to participate?

→ Reply