Pols_Agyi_Pols's blog

Invitation to CodeChef Starters 168(Rated upto 6 stars) — 8th January
By Pols_Agyi_Pols, 45 hours ago, In English

We invite you to participate in CodeChef’s Starters 168, this Wednesday, 8th January, rated upto 6 stars (i.e. for users with rating < 2500).

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

»
17 hours ago, # |
  Vote: I like it +21 Vote: I do not like it

As a participant, I was compelled to write Rudra_1232 orz

→ Reply
  • »
    »
    15 hours ago, # ^ |
      Vote: I like it +21 Vote: I do not like it

    JAY19 orz

    → Reply
    • »
      »
      »
      14 hours ago, # ^ |
        Vote: I like it +9 Vote: I do not like it

      nikT orz

      → Reply
»
16 hours ago, # |
← Rev. 2   Vote: I like it -11 Vote: I do not like it

Contest starts in ~30 mins.

→ Reply
»
15 hours ago, # |
  Vote: I like it +4 Vote: I do not like it

I rushed through traffic and reached early for this but found out it is casually delayed by 30 minutes. I wonder what did you realize 10 minutes before the start that could not have been addressed earlier?

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

The contest will start 30 minutes late due to a technical issue. We are sorry for the inconvenience.

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

is the website down?

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

wack site

→ Reply
»
14 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

website down again??

→ Reply
»
13 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

equate xor was so tough

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

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

I felt I was so close on XOP but could not optimize the O(N2) solution. Great contest regardless and the editorial is well written too. Thanks!

→ Reply
»
12 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

man for first 15 min I was thinking website is not working cause I was submitting correct code and getting runtime error then my dumbass realized i am submitting c++ code in python option . and I hate bit manipulation

→ Reply
»
12 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Can we please get fewer problems involving all subarrays of a certain array? The summing-up part is often purely technical and doesn't contribute new ideas. As a compromise option, I propose always including the easy version with the entire array only. REVALT and REVALTCT is a recent example done right in my book.

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

Equate xor was very hard,I couldn't do it

→ Reply