We invite you to participate in CodeChef’s Starters143, this Wednesday, 17th July, rated for till 5-Stars(ie. for users with rating < 2200).

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

Joining us on the problem setting panel are:

- Setters: Shreyan Dominater069 Ray, Aditya Everule Jain, Kanhaiya notsoloud1 Mohan.
- Tester:Apoorv tyr0Whiz Kumar.

Text Editorialists:Nishank IceKnight1093 Suresh.

Statement Verifier:Kanhaiya notsoloud1 Mohan.

- Contest Admin : Shreyan Dominater069 Ray.

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.

The following is the count of problems in each division :

- Division 1 : 5 problems
- Division 2 : 6 problems
- Division 3 and 4 : 7 problems

Good Luck!

UPD : Congratulations to the top 5!

I see what you've done there, stealing contribution from the contest admin yash_daga! /j

Oops

Bro just eliminated the problem!!

Auto comment: topic has been updated by Dominater069 (previous revision, new revision, compare).Dominater round

C++23 when

Before GTA 6

interesting problems!!

good problems

Can someone help me find the bug in my code for Binary Conversion? I can't seem to find what's wrong with the code. A small counterexample would be appreciated.

Edit: nevermind, generated testcases against a correct solution and found the bug

ig if you take like this s = 0 0 t = 0 0 here for any value of k>=1 the value will be YES, becoz you can swap adjacent ele any no of times. but your code is giving YES only for even k

The last TC was for S1==S2 which you have to consider separately. If S1==S2 then if k is even the always possible else if k is odd then length should bhe greater than 2.e.g. 1001 , 1001 both value of k=3 and k=4 will work.This only case wasted my 15 minutes.Hope it helps :)

Can someone tell me how do you solve LEXMINBIN from yesterday's contest? Thanks

Editorial

Thank you!

Nice problems!