PraveenDhinwa's blog

Invitation to the May Cook-off 2015 on CodeChef
By PraveenDhinwa, 9 years ago, In English

CodeChef invites you to participate in the May Cook-off 2015 at http://www.codechef.com/COOK58. The CodeChef May Cook-Off 2015 is an especial contest dedicated to our beloved community member Harsha Suryanarayana, whose sudden demise last year left us all in shock. Harsha, was an inspiration to many and he remains so. On his birthday, 23rd May let’s come together and do what Harsha liked the most and that is to have a fun filled competitive contest. So, do join us for the May Cook-Off 2015 to pay homage to one of finest and respected community member. You will always be with us humblefool.

Time: 24nd May 2015 (2130 hrs) to 25rd May 2015 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Details: http://www.codechef.com/COOK58

Registration: Just need to have a CodeChef user id to participate.

New users please register here

- Problem Setters : RedAnt (Anil Kishore) and PraveenDhinwa (Praveen Dhinwa)
- Editorialist: Balajiganapathi (Balajiganapathi)
- Problem Tester: utkarshl (Utkarsh Lath)
- Russian Translator : CherryTree (Sergey Kulik)
- Mandarin Translator: gediiiiiii (Gedi Zheng)
- Contest Admin: PraveenDhinwa (Praveen Dhinwa)

It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate.

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

»
9 years ago, # |
← Rev. 2   Vote: I like it -6 Vote: I do not like it

So a contest is arranged by Codechef tonight ! It means Codechef site will hang tonight !!

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

I can't access the problems

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

Is there any T-shirt prize for top participants?

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

How to do 3rd question "Devu and his friends" ? I thought that each component of graph is a ring with few trees(chains) directed on it. For any component answer would be max(0,value of ring + for each tree directed on it add max(0,max possible value of that chains(tree)) ).

→ Reply