edit some descriptions
This commit is contained in:
parent
7c88005361
commit
42e62865fd
6 changed files with 16 additions and 12 deletions
|
@ -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?
|
8
content/0_Intro/Intro_IO.md
Normal file
8
content/0_Intro/Intro_IO.md
Normal file
|
@ -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.
|
|
@ -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*.
|
||||
|
|
|
@ -52,3 +52,7 @@ Disjoint Set Union and Minimum Spanning Trees
|
|||
|
||||
- [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)
|
||||
|
||||
## Boruvka?
|
||||
|
||||
(add)
|
|
@ -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 -->
|
||||
|
|
|
@ -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.
|
||||
|
|
Reference in a new issue