KMP automaton + correcting some encoding problems

Author: chinchila

code/geometry/halfplaneIS.cpp

@@ -1,5 +1,5 @@
 // Half plane intersection O(n*log(n))
-// lines must be ccw (anti-horário)
+// lines must be ccw (antihorario)
 
 #include "point.h"
 #include "lineIntersection.cpp"

code/string/kmpautomaton.cpp

@@ -0,0 +1,42 @@
+// trans = transition
+struct trans {
+	int m, to[MAXN], match[MAXN];
+	trans(int _m = -1) : m(_m) {}
+};
+
+trans operator +(trans a, trans b) {
+	if (b.m < 0) return a;
+	if (a.m < 0) return b;
+	trans c(a.m);
+	for(int i = 0; i < c.m; i++) {
+		c.to[i] = b.to[a.to[i]];
+		c.match[i] = (a.match[i] + b.match[a.to[i]])%MOD;
+	}
+	return c;
+}
+
+struct KMP {
+	string P;
+	int b[MAXN], m;
+	void build(string &_P) {
+		P = _P;
+		m = P.size();
+		memset(&b, -1, sizeof b);
+		for(int i = 0, j = -1; i < m;) {
+			while (j >= 0 && P[i] != P[j]) j = b[j];
+			b[++i] = ++j;
+		}
+	}
+	trans get(char c) {
+		trans ans(m);
+		for(int i = 0, j, cnt; i < m; i++) {
+			j = i; cnt = 0;
+			while(j >= 0 && c != P[j]) j = b[j];
+			j++;
+			if (j == m) cnt++, j = b[j];
+			ans.to[i] = j;
+			ans.match[i] = cnt;
+		}
+		return ans;
+	}
+};

contents.txt

@@ -10,7 +10,7 @@ number_theory/pollard.cpp	Pollard Rho
 number_theory/totient.cpp	$\phi$ of Euler
 number_theory/prime_factors.cpp	Compute prime factors
 number_theory/finite_field.cpp	Finite Field operations
-number_theory/modular_sqrt.cpp  Modular squareroot (Tonelli-Shanks)
+number_theory/modular_sqrt.cpp	Modular squareroot (Tonelli-Shanks)
 
 [Numeric]
 numeric/binomial.cpp	Binomial
@@ -22,7 +22,7 @@ numeric/gauss.cpp	Gaussian elimination
 numeric/karatsuba.cpp	Karatsuba
 numeric/incexc.cpp	Inclusion-Exclusion principle
 numeric/lagrangepoly.cpp	Lagrange polynomial interpolation
-numeric/floorsum.cpp    Floor-sum
+numeric/floorsum.cpp	Floor-sum
 
 [Graph algorithms]
 graphs/dijkstra.cpp	Dijkstra Shortest path
@@ -57,9 +57,9 @@ graphs/chromatic.cpp	Chromatic Number
 graphs/dynamic_reachdag.cpp	Dynamic reachability in DAG
 graphs/kshortest.cpp	K-ShortestPaths
 graphs/func_lenha.cpp	Functional graphs
-graphs/mstdir.cpp   Minimum arborescence (MST digraph)
-graphs/steinertree.cpp  Minimum Steiner tree
-graphs/erdos.cpp    Erdos Gallai theorem
+graphs/mstdir.cpp	Minimum arborescence (MST digraph)
+graphs/steinertree.cpp	Minimum Steiner tree
+graphs/erdos.cpp	Erdos Gallai theorem
 
 [Data structures]
 data_structures/sparseTable.cpp	Sparse Table
@@ -132,9 +132,9 @@ geometry/Angle.cpp	Angle sorting
 geometry/kdTree.cpp	K-D Tree
 geometry/point3d.cpp	Point3D
 geometry/3dhull.cpp	Convex hull 3D
-geometry/halfplaneIS.cpp Half Plane Intersection
-geometry/rayDistance.cpp    Ray(semi-reta) distance
-# geometry/GeometryRusso.cpp  Another Geometry lib
+geometry/halfplaneIS.cpp	Half Plane Intersection
+geometry/rayDistance.cpp	Ray(semi-reta) distance
+# geometry/GeometryRusso.cpp	Another Geometry lib
 
 [Java]
 Java/template.java	Template