Refactor algorithms and add some stuff

Signed-off-by: Bruno Freitas Tissei bft15@inf.ufpr.br

algorithms/math/linear_recurrence.cpp

@@ -25,13 +25,15 @@
  *   [x1  x2]^n
  *   [ 1   0]
  */
-matrix solve(ll x, ll y, ll n) {
-  matrix in(2);
+template <typename T>
+matrix<T> solve(ll x, ll y, ll n) {
+  matrix<T> in(2);
 
+  // Example
   in[0][0] = x % MOD;
   in[0][1] = y % MOD;
   in[1][0] = 1;
   in[1][1] = 0;
 
-  return fast_pow(in, n);
+  return fast_pow<T>(in, n);
 }