IceKnight1093's blog

Invitation to CodeChef Starters 80 (Rated till 5-stars) — 8th March
By IceKnight1093, 14 months ago, In English

We invite you to participate in CodeChef’s Starters 80, this Wednesday, 8th March, rated till 5-stars Coders (ie. for users with rating < 2200).

Time: 8 PM — 11:00 PM IST

Joining us on the problem setting panel are:

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest.

The video editorials of the problems will be available for all users for 1 day as soon as the contest ends, after which they will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.

Hope to see you participating. Good Luck!

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

Comments Comments (15)
| Write comment?
»
14 months ago, # |
  Vote: I like it +7 Vote: I do not like it

I hate tasks like matrix pain with a vengeance. The idea is obvious, just painful math debugging

→ Reply
»
14 months ago, # |
  Vote: I like it +26 Vote: I do not like it

There is no Long challenges in the Calendar. So this type of competitions is cancelled forever?

→ Reply
»
14 months ago, # |
← Rev. 2   Vote: I like it +5 Vote: I do not like it

There should have been a problem to fill the gap between 3rd (Permutation Subseq.) and 4th (Tree XOR).

→ Reply
»
14 months ago, # |
← Rev. 2   Vote: I like it +15 Vote: I do not like it

Problem "Eat Rock!" is a brilliant problem, loved upsolving it, because I was not able to debug in time during the contest. The order of weights and the order of distances got me confused in the solution.

Edit: finally became 6* again.

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

    Exactly, "Eat Rock!" was cool, dumb me couldn't debug my code in time.

    Got Accepted now!

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

    https://www.codechef.com/viewsolution/91734366

    Can someone please point out why this code shows runtime errors?

    → Reply
    • »
      »
      »
      14 months ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      I haven't seen the whole code, but it's probably because you're declaring a 2D vector of size NxN, which will exceed given memory.

      The line,

      vector<vector<int>> we(n+1,vector<int> (n+1,0));

      I guess you're doing this to store edge weights, so instead of that you can use vector of pairs, like in my submission.

      → Reply
»
14 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The tree problem is actually quiet nice. Love the solution

→ Reply
»
14 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Solution for c8kbf and Tree was uploaded on YouTube during the contest! CodeChef_admin please investigate

→ Reply
»
14 months ago, # |
  Vote: I like it 0 Vote: I do not like it

C8kbf and tree previously had t=100 and now it's 10. Not good

→ Reply