yash_daga's blog

Invitation to CodeChef Starters 102 (Rated till 6-stars) — 27th September
By yash_daga, history, 3 years 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

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

Text editorial are also for pro users only?

→ Reply
»
3 years ago, hide # |
 
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
»
3 years ago, hide # |
← Rev. 2  
Vote: I like it +3 Vote: I do not like it

What does exactly mean in problem C?

→ Reply
  • »
    »
    3 years ago, hide # ^ |
     
    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
  • »
    »
    3 years ago, hide # ^ |
    ← 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
»
3 years ago, hide # |
 
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
»
3 years ago, hide # |
 
Vote: I like it +18 Vote: I do not like it

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

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

Loved Parity Permutation.

→ Reply