klittlepage

#!/usr/bin/env python

"""
A pythonic example of solving the subset sum problem in pseudo polynomial time
via dynamic programming.
"""

def subset_sum(integers, target_sum=0):
    """
    Returns a boolean indicating whether the given list of integers contains a

klittlepage

Keybase proof

I hereby claim:

• I am klittlepage on github.
• I am klittlepage (https://keybase.io/klittlepage) on keybase.
• I have a public key whose fingerprint is 4637 1022 13BB E1A0 9801 A960 B601 7485 726C 9B4C

To claim this, I am signing this object:

klittlepage

daemon=1800                             # check every 300 seconds
syslog=yes                              # log update msgs to syslog
mail=root                               # mail all msgs to root
mail-failure=root                       # mail failed update msgs to root
pid=/var/run/ddclient.pid               # record PID in file.
ssl=yes                                 # use ssl-support.  Works with
                                        # ssl-library

use=web, web=checkip.dyndns.com/, web-skip='IP Address'
cache=/tmp/ddclient.cache

klittlepage

--- ddclient-3.8.1/ddclient	2011-07-11 15:04:21.000000000 -0600
+++ ddclient	2013-10-30 19:51:54.056629680 -0600
@@ -1,4 +1,3 @@
-#!/usr/bin/perl -w
 #!/usr/local/bin/perl -w
 ######################################################################
 # $Id: ddclient 130 2011-07-11 21:02:07Z wimpunk $
@@ -13,12 +12,18 @@
 # Support for multiple IP numbers added by
 # Astaro AG, Ingo Schwarze <ischwarze-OOs/[email protected]> September 16, 2008