add numbering

content/4_Plat/10_Plat_Slope.md

@@ -2,13 +2,10 @@
 slug: /plat/slope
 title: "Slope Trick"
 author: Benjamin Qi
-order: 7
+order: 10
 ---
 
-**Slope trick** is a way to represent a function that satisfies the following conditions:
-
- * It can be divided into multiple sections, where each section is a linear function (usually) with an integer slope.
- * It is a convex/concave function. In other words, the slope of each section is non-decreasing or non-increasing when scanning the function from left to right.
+**Slope trick** refers to manipulating piecewise linear convex functions. Includes a simple solution to "Landscaping."
 
 <!-- END EXCERPT -->
 

content/4_Plat/1_Plat_Trees.md

@@ -5,9 +5,7 @@ author: Benjamin Qi
 order: 1
 ---
 
-<div class="syllabus-only">
-  Description: Todo
-</div>
+Lowest Common Ancestor and other common tree topics.
 
 <!-- END DESCRIPTION -->
 

content/4_Plat/2_Plat_1DRQ.md

@@ -2,12 +2,10 @@
 slug: /plat/1DRQ
 title: "1D Range Queries"
 author: Benjamin Qi
-order: 3
+order: 2
 ---
 
-<div class="syllabus-only">
-  Description: Todo
-</div>
+General range queries for associative operations, including segment tree.
 
 <!-- END DESCRIPTION -->
 
