Utkarsh.25dec's blog

Invitation to CodeChef Starters 42 (Rated for Div 2, 3 & 4) — 8th June 2022
By Utkarsh.25dec, 2 years ago, In English

We invite you to participate in CodeChef’s Starters 42, this Wednesday, 8th June, Rated for Div 2, 3 & 4.

Time: 8:00 PM — 11:00 PM IST

Joining me on the problem setting panel are:

Additional Notes about the contest:

  • All the div2 problems are set by Satyam satyam343 Kumar Roy.

  • All the problems are interesting. I hope you like the contest.

Also, announcing Scholarship for CodeChef Certification in Data Structure & Algorithms — More than 100 Indian participants in Divisions 1, 2, and 3 will win scholarships for the CodeChef Certification exam (discounted prices). Scholarship criteria can be found on the respective contest pages.

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.

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
  • +74
  • Vote: I do not like it

Comments Comments (16)
| Write comment?
»
2 years ago, # |
  Vote: I like it +18 Vote: I do not like it
request
^ ^
→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    Yeah this is what everyone wants (including me :P). Contest becomes more interesting when its rated for a participant. Although honestly speaking it is very very hard to increase the frequency of div1-rated rounds on any platform.

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

      Why don't you make the contest rated for 5-star coders? Like in Codeforces, we have CM which can participate in Div2 only round but will have to participate in the Div1 round if there is an option? You mentioned in one of the previous comments that your team is thinking in this direction, but now it's been 3-4 months already. How long does it take to implement?

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

        Yeah, these things were discussed but we realized we do not have enough good problems on the harder side. I believe the number of problem proposals in CodeChef is increasing and maybe possibly in the future we may be able to extend it to div1.5 or something (Can't predict how long).

        Also, w.r.t. to my previous year's comments, when there were only 1-2 div3 rated starters in a month, we have tried to improve a lot. Now we have div2 rated starters every Wednesday.

        Hopefully, in the future, we may be able to entertain the Div1.5 request too.

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

Reminder: Contest starts in less than 10 minutes.

I hope you find the problems interesting.

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

How did you implement the checker of CAARRAY?

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

    We had a O(n^2) checker. Like for checking whether there exists any subsequence with gcd i, we checked the gcd of all those numbers which were divisible by i (If it is not equal to i, then no subsequence can have gcd=i). Also there should be atleast two numbers divisible by each i.

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

Div 1 Problems Were really good. Thanks For the contest.

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

i like problem CAARRAY , thanks .

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

    Can you please share your approach for CAARRAY, mine was quite long. First I put numbers in the form n, 2*n, (n-1), 2*(n-1),..., then multiply the adjacent positions whose gcd is 1 with the remaining gcd's which have not been found out yet (like gcd=3 in the case of 6).

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

sorting arrays was a pretty nice questions wasn't able to solve it though :3

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

    Thanks a lot, glad you liked it :)

    Btw my favorite problem from the set was MAXIMISEBITS.

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

Thank you, that's a great contest loved the problem. Hoping that in the upcoming contest few problems revolve around data structure, dp or graph. But constructive or greedy questions are best in Codechef Kudos to the team... Got Rank 10 :)

→ Reply