Ported the modular series into c++.

Author: TheRealDeath

cpp_scripts/mathematical_algorithms/binary_exponentiation.cpp

@@ -20,8 +20,7 @@ long long modulo_binpow(long long a, long long b, long long m)
   long long res = 1;
   while (b > 0)
   {
-    if (b & 1)
-      res = res * a % m;
+    if (b & 1) res = res * a % m;
     a = a * a % m;
     b >>= 1;
   }

cpp_scripts/mathematical_algorithms/modular_series/modular_exponentiation.cpp

@@ -0,0 +1,14 @@
+int modExp(int x, int y, int p)
+{
+	int res = 1;
+	int x = x%p;
+	if(x == 0) return 0;
+	while(y > 0)
+		if((y&1) == 1)
+		{
+			res = (res*x) % p;
+			y >>= 1;
+			x = (x*x) % p;
+		}
+	return res;
+}

cpp_scripts/mathematical_algorithms/modular_series/modular_factorial.cpp

@@ -0,0 +1,8 @@
+int modFact(int n, int p)
+{
+	if(n >= p) return 0;
+	int result = 1;
+	for(int i = 1;i<n+1;i++)
+		result = (result*i) % p;
+	return result;
+}

cpp_scripts/mathematical_algorithms/modular_series/modular_inverse.cpp

@@ -0,0 +1,9 @@
+int modInverse(int a, int m)
+{
+	int m0 = m, y = 0, x = 1;
+	if(m == 1) return 0;
+	while(a > 1)
+		int q = a/m, t = m, m = a%m, a = t, t = y, y = x-q*y,x = t;
+	if(x < 0) x = x + m0;
+	return x;
+}

java_scripts/mathematical_algorithms/fibonacci.java

@@ -9,14 +9,8 @@ int fib(int n)
   }
   void multiply(int F[][], int M[][])
   {
-    int x =  F[0][0]*M[0][0] + F[0][1]*M[1][0];
-    int y =  F[0][0]*M[0][1] + F[0][1]*M[1][1];
-    int z =  F[1][0]*M[0][0] + F[1][1]*M[1][0];
-    int w =  F[1][0]*M[0][1] + F[1][1]*M[1][1];
-    F[0][0] = x;
-    F[0][1] = y;
-    F[1][0] = z;
-    F[1][1] = w;
+    int x =  F[0][0]*M[0][0] + F[0][1]*M[1][0], y =  F[0][0]*M[0][1] + F[0][1]*M[1][1], z =  F[1][0]*M[0][0] + F[1][1]*M[1][0], w =  F[1][0]*M[0][1] + F[1][1]*M[1][1];
+    F[0][0] = x, F[0][1] = y, F[1][0] = z, F[1][1] = w;
   }
    void power(int F[][], int n)
   {