We invite you to participate in CodeChef’s Starters130, this Wednesday, 17th April, rated for 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:

- Setters: Archit Pols_Agyi_Pols Kumar, Vaibhav kingmessi Khater, Nitish _helloLad Kumar.

Tester: Aryaman WAtoAC2001 Das.

Text Editorialists:Nishank IceKnight1093 Suresh.

Statement Verifier: Nishank IceKnight1093 Suresh.

Contest Admin : Mridul MridulAhi Ahi.

Special Thanks to MadRat_0, sv1shan, K_queries and Atekichan for helping in problem preparation and their valuable feedback.

**CodeFest'24** is the technical fest of the Computer Science and Engineering Department of IIT BHU, and this contest is conducted under its Competitive Programming event **Manthan**.

Note: Prizes are only for Indian participants (for division 1 only).

Winner: $$$25,000$$$ INR

$$$1^{st}$$$ runner up: $$$20,000$$$ INR

$$$2^{nd}$$$ runner up: $$$10,000$$$ INR

Rank $$$4^{th}$$$ to $$$8^{th}$$$: $$$1,000$$$ INR

Please fill out this form to avail them. You will receive the prizes within 7 working days for transfers within India.

Details of other events organized under **CodeFest'24** can be found here.

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!

**UPD:** Editorial is out.

codechef should add "powered by IIT-BHU" to their site

As someone who gave valuable feedback this round, I can assure you that the problems are great. Yet another Pols_Agyi_Pols contest. ORZ!

sv1shan orz

IIT BHU orz

After thorough investigation, I can assure that no objects were harmed during the creation of this contest.

As a tester the problems are fun to solve!

WAtoAC2001 orz

I am going to pretend enjoying case work this time.

cant wait for this contest

MridulAhi Orz

AdminEnjoyed every problem, thanks to CodeChef.

feeling so dumb after reading editorial for append array :(

Am I the only fool in the planet who solved

Good Binary StringProblem through Dp?my dp solution

Thrill_ForcesLove it

Can someone please share UPDA solution by modifying Kadane's algorithm ? UPD: nvm I am dumb.

We can find the subarray of length atleast greater than 1 (since L < R) with minimum sum by Kadane algorithm.

let that minimum sum = mn.

If mn < 0 add 2*abs(mn) to the sum of all elements of the array

I was facing issues in calculating that min sum.

codevectordp(N,INF);

dp[0]=0;

int mn=INF;

for(int i = 1 ; i < n ;i++)

dp[i]=min( dp[i-1] + a[i] , a[i -1] + a[i] );

mn =min (mn , dp[i] );

I did this but it is ging WA

can you tell me why — https://www.codechef.com/viewsolution/1056550344

or any tc where it will fail

It was a nice problemset, loved the question UPDA!!!