How many ways to pick AT MOST k elements from n elements?

Правка en1, от PUSSY_LICKING_LOLI_69, 2024-09-26 06:08:37

Given a fixed k (k<=1e6), make an array F of size n (n<=1e6) , with F[i] be the number of ways to pick AT MOST k elements from i elements.

Is there a way to create this array efficiently?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский PUSSY_LICKING_LOLI_69 2024-09-26 06:08:37 249 Initial revision (published)