@@ -43,7 +41,6 @@ This data structure allows you to do point update and range query in $O(\log N)$
    - [Slides from CPC.3](https://github.com/SuprDewd/T-414-AFLV/tree/master/03_data_structures)
  - Special: Minimum Query w/ Number of Minimums
 
-
 ### Problems
 
  - Normal SegTree

content/4_Plat/3_Plat_2DRQ.md

@@ -2,12 +2,10 @@
 slug: /plat/2DRQ
 title: "2D Range Queries"
 author: Benjamin Qi
-order: 4
+order: 3
 ---
 
-<div class="syllabus-only">
-  Description: Todo
-</div>
+Extend 1D Range Queries to 2D (and beyond).
 
 <!-- END DESCRIPTION -->
 

content/4_Plat/4_Plat_Geo.md

@@ -2,12 +2,10 @@
 slug: /plat/geo
 title: "Geometry"
 author: Benjamin Qi
-order: 6
+order: 4
 ---
 
-<div class="syllabus-only">
-  Description: Todo
-</div>
+Geometry primitives and convex hull.
 
 <!-- END DESCRIPTION -->
 
@@ -60,6 +58,7 @@ You should know basic operations like cross product and dot product. For platinu
 [CPC.12](https://github.com/SuprDewd/T-414-AFLV/tree/master/12_geometry)
 
 ## 4
+
   * Misc Stuff to Know
     * Topics
       * std::complex, pair operators

content/4_Plat/5_Plat_Graphs.md

@@ -0,0 +1,66 @@
+---
+slug: /plat/graphs
+title: "Graphs"
+author: Benjamin Qi
+order: 5
+---
+
+Eulerian Tours, SCCs, and BCCs.
+<!-- END DESCRIPTION -->
+
+Note: all except the third have not appeared on a recent USACO contest.
+
+*Some problems sourced from [here](http://codeforces.com/blog/entry/54526?#comment-385354).*
+
+[CPC.10](https://github.com/SuprDewd/T-414-AFLV/tree/master/10_graphs_3_network_flow)
+
+## Eulerian Tours
+
+Has not appeared on a recent USACO contest.
+
+### Tutorial
+
+  - CPH (19, Path & Circuits)
+
+### Problems
+
+  - [Matching Substrings](https://csacademy.com/contest/archive/task/matching-substrings/) [](87)
+
+## Strongly Connected Components
+
+  - Tarjan
+  - [Kosaraju](https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm)
+  - [2-SAT](http://codeforces.com/blog/entry/16205)
+
+### Tutorial
+ 
+  - CPH (17, Strong Connectivity)
+
+### Problems
+
+ - [USACO Old Gold: Grass](http://www.usaco.org/index.php?page=viewproblem2&cpid=516)
+ - [Proving Equivalences](https://open.kattis.com/problems/equivalences) [](78)
+ - [Festival](https://szkopul.edu.pl/problemset/problem/p9uJo01RR9ouMLLAYroFuQ-7/site/?key=statement) [](173)
+ - [Linear Programming Trick](https://www.cs.rit.edu/~spr/COURSES/ALG/MIT/lec18.pdf)
+
+## Biconnected Components
+
+Related topics include
+
+ - Articulation Points
+ - Bridges
+ - Block-Cut Tree
+
+### Tutorial
+
+ - [GeeksforGeeks](http://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/)
+ - [Wikipedia](https://en.wikipedia.org/wiki/Biconnected_component)
+ - [CF DFS Tree + Bridges](https://codeforces.com/blog/entry/68138)
+
+### Problems
+
+ - [USACO Plat: Push a Box](http://www.usaco.org/index.php?page=viewproblem2&cpid=769)
+ - [Blockade](https://szkopul.edu.pl/problemset/problem/eDt8w290owtatmCjad0O0ywk/site/?key=statement)
+ - [POLICIJA](http://wcipeg.com/problem/coi06p2)
+ - [One-Way Streets](https://csacademy.com/contest/archive/task/one-way-streets/)
+ - [Investment](https://dmoj.ca/problem/tle17c1p6)

content/4_Plat/6_Plat_Strings.md

@@ -2,11 +2,12 @@
 slug: /plat/hashing
 title: "Platinum - Strings"
 author: Benjamin Qi
+order: 6
 ---
 
-# Platinum - Strings
+Hashing, Tries, Z, KMP, Aho-Corasick, Suffix Array, Manacher
 
-Author: Benjamin Qi
+<!-- END DESCRIPTION -->
 
 Note: String algorithms do not appear very frequently. Hashing has appeared on gold (rarely).
 

content/4_Plat/7_Plat_Bitset.md

@@ -2,12 +2,10 @@
 slug: /plat/bitset
 title: "Bitset"
 author: Benjamin Qi
-order: 2
+order: 7
 ---
 
-<div class="syllabus-only">
-  Description: Todo
-</div>
+Bitset leads to some unintended solutions.
 
 <!-- END DESCRIPTION -->
 

content/4_Plat/8_Plat_Matrix.md

@@ -0,0 +1,17 @@
+---
+slug: /plat/matrix
+title: "Platinum - Matrix Exponentiation"
+author: ?
+order: 8
+---
+
+Matrix Exponentiation
+
+<!-- END DESCRIPTION -->
+
+ * Tutorial
+   * CPH (23, Matrices)
+ * Problems
+   * [Currencies](https://www.hackerrank.com/contests/gs-codesprint/challenges/currencies) [](107)
+
+COWBASIC

content/4_Plat/9_Plat_Fracture.md

@@ -2,12 +2,10 @@
 slug: /plat/fracture
 title: "Fracturing Search"
 author: Benjamin Qi
-order: 5
+order: 9
 ---
 
-<div class="syllabus-only">
-  Description: Todo
-</div>
+A simpler solution to robotic cow herd that generalizes.
 
 <!-- END DESCRIPTION -->
 

content/4_Plat/Plat_Graphs.md

@@ -1,55 +0,0 @@
----
-slug: /plat/trees
-title: "Graphs"
-author: ?
-order: 8
----
-
-SCC
-
-[USACO Old Gold Grass](http://www.usaco.org/index.php?page=viewproblem2&cpid=516)
-
-BCC
-
-[USACO Plat Push a Box](http://www.usaco.org/index.php?page=viewproblem2&cpid=769)
-
-<!-- END DESCRIPTION -->
-
-*Some problems sourced from [here](http://codeforces.com/blog/entry/54526?#comment-385354).*
-
-[CPC.10](https://github.com/SuprDewd/T-414-AFLV/tree/master/10_graphs_3_network_flow)
-
-## 4
-  * Eulerian Tours
-    * Tutorial
-      * CPH (19, Path & Circuits)
-    * Problems
-      * [Matching Substrings](https://csacademy.com/contest/archive/task/matching-substrings/) [](87)
-      * [A2OJ](https://a2oj.com/category?ID=24)
-  * Biconnected Components
-    * Related
-      * Articulation Points
-      * Bridges
-      * Block-Cut Tree
-    * Tutorial
-      * [GeeksforGeeks](http://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/)
-      * [Wikipedia](https://en.wikipedia.org/wiki/Biconnected_component)
-      * [CF DFS Tree + Bridges](https://codeforces.com/blog/entry/68138)
-    * Problems
-      * [Blockade](https://szkopul.edu.pl/problemset/problem/eDt8w290owtatmCjad0O0ywk/site/?key=statement)
-      * [POLICIJA](http://wcipeg.com/problem/coi06p2)
-      * [One-Way Streets](https://csacademy.com/contest/archive/task/one-way-streets/)
-      * [Investment](https://dmoj.ca/problem/tle17c1p6)
-      * [A2OJ](https://a2oj.com/category?ID=128)
-  * Strongly Connected Components
-    * Tutorial
-      * CPH (17, Strong Connectivity)
-    * Topics
-      * Tarjan
-      * [Kosaraju](https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm)
-      * [2-SAT](http://codeforces.com/blog/entry/16205)
-    * Problems
-      * [A2OJ](https://a2oj.com/category?ID=231)
-      * [Proving Equivalences](https://open.kattis.com/problems/equivalences) [](78)
-      * [Festival](https://szkopul.edu.pl/problemset/problem/p9uJo01RR9ouMLLAYroFuQ-7/site/?key=statement) [](173)
-        * [Linear Programming Trick](https://www.cs.rit.edu/~spr/COURSES/ALG/MIT/lec18.pdf)

content/4_Plat/Plat_Matrix.md

@@ -1,14 +0,0 @@
----
-slug: /plat/matrix
-title: "Platinum - Matrices"
-author: ?
----
-
-Exponentiation
- 
-* Tutorial
-  * CPH (23, Matrices)
-* Problems
-  * [Currencies](https://www.hackerrank.com/contests/gs-codesprint/challenges/currencies) [](107)
-
-COWBASIC