When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

Night_Lord's blog

By Night_Lord, history, 3 years ago, In English

Hello,need idea for this problem from SPOJ SEQ — Recursive Sequence . I am really new in matrix exponentiation learning.Here I learnt from this blog T matrix for the test case-

3 
1 2 3 
4 5 6 
6

is T=

0 1 0
0 0 1
6 5 4

Then I multiply T with Identity matrix I.For me the answer should store in I[n-1][n-1].But maybe here I am missing something which I clearly missing completly.I searched in google and github but could not get a satisfactory answer.

my code
  • Vote: I like it
  • 0
  • Vote: I do not like it

| Write comment?