Increasing subsequences

Правка en1, от Gedawy, 2024-07-14 07:35:41

How to solve this problem?

find the number of permutations of length N that have longest increasing subsequence equal to K

1<=N<=40 , 1<=K<=5 problem link

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Gedawy 2024-07-14 07:35:41 218 Initial revision (published)