Help: Counting Problem on Circle

Правка en1, от abdelaal_03, 2025-05-21 00:06:55
How many ways to draw non-crossing lines (chords) between any subset of n <= 1e6 points on a circle, such that:
1 - Lines do not cross each other.
2 - Multiple lines may share a common endpoint (i.e., chords can share points).
3 - Some points may remain unused
Теги combinatorics, counting, dp

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский abdelaal_03 2025-05-21 00:06:55 372 Initial revision (published)