bruh ™️

Author: SansPapyrus683

solutions/bronze/usaco-808.mdx

@@ -154,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>
@@ -208,6 +209,7 @@ for i in range(n):
 
 print(ans)
 ```
+
 </PySection>
 <CPPSection>
 	
@@ -275,7 +277,6 @@ int main() {
 ```
 
 </CPPSection>
-	
 <JavaSection>
 	
 ```java
@@ -349,10 +350,11 @@ public class Hoofball {
 		io.println(ballsNeeded);
 		io.close();
 	}
-	// CodeSnip{Kattio}
+
+	//CodeSnip{Kattio}
 }
-	
-```	
+```
+
 </JavaSection>
 </LanguageSection>
 </Spoiler>