Help pls

Правка en2, от GG_EZ_DOGS, 2023-08-20 19:14:59

Can anyone help me to solve this, please?

Find the number of different permutations of length n such that the number of indices i (1 <= i <= n-1) where p[i] > p[i+1] is equal to K.

UPD: 1 <= n <= 3000, 0 <= k < n.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский GG_EZ_DOGS 2023-08-20 19:14:59 32 Tiny change: ' to K.\n\n' -> ' to K.\n\nUPD: 1 <= n <= 3000, 0 <= k < n.'
en1 Английский GG_EZ_DOGS 2023-08-20 19:13:58 195 Initial revision (published)