Update coci-16-burza.mdx

Author: SansPapyrus683

solutions/gold/coci-16-burza.mdx

@@ -38,7 +38,7 @@ unfortunately is still too large for an exponential time solution. But it is
 
 ### Further Analysis
 
-To limit the maximum number of nodes to 20, we have to prove that a game can *always*
+To limit the maximum number of steps to 20, we have to prove that a game can *always*
 end in $k$ moves if $k^2 \geq n$.
 
 Since each move results in breaking a tree down into a bunch of smaller trees,
@@ -98,7 +98,7 @@ n_{r+1} \leq (k-r)^2-2(k-r)=(k-r-1)^2
 $$
 
 And we're done! Since we've shown that any case where $k^2 \geq n$ will result in a win, we just
-have to handle the case where $K \leq 20$, for which
+have to handle the case where $K \le 20$, for which
 [bitmask DP](/gold/dp-bitmasks) will suffice.
 
 ### Bitmask DP