We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b183370 commit 67d0940Copy full SHA for 67d0940
solutions/gold/coci-16-burza.mdx
@@ -98,7 +98,7 @@ n_{r+1} \leq (k-r)^2-2(k-r)=(k-r-1)^2
98
$$
99
100
And we're done! Since we've shown that any case where $k^2 \geq n$ will result in a win, we just
101
-have to handle the case where $K \lt 20$, for which
+have to handle the case where $k \lt 20$, for which
102
[bitmask DP](/gold/dp-bitmasks) will suffice.
103
104
### Bitmask DP
@@ -125,7 +125,7 @@ yields a configuration that can cover up to the fifth leaf.
125
126
## Implementation
127
128
-**Time Complexity:** $\mathcal{O}(2^{\sqrt{N}} \cdot N)$
+**Time Complexity:** $\mathcal{O}(2^{\sqrt{n}} \cdot n)$
129
130
<LanguageSection>
131
<CPPSection>
0 commit comments