yash_daga's blog

Invitation to CodeChef Starters 102 (Rated till 6-stars) — 27th September
By yash_daga, history, 7 months ago, In English

We invite you to participate in CodeChef’s Starters 102, this Wednesday, 27th September, rated till 6-stars (ie. for users with rating < 2500).

Time: 8:00 PM — 10:00 PM IST

Read about the recent judge migration here.

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

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

Text editorial are also for pro users only?

→ Reply
  • »
    »
    7 months ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    CodeChef is gradually losing it's regular users..

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

    They're available for non pro users also, on discuss.codechef.com. Direct contest editorial link is there on contest homepage when contest ends.

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

Light The Bulb was identical to recent problem from Hackerearth September Circuits. Link

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

    Thanks for pointing this out. We are looking into it, and will update.

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

      It was indeed a Notorious Coincidence. We apologize for the oversight. The proposer has been banned from the platform.

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

What does exactly mean in problem C?

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

    You have to do 2 moves,no more no less even if the strings are equal initially.

    → Reply
  • »
    »
    7 months ago, # ^ |
    ← Rev. 13   Vote: I like it 0 Vote: I do not like it

    Casework: At the position where t[i]!=s[i], we have to definitely apply a single operational and at the position where characters are equal, we can apply no operational or two operations. Consider 1 when t[i]=s[i] otherwise 0. Then count the number of continuous 0 and 1. Let them be c1 and c2 then:

    x=total number of 1 and y=total number of 0

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

Can anyone tell my mistake in this code for " Chef Segment " problem

https://www.codechef.com/viewsolution/1023144006

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

My solution to problem Array Sum relied on taking the max element if possible starting from 1e5, regardless of value of N. I expected it to TLE, if there are lot of tests with small value of sum required. Wherein, I will start from 1e5 in each one of them. But my solution got Accepted. Can someone explain why this works or are the test cases weak?

Edit : I think it passed because there are only 1000 test cases max. If there were more, I expect it to TLE, at least with strong tests cases.

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

Really enjoyed the problem set today.CHESSELO was so cute.Magnus orz.

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

Loved Parity Permutation.

→ Reply