reformatted lineendings

42 files changed, 42 insertions, 42 deletions

diff --git a/datastructures/LCT.cpp b/datastructures/LCT.cpp
index aef45f7..fde052d 100644
--- a/datastructures/LCT.cpp
+++ b/datastructures/LCT.cpp
@@ -175,4 +175,4 @@ struct LCT {
 		expose(to);
 		to->delta = joinDeltas(to->delta, delta);
 	}
-};
\ No newline at end of file
+};
diff --git a/datastructures/RMQ.cpp b/datastructures/RMQ.cpp
index 8e5cc3f..401cca4 100644
--- a/datastructures/RMQ.cpp
+++ b/datastructures/RMQ.cpp
@@ -24,4 +24,4 @@ int query(int l, int r) {
 	if(l >= r) return l;
 	int s = __lg(r-l); r = r - (1 << s);
 	return select(rmq[s][l],rmq[s][r]);
-}
\ No newline at end of file
+}
diff --git a/datastructures/persistentArray.cpp b/datastructures/persistentArray.cpp
index 665d908..2db0e73 100644
--- a/datastructures/persistentArray.cpp
+++ b/datastructures/persistentArray.cpp
@@ -23,4 +23,4 @@ struct persistentArray{
 		}

 		time = t;

 	}

-};
\ No newline at end of file
+};

diff --git a/datastructures/sparseTable.cpp b/datastructures/sparseTable.cpp
index 40057bd..cf21e9a 100644
--- a/datastructures/sparseTable.cpp
+++ b/datastructures/sparseTable.cpp
@@ -21,4 +21,4 @@ struct SparseTable {
 		return better(st[j][l] , st[j][r - (1 << j)])
 		            ? st[j][l] : st[j][r - (1 << j)];
 	}
-};
\ No newline at end of file
+};
diff --git a/geometry/formulars3d.cpp b/geometry/formulars3d.cpp
index 65aba4a..84e17c0 100644
--- a/geometry/formulars3d.cpp
+++ b/geometry/formulars3d.cpp
@@ -50,4 +50,4 @@ double lineLineDist(pt3 a, pt3 b, pt3 c, pt3 d) {
 	pt3 n = cross(b - a, d - c);
 	if (abs(n) < EPS) return distToLine(a, b, c);
 	return abs(dot(a - c, n)) / abs(n);
-}
\ No newline at end of file
+}
diff --git a/geometry/segmentIntersection.cpp b/geometry/segmentIntersection.cpp
index 14b9586..b2e3ac4 100644
--- a/geometry/segmentIntersection.cpp
+++ b/geometry/segmentIntersection.cpp
@@ -60,4 +60,4 @@ pair<int, int> intersect(vector<seg>& segs) {
 		}
 	}
 	return {-1, -1};
-}
\ No newline at end of file
+}
diff --git a/geometry/sortAround.cpp b/geometry/sortAround.cpp
index c5e4ebd..86fead7 100644
--- a/geometry/sortAround.cpp
+++ b/geometry/sortAround.cpp
@@ -7,4 +7,4 @@ void sortAround(pt p, vector<pt>& ps) {
 			return left(a - p) > left(b - p);

 		return cross(p, a, b) > 0;

 	});

-}
\ No newline at end of file
+}

diff --git a/graph/articulationPoints.cpp b/graph/articulationPoints.cpp
index e173355..0df1eeb 100644
--- a/graph/articulationPoints.cpp
+++ b/graph/articulationPoints.cpp
@@ -42,4 +42,4 @@ void findArticulationPoints() {
 			rootCount = 0;
 			dfs(v);
 			isArt[v] = rootCount > 1;
-}}}
\ No newline at end of file
+}}}
diff --git a/graph/bitonicTSP.cpp b/graph/bitonicTSP.cpp
index 3dea828..e8fc2cb 100644
--- a/graph/bitonicTSP.cpp
+++ b/graph/bitonicTSP.cpp
@@ -28,4 +28,4 @@ void bitonicTSP() {
 	reverse(all(lt));
 	lt.insert(lt.end(), all(ut));
 	//return lt;// Enthält Knoten 0 zweimal. An erster und letzter Position.
-}
\ No newline at end of file
+}
diff --git a/graph/bitonicTSPsimple.cpp b/graph/bitonicTSPsimple.cpp
index 4bd5ef3..7a0c3c8 100644
--- a/graph/bitonicTSPsimple.cpp
+++ b/graph/bitonicTSPsimple.cpp
@@ -25,4 +25,4 @@ void bitonicTour() {
 	lr.insert(lr.end(), rl.rbegin(), rl.rend());
 	// Enthält Knoten 0 zweimal. An erster und letzter Position.
 	// return lr;
-}
\ No newline at end of file
+}
diff --git a/graph/blossom.cpp b/graph/blossom.cpp
index b3983ad..72531c6 100644
--- a/graph/blossom.cpp
+++ b/graph/blossom.cpp
@@ -80,5 +80,4 @@ struct GM {
 		}
 		return matching;
 	}
