diff options
Diffstat (limited to 'content/other')
| -rw-r--r-- | content/other/fastIO.cpp | 2 | ||||
| -rw-r--r-- | content/other/other.tex | 4 | ||||
| -rw-r--r-- | content/other/timed.cpp | 2 |
3 files changed, 4 insertions, 4 deletions
diff --git a/content/other/fastIO.cpp b/content/other/fastIO.cpp index 9badcc7..09473f4 100644 --- a/content/other/fastIO.cpp +++ b/content/other/fastIO.cpp @@ -16,7 +16,7 @@ void printPositive(int n) { } void fastprint(int n) { - if(n == 0) {putchar('0'); return;} + if(n == 0) { putchar('0'); return; } if (n < 0) { putchar('-'); printPositive(-n); diff --git a/content/other/other.tex b/content/other/other.tex index 59b5790..426875a 100644 --- a/content/other/other.tex +++ b/content/other/other.tex @@ -31,7 +31,7 @@ \begin{tabularx}{\linewidth}{|Ll|}
\hline
Bit an Position j lesen & \code{(x \& (1 << j)) != 0} \\
- Bit an Position j setzten & \code{x |= (1 << j)} \\
+ Bit an Position j setzen & \code{x |= (1 << j)} \\
Bit an Position j löschen & \code{x \&= ~(1 << j)} \\
Bit an Position j flippen & \code{x ^= (1 << j)} \\
Anzahl an führenden nullen ($x \neq 0$) & \code{__builtin_clzll(x)} \\
@@ -211,7 +211,7 @@ Berechnung: Maximales Matching in bipartitem Graphen.
Dupliziere jedes $s \in S$ in $u_s$ und $v_s$.
Falls $x \leq y$, füge Kante $u_x \to v_y$ hinzu.
- Wenn Matching zu langsam ist, versuche Struktur des Posets auszunutzen und evtl. anders eine maximale Anitkette zu finden.
+ Wenn Matching zu langsam ist, versuche Struktur des Posets auszunutzen und evtl. anders eine maximale Antikette zu finden.
\item \textbf{\textsc{Turan}'s-Theorem:}
Die Anzahl an Kanten in einem Graphen mit $n$ Knoten der keine clique der größe $x+1$ enthält ist:
diff --git a/content/other/timed.cpp b/content/other/timed.cpp index b3ed4ef..a3ede29 100644 --- a/content/other/timed.cpp +++ b/content/other/timed.cpp @@ -1,3 +1,3 @@ int times = clock(); //run for 900ms -while (1000*(clock()-times)/CLOCKS_PER_SEC < 900) {...} +while (1000*(clock()-times)/CLOCKS_PER_SEC < 900) { ... } |