Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

tacewex's blog

help with interview question
By tacewex, history, 6 years ago, In English

given an array find number of ways of partitioning it into k non empty subsets of equal sum

  • Vote: I like it
  • -11
  • Vote: I do not like it

»
6 years ago, hide # |
← Rev. 3  
Vote: I like it -6 Vote: I do not like it

I think I misread the question ..

→ Reply
  • »
    »
    6 years ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it +10 Vote: I do not like it

    I guess your solution is for partitioning the array into K parts (basically sub-array), but the question is, partitioning the array into k non empty subsets.

    → Reply