fix containers, olympiads

content/3_Bronze/4_Bronze_Containers.md

@@ -126,11 +126,6 @@ s.pop(); // [1, 13]
 cout << s.size() << endl; // 2
 ```
 
-**Basic Problems**:
- - UVa 00514 - Rails
- - UVa 00732 - Anagram by Stack
- - UVa 01062 - Containers
-
 ### [Queues](http://www.cplusplus.com/reference/queue/queue/ )
 
 A queue is a First In First Out (FIFO) data structure that supports three operations, all in $O(1)$ time. 
@@ -162,12 +157,6 @@ d.push_front(1); // [1, 3, 7]
 d.pop_back(); // [1, 3]
 ```
 
-**Queue/Deque Basic Problems**:
-
- - UVa 10172 - The Lonesome Cargo
- - UVa 10901 - Ferry Loading III
- - UVa 11034 - Ferry Loading IV
-
 ### [Priority Queues](http://www.cplusplus.com/reference/queue/priority_queue/)
 
 A priority queue supports the following operations: insertion of elements, deletion of the element considered highest priority, and retrieval of the highest priority element, all in $O(\log n)$ time according to the number of elements in the priority queue. Priority is based on a comparator function, but by default the highest element is at the top of the priority queue. The priority queue is one of the most important data structures in competitive programming, so make sure you understand how and when to use it. 
@@ -273,14 +262,6 @@ if (m.upper_bound(10) == m.end())
 
 A note on unordered sets and maps: In USACO contests, they're generally fine, but in CodeForces contests, you should always use sorted sets and maps. This is because the built-in hashing algorithm is vulnerable to pathological data sets causing abnormally slow runtimes, in turn causing failures on some test cases (see [neal's blog](https://codeforces.com/blog/entry/62393)). Alternatively, use a different hashing algorithm.
 
-
-**Basic Problems**:
-
-- UVa 10226 - Hardwood Species
-- UVa 11286 - Conformity
-- UVa 11572 - Unique Snowflakes
-
-
 ### [Multisets](http://www.cplusplus.com/reference/set/multiset/)
 
 Lastly, there is the multiset, which is essentially a sorted set that allows multiple copies of the same element. In addition to all of the regular set operations, the multiset `count()` method returns the number of times an element is present in the multiset. (Actually, you shouldn't use `count()` because this takes time **linear** in the number of matches.)
@@ -307,12 +288,6 @@ ms.erase(9);
 cout << ms.count(9) << '\n'; // 0
 ```
 
-**Set/Multiset Problems**:
-
-- UVa 00978 - Lemmings Battle
-- UVa 11136 - Hoax or what
-- UVa 11849 - CD
-
 ## [Pair](http://www.cplusplus.com/reference/utility/pair/pair/)
 
 A structure that holds two values, not necessarily of the same type (not built into java!). 
@@ -339,17 +314,3 @@ int main() {
  * Testing 123
  */
 ```
-
-## Other Resources
-
- - CPH 4
- - [CPC.2](https://github.com/SuprDewd/T-414-AFLV/tree/master/02_data_structures)
-
-## Additional Problems
-
-* [Beautiful Triplets](https://www.hackerearth.com/practice/algorithms/greedy/basics-of-greedy-algorithms/practice-problems/algorithm/mancunian-and-beautiful-triplets-30968257/) [](54)
-* [Polycarp's Phone Book](http://codeforces.com/contest/860/problem/B) [](56)
-* [Jury Marks](http://codeforces.com/contest/831/problem/C) [](67)
-* [Mahmoud & Ehab & Function](http://codeforces.com/contest/862/problem/E) [](74)
-* [Karen & Cards](http://codeforces.com/contest/815/problem/D) [](86)
-* [Tournament](http://codeforces.com/contest/878/problem/C) [](106)

content/3_Bronze/6_Bronze_Simulation.md

@@ -2,7 +2,7 @@
 slug: /bronze/simulation
 title: "Simulation"
 author: Unknown
-order: 4
+order: 6
 ---
 
 See 5 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a

content/3_Bronze/7_Bronze_Complete.md

@@ -2,7 +2,7 @@
 slug: /bronze/complete-search
 title: "Complete Search"
 author: Unknown
-order: 5
+order: 7
 ---
 
 See 6 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a

content/6_Plat/0_Plat_Olympiads.md

@@ -5,13 +5,14 @@ author: Benjamin Qi
 order: 0
 ---
 
+Once you've reached Platinum, it may be helpful to practice with problems from other (inter)national olympiads.
+
+<!-- END DESCRIPTION -->
 
 > Hello, Which online judge should I practice more to do well in **IOI** ?
 > the closest OJ for IOI style?
 > Do you have any magic problems sets to suggest?
 
-Once you've reached Platinum, it may be helpful to practice with problems from other (inter)national olympiads.
-
 ## National
 
 See [here](https://ioinformatics.org/page/members/7) for additional links. The [OI Checklist](https://oichecklist.pythonanywhere.com/) is a great way to track your progress. :)