I assume he at least know and has read through the basics and just needs an example illustrating them.
1 Like
thanks for answering and it helped my solution finally got accepted with 100pts.
Reported the issue. Thank you.
Reported the issue. Thank you.
Hi, Now I think that there’s some issue with the question as when I copy pasted the official solution and submitted, it got TLE as well. I am doing this to complete my A2OJ ladder, is there any other way I can get around this?
You are welcome. 
If you get any update in future please post.
Your question has been updated. Its under title “Please help me in CHEFSIGN”. Please refer there henceforth.
Once my exams get over, I definitely will (if the Q isnt answered). Just remind me.
Can’t even ask a question independently… sigh Where are you reputation points?
This editorial will help you.
Link : Unofficial editorial December long challenge - editorial - CodeChef Discuss
This question has been answered multiple times.Please do a search before asking the question or ranting on the system. Multiple questions on same thing just degrade the forum quality.
Notice that there are only 2 patterns of cakes possible. Like, if cake is 3x3 matrix, then possible configurations are-
RGR
GRG
RGR
and
GRG
RGR
GRG
Just find which configuration gives minimum cost.
Thanks alot got it!
Your code fails here-
Input
1
5
10000
Your output
2
Expected Output
3
Thanx alot @vijju123, you helped me alot. btw i had made an error like ‘0’ (char)instead of 0(int). and also i didnt prepare for testcase i string was just 1. Thanks a ton! You have helped me alot :). If You are on codefights add me name- llgokull l==‘el’ not 1(one)
Please google these type of questions.
Consider this TC:
2
aa
aa
Expected o/p: aa
Your code gives: Draw
Hope this helps.
2 Likes
Ask these questions here (I will upgrade them into independent thread if approved) till you get 3 karma to ask your own questions. We dont downvote questions at all until they are serious violations or really repetitive questions.
That actually is a complicated code XD. You can mail me requests to add comments to my code, in case I fail to see it here.
My solution essentially tries to speed up the brute force task. Bucket is made of 3 things- buckxor (xor of bucket), xors (a sort of carry over. If element i is updated from x to y, then whats the effect of it over xor of future buckets? The “original” or “prefix-xor” becomes (original^x^y). [The x removes contribution of x in original, and then we xor y]).
The map is like: mp[i]=number of sub arrays with xor i. Rest of code is how we can perform queries using these.
Yeah okay , from which problems should i start with to improve my programming skills so as to solve problems like these say easy-medium , I can solve pretty much first 3 to 4 in long challenges after that it just becomes tough
TY in advanced 