-
-};
\ No newline at end of file
+};
diff --git a/graph/connect.cpp b/graph/connect.cpp
index b29e0e1..c38b8bd 100644
--- a/graph/connect.cpp
+++ b/graph/connect.cpp
@@ -28,4 +28,4 @@ struct connect {
 			lct.cut(&lct.nodes[edges[id].first], &lct.nodes[id + n]);
 			lct.cut(&lct.nodes[edges[id].second], &lct.nodes[id + n]);
 	}}
-};
\ No newline at end of file
+};
diff --git a/graph/hopcroftKarp.cpp b/graph/hopcroftKarp.cpp
index c205ccf..c0eda96 100644
--- a/graph/hopcroftKarp.cpp
+++ b/graph/hopcroftKarp.cpp
@@ -40,4 +40,4 @@ int hopcroft_karp(int n) { // n = #Knoten links
 	while(bfs(n)) for(int i = 0; i < n; i++)
 		if (pairs[i] < 0) ans += dfs(i);
 	return ans;
-}
\ No newline at end of file
+}
diff --git a/graph/pushRelabel2.cpp b/graph/pushRelabel2.cpp
index 343f71d..f4a66e8 100644
--- a/graph/pushRelabel2.cpp
+++ b/graph/pushRelabel2.cpp
@@ -106,4 +106,4 @@ ll maxFlow(int s, int t) {
 		discharge(n, u);
 	}
 	return excess[t] + inf;
-}
\ No newline at end of file
+}
diff --git a/java/inputA.java b/java/inputA.java
index 6616c89..4aa5008 100644
--- a/java/inputA.java
+++ b/java/inputA.java
@@ -1,4 +1,4 @@
 Scanner in = new Scanner(System.in); // java.util.Scanner
 String line = in.nextLine(); // Die nächste Zeile.
 int num1 = in.nextInt(); // Das nächste Token als int.
-double num2 = in.nextDouble(); // Das nächste Token als double.
\ No newline at end of file
+double num2 = in.nextDouble(); // Das nächste Token als double.
diff --git a/java/inputB.java b/java/inputB.java
index 9175d56..93de1c1 100644
--- a/java/inputB.java
+++ b/java/inputB.java
@@ -4,4 +4,4 @@ String[] parts = line.split(" "); // Zeile in Tokens aufspalten.
 int num1 = Integer.parseInt(in.readLine);
 int num2 = Integer.parseInt(parts[0]);
 double num3 = Double.parseDouble(in.readLine);
-double num4 = Double.parseDouble(parts[0]);
\ No newline at end of file
+double num4 = Double.parseDouble(parts[0]);
diff --git a/java/output.java b/java/output.java
index 9249807..e43cb06 100644
--- a/java/output.java
+++ b/java/output.java
@@ -4,4 +4,4 @@ PrintWriter out = new PrintWriter(new BufferedWriter(
                   FileDescriptor.out), StandardCharsets.UTF_8), 4096));
 out.println("blub" + "a" + "b"); //zeile Ausgeben 
 out.println(String.format("%d %s", 5, "a")) // wie printf
-out.close();//WICHTIG!
\ No newline at end of file
+out.close();//WICHTIG!
diff --git a/latexHeaders/code.sty b/latexHeaders/code.sty
index caac6b1..1e67ead 100644
--- a/latexHeaders/code.sty
+++ b/latexHeaders/code.sty
@@ -105,4 +105,4 @@
 }
 \makeatother
 
