test bébé lagrange, marche pas

reed_solomon.py

@@ -21,8 +21,21 @@ def get_possibilities(l: list):
 
 	return p
 
+# l : List of tuple (x, y)
 def lagrange_compute(l: list) -> polynome:
-	pass
+	# Produit de k = 0 > n
+	# bébé lagrange pour premier tuple choisit
+	from inverse_mult import inverse_mult
+
+	x = l[0][0]
+	coefs = []
+	for i, t in enumerate(l):
+		if(x != l[i][0]):
+			print(f"")
+			print(f"{t[0] * x} / inverse({x - t[0]} - 229)")
+			coefs.append(t[0] * inverse_mult(x - t[0], 229))
+	print(f"DEBUG {coefs}")
+	return polynome(coefs)
 
 def check_nb_error(l: list, p: polynome) -> int: