[Purdue-pm] stamp problem

Joe Kline gizmo at purdue.edu
Thu Feb 14 11:36:52 PST 2013


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Here's a quick problem that is practical but not necessarily best
solved by Perl.

I have the following stamps:

37 cent=7
39 cent=19
42 cent=4
44 cent=9
 4 cent=2
 1 cent=8

What are the fewest number of stamps to be able to use all of the
stamps for 1st class mail (currently 46 cents)?

Stamps available for purchase:

 1 cent
 2 cent
 5 cent
10 cent
20 cent

Probably faster to solve by hand, but probably can be done
computationally.

joe
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.11 (GNU/Linux)
Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/

iEYEARECAAYFAlEdPMYACgkQb0mzA2gRTplLtACgnGmVDoM1Mb8POMFUQ7uPb3dD
P2kAoICLF/MfL9WiKLdJ1SZ/xEzf/irv
=wjid
-----END PGP SIGNATURE-----


More information about the Purdue-pm mailing list