Movie Night: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

14 February 2023

  • curprev 06:4906:49, 14 February 2023 Kmk21 talk contribs 2,005 bytes +2,005 Created page with "This problem gives us rules about which friends require other friends in order to go out, and asks us the count of combinations of friends. We see that this is well suited to a graph representation, and representing the links as such gives us a couple intuitions: # Each node has exactly one outgoing edge # If there is a cycle or strongly connected component, it MUST be a sink of the graph, otherwise there would be a node with multiple outgoing edges # Each connected com..."