Permalink
Browse files

initial commit

  • Loading branch information...
0 parents commit efafd8f0aea20ff15ba73ceefb07c8494d9a2aaf @micahalles committed May 31, 2011
Showing with 4 additions and 0 deletions.
  1. 0 .gitignore
  2. +4 −0 README
No changes.
4 README
@@ -0,0 +1,4 @@
+You are a drug trafficker. Every day you meet with a different nice old lady (the mule) and find out how much weight she can carry in her handbag. You then meet with your supplier who has packed various drugs into a myriad of collectible porcelain dolls. Once packed with drugs, each of the precious dolls has a unique combination of weight and street value. Sometimes your supplier has more dolls than grandma can carry, though space in her handbag is never an issue. Your job is to choose which dolls the nice old lady will carry, maximizing street value, while not going over her weight restriction.
+
+Write a program in Clojure that chooses the optimal set of drug-packed porcelain dolls from a set where each has a unique weight and value combination, while staying within a given weight restriction, W, that maximizes the street value of drugs delivered by the grandma, including a set of executable high-level tests for your solution.
+

0 comments on commit efafd8f

Please sign in to comment.