组合数学 (Fall 2019)/Problem Set 2new: 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.

15 October 2019

  • curprev 05:4605:46, 15 October 2019‎ imported>Haimin‎ 1,081 bytes +1,081‎ Created page with "<font color="red" size=5>Under Construction</font> == Problem 1 == 假设我们班上有<math>n+2</math>个人，其中两个人是DNA完全相同的双胞胎。我们收上<..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2019)/Problem_Set_2new"