We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Now to gives 11 of 12 and I know the 6 case of red is not counting this is very simple code I dont want working code but Can i have a good tutorial link for @gosh_saikat4000 comment ::
"Look up matrix exponentiation. Learn how to find the n-th term of a linear recurrence in O(log n) time.
"::
or any suggestion to modify my code?
thanks waiting...
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #116: Red, green or blue tiles
You are viewing a single comment's thread. Return to all comments →
Can any one help me. My code :-
Now to gives 11 of 12 and I know the 6 case of red is not counting this is very simple code I dont want working code but Can i have a good tutorial link for @gosh_saikat4000 comment :: "Look up matrix exponentiation. Learn how to find the n-th term of a linear recurrence in O(log n) time. ":: or any suggestion to modify my code? thanks waiting...