Mark/handouts
1
0
Fork 0
Code Pull Requests 1 Actions Packages Releases Activity

Merged changes

Browse Source
This commit is contained in:
Mark
2023-01-13 10:17:11 -08:00
parent bc3ed650f7 513bac6f54
commit 0b2c39ad63
35 changed files with 1765 additions and 136 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Advanced/Graph Algorithms/parts/06 bonus.tex
View File

@ -1,6 +1,6 @@
\section{Crosses (Bonus Problem)}
\section{Crosses}
You are given an $n \times n$ grid. Some of its squares are white, and some are gray. Your goal is to place $n$ crosses on white cells so that each row and each column contains exactly one cross.
You are given an $n \times n$ grid. Some of its squares are white, some are gray. Your goal is to place $n$ crosses on white cells so that each row and each column contains exactly one cross.
\vspace{2ex}