We invite you to participate in CodeChef’s Starters146, this Wednesday, 7th August, rated upto 5 stars (i.e. for users with rating < 2200)
Time: 8:00 PM — 10:00 PM IST
Joining us on the problem-setting panel are:
Setters: Kanhaiya notsoloud1 Mohan, Harsh harsh__h, Samman gam_bit Sarkar, Shubham shubhamgrg1000 Garg, Ashish Kryptonix Gangwar
Tester: Manan mexomerf Grover
Text Editorialists:Nishank IceKnight1093 Suresh.
Statement Verifier:Nishank IceKnight1093 Suresh.
Contest Admin :Yash yash_daga Daga.
Note: Some problems have subtasks
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.
.
I am not fond of the second subtask of BINSTRAGAIN. It appears that a constant factor was quite tight in this problem. The fastest AC is nearly half the time limit and most ACs are even slower. Please think twice before setting such tight constraints again.
Implementing BACKFRONT is literally not fun, I gave up not because it's hard just so many conditions I mean at least reduce the length of the subsequences to make it bearable but nice contest overall
NVM I just found a better solution than the stupidity I've been doing
I tried to implement every possible combination with brute force.
i ended up with a wrong solution with 250+ line of codes. submission
just keep searching longest suffix of "back" and prefix of "front" in the original string until running out characters.
I submitted this just 1 min post contest, was missing the remainder thing, 115 lines tho.
Less than 60 LOC
Another short solution — https://www.codechef.com/viewsolution/1078538952
I don't see the editorial?
Also for the "Connect the Chains", I came up with a solution where we only connect the middle 2 nodes of 1 chain with either of the middle 2 of next. This way I can solve it using dp. Why is this solution wrong?