Pols_Agyi_Pols's blog

Invitation to CodeChef Starters 145(Rated till 6-Stars) — 31st July
By Pols_Agyi_Pols, 3 months ago, In English

We invite you to participate in CodeChef’s Starters145, this Wednesday, 31st July, rated till 6-Stars(ie. for users with rating < 2500).

Time: 8:00 PM — 10: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 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
  • +92
  • Vote: I do not like it

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

Waiting for comment of nskybytskyi on the problem TOKTREE.

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

Today's problems were actually interesting! Thank you :)

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

Waiting for rating update ;)

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

I misunderstood something. Don't want others to confuse

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

    For bits of X that are not set, you can not change those bits in A[i]. So, you should find the highest set bit in X that satisfies the condition.

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

Math and strings,they always kill me

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

very nice contest, square string was very fun to solve

→ Reply