edit some descriptions

content/0_Intro/Intro_Files.md

@@ -1,8 +0,0 @@
----
-slug: /intro/files
-title: File IO
-author: Unknown
-order: 3
----
-
-do we still need this if USACO is transitioning to standard input/output?

content/0_Intro/Intro_IO.md

@@ -0,0 +1,8 @@
+---
+slug: /intro/files
+title: Input & Output
+author: Unknown
+order: 3
+---
+
+Demonstrates how to read input and write output for a simple problem in multiple languages.

content/3_Gold/4_Gold_SP.md

@@ -12,6 +12,8 @@ prerequisites:
  - Shortest Path With Negative Edge Weights
  - All Pairs Shortest Path
 
+<!-- END DESCRIPTION -->
+
 ## Non-Negative Edge Weights
 
 Use *Dijkstra's Algorithm*.

content/3_Gold/5_Gold_MST.md

@@ -51,4 +51,8 @@ Disjoint Set Union and Minimum Spanning Trees
 ## Other Problems
 
   - [Birthday Gifts](https://www.hackerearth.com/practice/math/combinatorics/inclusion-exclusion/practice-problems/algorithm/mancunian-and-birthday-gifts-d44faa15/) [](73)
-  - [Spanning Tree Fraction](https://www.hackerrank.com/contests/w31/challenges/spanning-tree-fraction) [](78)
+  - [Spanning Tree Fraction](https://www.hackerrank.com/contests/w31/challenges/spanning-tree-fraction) [](78)
+
+## Boruvka?
+
+(add)

content/4_Plat/2_Plat_1DRQ.md

@@ -8,8 +8,6 @@ prerequisites:
      - Gold - Binary Indexed Trees
 ---
 
-Assumes familiarity with "Gold - Binary Indexed Trees." 
-
 General range queries for associative operations, including segment tree.
 
 <!-- END DESCRIPTION -->

content/4_Plat/8_Plat_Fracture.md

@@ -7,7 +7,7 @@ prerequisites:
  - 
      - Gold - Minimum Spanning Tree
  -
-     - Analysis for Robotic Cow Herd
+     - some familiarity with the analysis for "Robotic Cow Herd"
 ---
 
 A simple solution to [Robotic Cow Herd](http://www.usaco.org/index.php?page=viewproblem2&cpid=674) that generalizes.