fix mdx formatting

content/3_Bronze/Intro_Graphs.md

@@ -2,7 +2,7 @@
 id: intro-graphs
 title: Introduction to Graphs
 author: Darren Yao, Benjamin Qi
-description: **Graph theory** is one of the most important topics at the Silver level and above, although some basic problems occasionally appear in Bronze. 
+description: "Graph theory is one of the most important topics at the Silver level and above, although some basic problems occasionally appear in Bronze." 
 ---
 
 Graphs can be used to represent many things, from images to wireless signals, but one of the simplest analogies is to a map. Consider a map with several cities and highways connecting the cities. Some problems relating to graphsare:

content/3_Bronze/Pairs_Tuples.md

@@ -4,7 +4,6 @@ title: Pairs & Tuples
 author: Aaron Chew, Benjamin Qi, Nathan Wang, Darren Yao
 order: 6
 description: A **pair** is a structure that holds two values, not necessarily of the same type. (tuples?)
-
 ---
 
 ## Pairs

content/3_Bronze/Rect_Geo.md

@@ -2,7 +2,7 @@
 id: rect-geo
 title: "Rectangle Geometry"
 author: Darren Yao, Michael Cao
-description: "Geometry" problems on USACO Bronze are usually quite simple and limited to intersections and unions of squares or rectangles. 
+description: "\"Geometry\" problems on USACO Bronze are usually quite simple and limited to intersections and unions of squares or rectangles." 
 ---
 
  - Most only include two or three squares or rectangles, in which case you can simply draw out cases on paper. This should logically lead to a solution. 

content/4_Silver/2P.md

@@ -5,7 +5,7 @@ author: Darren Yao
 prerequisites:
  - 
      - Silver - Introduction to Sorting
-description: **Two pointers** refers to iterating two monotonic pointers across an array to search for a pair of indices satisfying some condition in $O(N)$ time.
+description: "Two pointers refers to iterating two monotonic pointers across an array to search for a pair of indices satisfying some condition in O(N) time."
 ---
 
 ## Tutorials

content/5_Gold/BinJump.md

@@ -2,8 +2,7 @@
 id: binjump
 title: "Binary Jumping"
 author: Benjamin Qi
-prerequisites: 
-description:
+description: Todo
 ---
 
 ## Binary Jumping

content/5_Gold/DP.md

@@ -7,7 +7,7 @@ prerequisites:
      - Recursion
  - 
      - Silver - Prefix Sums
-description: **Dynamic Programming (DP)** is a very important concept which emerges in the Gold division and extends to the IOI.
+description: Dynamic Programming (DP) is a very important concept which emerges in the Gold division and extends to the IOI.
 ---
 
 <info-block title="Contest Tip">

content/5_Gold/Merging.md

@@ -4,7 +4,7 @@ title: "Small-To-Large Merging"
 author: Michael Cao
 prerequisites: 
  - 
-     - ?
+     - todo
 description: ?
 ---
 

content/5_Gold/SRQ.md

@@ -4,10 +4,12 @@ title: "1D Static Range Queries"
 author: Benjamin Qi
 prerequisites: 
  - 
-     - ?
-description: Given a static array $A[1],A[2],\ldots,A[N]$, you want to answer queries in the form $A[l]\ominus A[l+1]\ominus \cdots \ominus A[r]$ where $\ominus$ denotes any associative operation. 
+     - todo
+description: todo
 ---
 
+Given a static array $A[1],A[2],\ldots,A[N]$, you want to answer queries in the form $A[l]\ominus A[l+1]\ominus \cdots \ominus A[r]$ where $\ominus$ denotes any associative operation.
+
 This can be done in $O(1)$ time each with $O(N\log N)$ time preprocessing.
 
 ## [Range Minimum Query](https://en.wikipedia.org/wiki/Range_minimum_query)

content/6_Plat/2DRQ.md

@@ -5,7 +5,7 @@ author: Benjamin Qi
 prerequisites: 
  - 
      - Platinum - Range Update Range Query
-description: Extending Range Queries to 2D (and beyond).
+description: "Extending Range Queries to 2D (and beyond)."
 ---
 
 See [my implementations](https://github.com/bqi343/USACO/tree/master/Implementations/content/data-structures/2D%20Range%20Queries%20(15.2)).
@@ -29,10 +29,12 @@ See [my implementations](https://github.com/bqi343/USACO/tree/master/Implementat
      - [my 2D offline BIT](https://github.com/bqi343/USACO/blob/master/Implementations/content/data-structures/2D%20Range%20Queries%20(15.2)/BIT2DOff%20(15.2).h)
 
 <optional-content title="Range Update and Range Query in Higher Dimensions">
+
 You can extend the 1D BIT solution for range update range query to higher dimensions as well 
 
  - [Paper](https://arxiv.org/pdf/1311.6093.pdf)
  - USACO Camp - "Cows Play Global Thermonuclear War" (2D case)
+ 
 </optional-content>
 
 ### Problems

content/6_Plat/Slope.md

@@ -5,9 +5,11 @@ author: Benjamin Qi
 prerequisites: 
  - 
      - some familiarity with at least one of the two tutorials mentioned in this module
-description: **Slope trick** refers to manipulating piecewise linear convex functions. Includes a simple solution to [Landscaping](http://www.usaco.org/index.php?page=viewproblem2&cpid=650).
+description: If you have piecewise linear convex functions, you may be able to use the Slope Trick.
 ---
 
+**Slope trick** refers to manipulating piecewise linear convex functions. Includes a simple solution to [Landscaping](http://www.usaco.org/index.php?page=viewproblem2&cpid=650).
+
 ## Tutorials
 
  - [zscoder](https://codeforces.com/blog/entry/47821)

content/ordering.ts

@@ -30,7 +30,7 @@ const ModuleOrdering = {
       items: [
         "collections",
         "containers",
-        "pairs",
+        "pairs-tuples",
         "ds",
       ]
     },