CAKEDOOM - Editorial

editorial
, , ,
21

I used recursive backtrack to get to the final solution if the initial lexicographically smallest solution is proved invalid. Doesn’t need to consider any cases. My Solution

22

I think this was giving me a few wrong answers initially :slight_smile:

23

Hi, can anyone pls help me in finding the test case for which my solution is failing? http://www.codechef.com/viewsolution/1128186 is my solution. Thanks in advance.

24

Finally I managed to solve it! Thanks to the editorial team :smiley:
My test case was failing only for: n=1

Here’s my solution if anyone’s interested:

http://www.codechef.com/viewsolution/1128650

25

Code-http://ideone.com/h6wzu

@probsetter-can u tell me which cases of test file my code fails?..:?
thnx in adv…

26

Please Someone Help me and find a testcase for which my code will not work.

http://www.codechef.com/viewsolution/1130018

27

Can someone please explain why this is failing http://www.codechef.com/viewsolution/2660229

28

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

where am i wrong pls help

29

I am getting wrong answer. can anyone please tell me, which test case does my code fail?
I have tried all aforementioned test cases.

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

30

Any idea why this is not working?

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

31

Just a query : for the test case where K=1 and S=“5” , the output must be “NO”, right?
But I just observed that few solutions that got AC , have the output as “0” for the above test case.
Please explain?
P.S : Correct me if I am wrong :slight_smile:

32

I am a little late to the party, but can someone please help me with what is wrong with my solution. I have read the editorial and fail to see what am I doing differently, which is causing WA for my solution. Please help :slight_smile:
https://www.codechef.com/viewsolution/23607275