There are N petrol pumps along a circular path. Every petrol pump
gives some amount of fixed petrol. Need not to be unique and in no
particular order means it is random. We have a car and we need to find
a petrol pump which can provide so much of petrol that we can take a
full of the circle. Mileag
Using Matrix Exponentiation technique
Complexity is n^3*(lg n) for matrix n x n
we need two n x n matrix to raise the matrix to power K ..
Correct me if am wronf
On Wed, Jan 12, 2011 at 6:28 PM, bittu wrote:
> How will you raise a n x n matrix to the power k efficiently. What's
> the time complex
How will you raise a n x n matrix to the power k efficiently. What's
the time complexity and space complexity of you algorithm? How will
you optimize this?
Thanks &Regards
Shashank "Don't b Evil U Can Earn While U Learn"
--
You received this message because you are subscribed to the Google Grou
