radoslav11's blog

Invitation to CodeChef May Cook-Off 2021
By radoslav11, history, 3 years ago, In English

We invite you to participate in CodeChef’s May Cook-Off, this Sunday, 23rd May, from 9:30 PM — 12:00 AM IST

The May Cook-Off will have Junglee Games as the official contest recruiter! They are looking for SDE II & III Backend, SDE II & III Data, and SDE II Frontend roles for their fast-paced environment.

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 me on the problem setting panel are:

Prizes:

The winners will receive CodeChef laddus with which they can claim cool CodeChef goodies. Know more here.

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.

Important Update

Did you create multiple usernames with CodeChef in the past? If yes, here's an update. We now have a portal where you get to see all your usernames so that you can delete all and keep the best one for you.

Hope to see you participating. Good Luck!

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

Comments Comments (14)
| Write comment?
»
3 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

Did you create multiple usernames with CodeChef in the past? If yes, here's an update. We now have a portal where you get to see all your usernames so that you can delete all and keep the best one for you How to access this portal? Also, can anyone view our fake accounts :P ?

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

    They are talking about multiple accounts created with same email id. You can find yours here.

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

      Why did they even allow to make multiple accounts with same email-id in the first place?

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

clashes with opencup :(

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

Can we expect a balanced problemset?

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

How to solve permutation swaps ? Also the mistake in this problem wasted good amount of time.

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

    We can make the permutation operation k times in logk by binary lifting. So, we make a "reverse permutation", then calculate for the operations 2 and 3 the indexes of the elements by doing k steps in that reversed permutation.

    submission

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

Somebody explain FLGZRO ?

How to calculate the contribution per leaf node? If a[i] would be distinct, it would be simply $$$2^{lenOfPath}$$$, but how do we consider not distinct a[i] in the path?

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

Does anyone have the working link to the rating predictor of Codechef? The links that I find don't work

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

How to solve permutation swaps?

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

https://www.codechef.com/COOK129A/problems/MAXXMIN Is there a way to remove logN in this problem which was because of last occurence of some number ??

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

Double Burgers was a super problem.Really loved it.

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

I think I have seen the similar problem :- chef and subarray (div 2-B) on codeforces

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

Editorials for all problems except MAXXMIN posted at https://discuss.codechef.com/tag/cook129.

I hope you guys had a nice contest.

→ Reply