7dan's blog

By 7dan, history, 3 years ago, In English

We invite you to participate in CodeChef’s June Starters, this Sunday, 27th June.

Time: 4 PM — 7 PM IST.

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.

Joining us on the problem setting panel are:

  • Setters: Daanish Mahajan, Smit l_returns Mandavia, Aryan Agarwala

  • Tester: Istvan iscsi Nagy

  • Statement Verifier: Jakub Xellos Safin

  • Editorialist: Vichitr Vichitr Gandas

  • Contest Admin: Daanish Mahajan

  • Head Admin: Alex Um_nik Danilyuk

  • Video Editorialists: Chirayu Chirayu Jain, Prachi agarwal19 Agarwal, Darshan darshancool25 Lokhande, Yashodhan ay21 Agnihotri, Shivam Bohra, Aryan Agarwala, Meet myth_gemphir Singh Gambhir, Rajarshi RestingRajarshi Basu

  • Mandarin Translator: Huang Ying

  • Russian Translator: Fedor Mediocrity Korobeinikov

  • Bengali Translator: Sakib SakibAbrar Abrar

  • Vietnamese Translator: Team VNOI

The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.

Hope to see you participating.

Good Luck!

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

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

Can we expect Div1 problems this time as well? :P

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

Was the intended solution to Chef and Queries having complexity O(N*Q) ?

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

    Many div.2 participants did not submit code knowing the fact O(N*Q) should not pass.

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

    No, the intended solution was to use segment trees. Our test data was weak for this problem. Apologies for the mistake. We’ll be adding stronger data in Practice, but the contest submissions will remain as they are.