Update coci-16-burza.mdx

Author: SansPapyrus683

solutions/gold/coci-16-burza.mdx

@@ -38,8 +38,8 @@ unfortunately is still too large for an exponential time solution. But it is
 
 ### Further Analysis
 
-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$.
+To limit the maximum number of steps to a point where bitwise DP is feasible,
+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,
 we can do a [proof by induction](https://en.wikipedia.org/wiki/Mathematical_induction).