Merge pull request #3474 from cpinitiative/hoofball

hints for hoofball, bronze

Author: SansPapyrus683

solutions/bronze/usaco-808.mdx

@@ -5,8 +5,6 @@ title: Hoofball
 author: Ryan Chou, Ben Dodge, Arpan Banerjee
 ---
 
-[Official Analysis (C++)](http://www.usaco.org/current/data/sol_hoofball_bronze_feb18.html)
-
 ## Video Solution
 By Arpan Banerjee
 
@@ -61,7 +59,6 @@ int main(){
 ```
 
 </CPPSection>
-
 <JavaSection>
 
 ```java
@@ -126,11 +123,27 @@ class Main {
 	}
 }
 ```
-</JavaSection>
 
+</JavaSection>
 </LanguageSection>
 </Spoiler>
 
+<Spoiler title="Hint 1">
+
+Play with the sample input, and draw out other cases.
+
+</Spoiler>
+
+<Spoiler title="Hint 2">
+
+When will a ball get stuck in an infinite loop?
+
+</Spoiler>
+
+<Spoiler title="Solution">
+
+[Official Analysis (C++)](http://www.usaco.org/current/data/sol_hoofball_bronze_feb18.html)
+
 ## Explanation
 
 First, let's realize that Farmer John will need another ball in one of two cases: 
@@ -141,6 +154,7 @@ So, each time this occurs we can count it and return this total count as our ans
 We can do this first by finding which cow, if any, every cow passes the ball to. 
 
 ## Implementation
+
 **Time Complexity:** $\mathcal{O}(N^2)$
 
 <LanguageSection>
@@ -195,6 +209,7 @@ for i in range(n):
 
 print(ans)
 ```
+
 </PySection>
 <CPPSection>
 	
@@ -262,7 +277,6 @@ int main() {
 ```
 
 </CPPSection>
-	
 <JavaSection>
 	
 ```java
@@ -336,9 +350,11 @@ public class Hoofball {
 		io.println(ballsNeeded);
 		io.close();
 	}
-	// CodeSnip{Kattio}
+
+	//CodeSnip{Kattio}
 }
-	
-```	
+```
+
 </JavaSection>
 </LanguageSection>
+</Spoiler>