I just solve this but want know more efficient way to do matrix multiplicationM :------1 1 00 0 53 2 0 f[n] = M^n I have implemented using Exponentiation_by_squaringIs there more efficient then this ? 
optimise my solution
java;dynamic programming;process improvement