DeArrangements For Large Numbers

Правка en1, от valar_dohaeris, 2016-10-14 19:05:38

How to find the number of dearrangements for value N. For smaller(N), we can use DP to find the value, but when N is large around 10^9, how do we find it efficiently? MOD = 10^9 + 7.

Теги dynamic programming, recurrence

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский valar_dohaeris 2016-10-14 19:05:38 214 Initial revision (published)