learn22coding
diff --git a/‎Implementations/content/numerical/Polynomials/Poly.h
Copy file name to clipboardExpand all lines: Implementations/content/numerical/Polynomials/Poly.h
+4-4Lines changed: 4 additions & 4 deletions b/‎Implementations/content/numerical/Polynomials/Poly.h
Copy file name to clipboardExpand all lines: Implementations/content/numerical/Polynomials/Poly.h
+4-4Lines changed: 4 additions & 4 deletions
diff --git a/‎Implementations/content/numerical/Polynomials/PolyInvSimpler.h
Copy file name to clipboardExpand all lines: Implementations/content/numerical/Polynomials/PolyInvSimpler.h
+2-2Lines changed: 2 additions & 2 deletions b/‎Implementations/content/numerical/Polynomials/PolyInvSimpler.h
Copy file name to clipboardExpand all lines: Implementations/content/numerical/Polynomials/PolyInvSimpler.h
+2-2Lines changed: 2 additions & 2 deletions
@@ -58,7 +58,7 @@ poly operator*(const poly& l, const poly& r) {
 }
 poly& operator*=(poly& l, const poly& r) { return l = l*r; }
 
-pair<poly,poly> quoRem(poly a, poly b) { 
+pair<poly,poly> quoRemSlow(poly a, poly b) { 
 	remz(a); remz(b); assert(sz(b));
 	T lst = b.bk, B = T(1)/lst; each(t,a) t *= B; 
 	each(t,b) t *= B;
@@ -69,11 +69,11 @@ pair<poly,poly> quoRem(poly a, poly b) {
 	return {q,a}; // quotient, remainder
 }
 poly operator%(const poly& a, const poly& b) { 
-	return quoRem(a,b).s; }
+	return quoRemSlow(a,b).s; }
 /**poly operator/(const poly& a, const poly& b) { 
-	return quoRem(a,b).f; }
+	return quoRemSlow(a,b).f; }
 poly a = {1,3,5,8,6,0,0,0,0}, b = {1,5,1};
-ps(quoRem(a,b)); a = 2*a, b = 2*b; ps(quoRem(a,b));
+ps(quoRemSlow(a,b)); a = 2*a, b = 2*b; ps(quoRemSlow(a,b));
 poly gcd(poly a, poly b) { return b == poly{} ? a : gcd(b,a%b); }*/
 T resultant(poly a, poly b) { // R(A,B)
 	// =b_m^n*prod_{j=1}^mA(mu_j)
 
@@ -29,7 +29,7 @@ poly sqrt(const poly& A, int n) {  // Q-(Q^2-A)/(2Q)
 	return RSZ(B,n);
 }
 // return {quotient, remainder}
-pair<poly,poly> divi(const poly& f, const poly& g) {
+pair<poly,poly> quoRem(const poly& f, const poly& g) {
 	if (sz(f) < sz(g)) return {{},f};
 	poly q = conv(inv(rev(g),sz(f)-sz(g)+1),rev(f));
 	q = rev(RSZ(q,sz(f)-sz(g)+1));
@@ -52,4 +52,4 @@ poly exp(poly A, int n) { assert(A[0] == 0);
 // 	while (sz(B) < n) { int x = 2*sz(B);
 // 		B = RSZ(B+conv(B,RSZ(A,x)-log(B,x)),x); }
 // 	return RSZ(B,n);
-// }
+// }