Cody

Thonigon

1313
Rank
2
Badges
770
Score
1 – 50 of 79

Thonigon submitted Solution 847019 to Problem 43. Subset Sum

on 8 Mar 2016

Thonigon submitted a Comment to Problem 43. Subset Sum

At first I thought that it was quite difficult to look for the sets of elements of any size (sets of 1 element, 2 elements and so on), but then I realised that any selection of the vector elements correspond to a binary code ('1' for selecting that element and '0' for not selecting it). To select all possible elements combinations I only need to use the binary code from 1 to 2^(1+length(v))-1.

on 8 Mar 2016

Thonigon submitted a Comment to Problem 43. Subset Sum

At first I thought that it was quite difficult to look for the sets of elements of any size (sets of 1 element, 2 elements and so on), but then I realised that any selection of the vector elements correspond to a binary code ('1' for selecting that element and '0' for not selecting it). To select all possible elements combinations I only need to use the binary code from 1 to 2^(1+length(v))-1.

on 8 Mar 2016

Thonigon received Commenter badge for Problem 43. Subset Sum

on 8 Mar 2016

Thonigon submitted Solution 844505 to Problem 53. Duplicates

on 6 Mar 2016

Thonigon submitted Solution 843096 to Problem 76. De-dupe

on 4 Mar 2016

Thonigon submitted Solution 843059 to Problem 27. Pangrams!

on 4 Mar 2016

Thonigon submitted Solution 842139 to Problem 41. Cell joiner

on 3 Mar 2016

1 – 50 of 79