Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link ×

its_ulure's blog

By its_ulure, history, 21 month(s) ago, In English,

I came across a problem few days ago. The problem states that given a set of n numbers , we need to divide the set into k groups (where, 1<=k<n)) such that the maximum product(of the numbers) in all the possible groups is minimal. Thanks in advance :)

Read more »

  • Vote: I like it
  • +13
  • Vote: I do not like it