-\newcommand{\hl}[1]{\btHL[fill=safeOrange,draw=black,thin]{#1}}
\ No newline at end of file
+\newcommand{\hl}[1]{\btHL[fill=safeOrange,draw=black,thin]{#1}}
diff --git a/latexHeaders/commands.sty b/latexHeaders/commands.sty
index c23fbfc..dde7fa8 100644
--- a/latexHeaders/commands.sty
+++ b/latexHeaders/commands.sty
@@ -47,4 +47,4 @@
 	\nobreak%
 	\needspace{3\baselineskip}%
 	\nobreak%
-}
\ No newline at end of file
+}
diff --git a/math/berlekampMassey.cpp b/math/berlekampMassey.cpp
index 4999254..b0c1902 100644
--- a/math/berlekampMassey.cpp
+++ b/math/berlekampMassey.cpp
@@ -1,3 +1,4 @@
+constexpr ll mod = 1000000007;
 vector<ll> BerlekampMassey(const vector<ll>& s) {
 	int n = sz(s), L = 0, m = 0;
 	vector<ll> C(n), B(n), T;
@@ -27,4 +28,4 @@ vector<ll> BerlekampMassey(const vector<ll>& s) {
 	C.erase(C.begin());
 	for (auto& x : C) x = (mod - x) % mod;
 	return C;
-}
\ No newline at end of file
+}
diff --git a/math/bigint.cpp b/math/bigint.cpp
index 59d6afe..df28a73 100644
--- a/math/bigint.cpp
+++ b/math/bigint.cpp
@@ -272,4 +272,4 @@ struct bigint {
 		res.trim();
 		return res;
 	}
-};
\ No newline at end of file
+};
diff --git a/math/divisors.cpp b/math/divisors.cpp
index 638c87c..5afd4fb 100644
--- a/math/divisors.cpp
+++ b/math/divisors.cpp
@@ -8,4 +8,4 @@ ll countDivisors(ll n) {
 	if (isPrime(n)) res *= 2;
 	else if (n > 1) res *= isSquare(n) ? 3 : 4;
 	return res;
-}
\ No newline at end of file
+}
diff --git a/math/linearCongruence.cpp b/math/linearCongruence.cpp
index b4f172d..cdb5a37 100644
--- a/math/linearCongruence.cpp
+++ b/math/linearCongruence.cpp
@@ -2,4 +2,4 @@ ll solveLinearCongruence(ll a, ll b, ll m) {
 	ll g = gcd(a, m);
 	if (b % g != 0) return -1;
 	return ((b / g) * multInv(a / g, m / g)) % (m / g);
-}
\ No newline at end of file
+}
diff --git a/math/matrixPower.cpp b/math/matrixPower.cpp
index d3c1b63..05e29f6 100644
--- a/math/matrixPower.cpp
+++ b/math/matrixPower.cpp
@@ -13,4 +13,4 @@ ll calc(int x, int y, ll b) {
 		b /= 2;
 	}
 	return v[y];
-}
\ No newline at end of file
+}
diff --git a/math/piLehmer.cpp b/math/piLehmer.cpp
index 4d1780f..56c172d 100644
--- a/math/piLehmer.cpp
+++ b/math/piLehmer.cpp
@@ -49,4 +49,4 @@ ll pi(ll n) {
 			res -= pi(w / primes[j]) - j;

 	}}

 	return res;

-}
\ No newline at end of file
+}

diff --git a/math/primitiveRoot.cpp b/math/primitiveRoot.cpp
index 36a9367..7973c24 100644
--- a/math/primitiveRoot.cpp
+++ b/math/primitiveRoot.cpp
@@ -20,4 +20,4 @@ ll findPrimitive(ll n) {
 	for (ll res = 1; res < n; res++)
 		if (isPrimitive(res, n, phin, phiFacs)) return res;
 	return -1;
-}
\ No newline at end of file
+}
diff --git a/math/tables/nim.tex b/math/tables/nim.tex
index 75585f4..8490d42 100644
--- a/math/tables/nim.tex
+++ b/math/tables/nim.tex
@@ -93,4 +93,4 @@
 	$n \in [72,83]: \quad 4, 1, 2, 8, 1, 4, 7, 2, 1, 8, 2, 7$\newline
 	Periode ab $n = 72$ der Länge $12$.\\
 	\hline
-\end{tabularx}
\ No newline at end of file
+\end{tabularx}
diff --git a/math/tables/series.tex b/math/tables/series.tex
index 13af68f..f7e7839 100644
--- a/math/tables/series.tex
+++ b/math/tables/series.tex
@@ -30,4 +30,4 @@
 		\binom{n + 1}{m + 1} \left(H_{n + 1} - \frac{1}{m  + 1}\right)$
 	} \\
 	\hline
-\end{tabularx}
\ No newline at end of file
+\end{tabularx}
diff --git a/math/tables/twelvefold.tex b/math/tables/twelvefold.tex
index 7f7e27a..b8ab56d 100644
--- a/math/tables/twelvefold.tex
+++ b/math/tables/twelvefold.tex
@@ -29,4 +29,4 @@
 	} \\
 	\hline
 \end{tabularx}
-\end{expandtable}
\ No newline at end of file
+\end{expandtable}
diff --git a/math/transforms/andTransform.cpp b/math/transforms/andTransform.cpp
index cdc7b22..32496d8 100644
--- a/math/transforms/andTransform.cpp
+++ b/math/transforms/andTransform.cpp
@@ -14,4 +14,4 @@ void fft(vector<cplx>& a, bool inverse = 0) {
 				} else {
 					a[j + k] = t - u;
 					a[j + s + k] = u;
-}}}}
\ No newline at end of file
+}}}}
diff --git a/other/compiletime.cpp b/other/compiletime.cpp
index 7734806..19824e6 100644
--- a/other/compiletime.cpp
+++ b/other/compiletime.cpp
@@ -4,4 +4,4 @@ struct Table {
 	constexpr Table() : data {} {
 		for (int i = 0; i < N; i++) data[i] = i;
 }};
