Skip to content

Commit 67d0940

Browse files
lol
1 parent b183370 commit 67d0940

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

solutions/gold/coci-16-burza.mdx

+2-2
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ n_{r+1} \leq (k-r)^2-2(k-r)=(k-r-1)^2
9898
$$
9999

100100
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
101+
have to handle the case where $k \lt 20$, for which
102102
[bitmask DP](/gold/dp-bitmasks) will suffice.
103103

104104
### Bitmask DP
@@ -125,7 +125,7 @@ yields a configuration that can cover up to the fifth leaf.
125125

126126
## Implementation
127127

128-
**Time Complexity:** $\mathcal{O}(2^{\sqrt{N}} \cdot N)$
128+
**Time Complexity:** $\mathcal{O}(2^{\sqrt{n}} \cdot n)$
129129

130130
<LanguageSection>
131131
<CPPSection>

0 commit comments

Comments
 (0)