WA in "Chef And his Cake" (GIT01)

[gemini_code]

problem link: GIT01 Problem - CodeChef
my code CodeChef: Practical coding for everyone

[everule1]

That’s not your submission link.

[gemini_code]

I have updated it . plz look into it

[everule1]

Try

1
2 3
RGR
RGR

[everule1]

Try drawing a 2*3 grid and tell me how many valid configurations you were able to find.

[gemini_code]

output is coming 0

[everule1]

GIT01 - Editorial

PROBLEM LINK: Practice Contest Author: Gitesh Narula Tester: Mugurel Ionut Andreica Editorialist: Kirill Gulin PROBLEM You’re given a cake in a form of the N \times M matrix. Each cell of the cake can be either red or green. The cake is considered correct if any two adjacent cells of the matrix are different. You can change any green cell of the given cake to red in 3 units of penalty and red to green in 5 units. Determine the minimum penalty you need to make your cake correct. QUICK EXPLA…

[gemini_code]

i get it that i can solve it by making a matrix but is there a way to solve the problem without forming a matrix?

[everule1]

@everule1

Try drawing a 2*3 grid and tell me how many valid configurations you were able to find.

Did you at least try this?

[gemini_code]

yeah i got it thanks…