-constexpr Table<100000> precalculated;
\ No newline at end of file
+constexpr Table<100000> precalculated;
diff --git a/other/josephusK.cpp b/other/josephusK.cpp
index 8d4df4d..5025f89 100644
--- a/other/josephusK.cpp
+++ b/other/josephusK.cpp
@@ -2,4 +2,4 @@
 int josephus(int n, int k) {
 	if (n == 1) return 0;
 	return (josephus(n - 1, k) + k) % n;
-}
\ No newline at end of file
+}
diff --git a/other/pragmas.cpp b/other/pragmas.cpp
index f8cf060..a39c850 100644
--- a/other/pragmas.cpp
+++ b/other/pragmas.cpp
@@ -3,4 +3,4 @@
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,"
 									 "popcnt,abm,mmx,avx,tune=native")
 #pragma GCC target("fpmath=sse,sse2")	// no excess precision
-#pragma GCC target("fpmath=387") 			// force excess precision
\ No newline at end of file
+#pragma GCC target("fpmath=387") 			// force excess precision
diff --git a/string/ahoCorasick.cpp b/string/ahoCorasick.cpp
index 41bd788..c83f9c3 100644
--- a/string/ahoCorasick.cpp
+++ b/string/ahoCorasick.cpp
@@ -51,4 +51,4 @@ struct AhoCorasick {
 		if (aho[v].nxt[idx] != -1) return aho[v].nxt[idx];
 		else return v == 0 ? 0 : go(getSuffix(v), idx);
 	}
-};
\ No newline at end of file
+};
diff --git a/string/manacher.cpp b/string/manacher.cpp
index 209896b..03c06e1 100644
--- a/string/manacher.cpp
+++ b/string/manacher.cpp
@@ -24,4 +24,4 @@ void manacher() {
 	}}
 	//convert lengths to string b (optional)
 	for (int i = 0; i < n; i++) longest[i] = 2 * longest[i] + 1;
-}
\ No newline at end of file
+}
diff --git a/string/rollingHash.cpp b/string/rollingHash.cpp
index ad9e7cd..cd88951 100644
--- a/string/rollingHash.cpp
+++ b/string/rollingHash.cpp
@@ -13,4 +13,4 @@ struct Hasher {
 	ll hash(int l, int r) {	// Berechnet hash(s[l..r)).
 		return (pref[r] - power[r-l] * pref[l] % M + M) % M;
 	}
-};
\ No newline at end of file
+};
diff --git a/string/rollingHashCf.cpp b/string/rollingHashCf.cpp
index da534a1..d1b8893 100644
--- a/string/rollingHashCf.cpp
+++ b/string/rollingHashCf.cpp
@@ -14,4 +14,4 @@ struct Hasher {
 	ll hash(int l, int r) {	 // Berechnet hash(s[l..r)).
 		return (pref[r] - power[r-l] * pref[l] % m + m) % m;
 	}
-};
\ No newline at end of file
+};
diff --git a/string/suffixTree.cpp b/string/suffixTree.cpp
index 2601c34..4faea86 100644
--- a/string/suffixTree.cpp
+++ b/string/suffixTree.cpp
@@ -79,4 +79,4 @@ struct SuffixTree {
 				curVert = tree[curVert].suffix ? tree[curVert].suffix
 				                               : root;
 	}}}
-};
\ No newline at end of file
+};
diff --git a/tcr.pdf b/tcr.pdf
index ad191c8..082d961 100644
--- a/tcr.pdf
+++ b/tcr.pdf
diff --git a/tests/gcc5bug.cpp b/tests/gcc5bug.cpp
index 55efa3b..f49603e 100644
--- a/tests/gcc5bug.cpp
+++ b/tests/gcc5bug.cpp
@@ -1,4 +1,4 @@
 //https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68203
 struct A {
     pair<int, int> values[1000000];
-};
\ No newline at end of file
+};
diff --git a/tests/precision.cpp b/tests/precision.cpp
index a1ab1f6..0c81ae1 100644
--- a/tests/precision.cpp
+++ b/tests/precision.cpp
@@ -5,4 +5,4 @@ int main() {
 	double a = atof("1.2345678");
 	double b = a*a;
 	cout << b - 1.52415765279683990130 << '\n';
-}
\ No newline at end of file
+}
diff --git a/tests/whitespace.cpp b/tests/whitespace.cpp
index 71ad9a4..d4abf47 100644
--- a/tests/whitespace.cpp
+++ b/tests/whitespace.cpp
@@ -1 +1 @@
-"\r\r\r\n\t     \r\n\r"
\ No newline at end of file
+"\r\r\r\n\t     \r\n\r"