JOIN
 Select a Forum     Round Tables New Member Discussions News Discussions Algorithm Matches Marathon Matches NASA Tournament Lab TopCoder Cookbook High School Matches Sponsor Discussions Development Forums Design Forums Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings View: Flat (oldest first)  | Threaded  | Tree Previous Thread  |  Next Thread Forums Algorithm Matches 2016 TCO Regional Wildcard and Fun Round approach to solve DivideJewelry problem
 Re: approach to solve DivideJewelry problem (response to post by animeshsharma) | Reply We should find smallest K that satisfies 2^K >= K*1000000.If 2^K < K*1000000, maybe there is no two different subsets which sum is equal.
 Re: approach to solve DivideJewelry problem (response to post by ACE347) | Reply I wanted to know why taking 25 is correct and similarly would taking 20 will be correct or not?
 Re: approach to solve DivideJewelry problem (response to post by animeshsharma) | Reply The count of all subsets from 1000 items is 2^1000 it is very big. But 2^25 ~ 32 000 000 it is not so much
 approach to solve DivideJewelry problem | Reply I have gone through many of the solution for the problem DivideJewelry and saw most of them used 25 and I don't understand what's the use of that 25 and why can't we use any other value. can anyone please explain there soultion.
 Forums Algorithm Matches 2016 TCO Regional Wildcard and Fun Round approach to solve DivideJewelry problem Previous Thread  |  Next Thread