No of ways to express N as a sum of k partitions ?

Правка en1, от pvpcoder, 2016-01-16 18:48:25

I Searched on the internet and I found this recurrence f(n,k)=f(n-,k-1)+f(n-k,k).
But unable to understand how it works?

Теги dp

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский pvpcoder 2016-01-16 18:48:47 1 Tiny change: '(n,k)=f(n-,k-1)+f(n-' -> '(n,k)=f(n-1,k-1)+f(n-'
en1 Английский pvpcoder 2016-01-16 18:48:25 173 Initial revision (published)