Merge pull request #2875 from 19WH1A0524/master

Updated Matrix_Expo.mdx with python code

Author: SansPapyrus683

content/5_Plat/Matrix_Expo.mdx

@@ -83,7 +83,11 @@ $$
 The base case is true, and the induction step is true. Therefore the formula
 holds for all $n \in \mathbb{N}$.
 
-### Implementation
+<LanguageSection>
+
+<CPPSection>
+
+## Implementation
 
 **Time complexity:** $\mathcal{O}(\log n)$
 
@@ -124,7 +128,46 @@ int main() {
 	cout << base[0][1];
 }
 ```
+</CPPSection>
+
+<PySection>
+```python
+from typing import List
+
+MOD = 10 ** 9 + 7
+
+def mul(A : List[List[int]], B : List[List[int]], MOD : int) -> List[List[int]]:
+	C = [[0, 0], [0, 0]]
+    	for i in range(2):
+        	for j in range(2):
+			for k in range(2):
+				C[i][j] += ((A[i][k]) * (B[k][j])) % MOD
+    	return C
+
+def power(matrix : List[List[int]], n : int) -> List[List[int]]:
+	if n == 0:
+		return [[1, 0], [0, 1]]
+	if n == 1:
+		return matrix
+	half = power(matrix, n // 2, MOD)
+	square = mul(half, half, MOD)
+	if n % 2 == 0:
+		return square
+	return mul(matrix, square, MOD)
+ 
+ 
+n = int(input())
+if n == 0:
+  	print(0)
+elif n > 2:
+    	o = power([[1, 1], [1, 0]], n - 1)
+    	print(o[0][0] % MOD)
+else:
+    	print(1)
 
+```
+</PySection>
+</LanguageSection>
 ## Problems
 
 <Problems problems="probs" />