generalization bug fix

062.py

@@ -9,21 +9,35 @@
 when the length of the list of cuve for a key reaches permutation we are done!
 """
 
+import sys
 from collections import defaultdict
 
 def find(permutation):
     """
     >>> find(3)
     41063625
+    >>> find(5)
+    127035954683
+    >>> find(6)
+    1000600120008
     """
     seen = defaultdict(list)
     i = 1
+    result = sys.maxint
+    count = sys.maxint
     while True:
         cube = i ** 3
         key = ''.join( sorted(digit for digit in str(cube)) )
         seen[key].append(cube)
         if len(seen[key]) == permutation:
-            return min(seen[key])
+            # the first encounter may not yield the smallest
+            min_ = min(seen[key])
+            result = min_ if min_ < result else result
+            count = len(key)
+        # if the new key is longer than the smallest solution so far
+        if len(key) > count:
+            return result
+
         i += 1
 
 if __name__ == '__main__':