problem79.py 1.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. #!/usr/bin/env python
  2. codes = [319, 680, 180, 690, 129, 620, 762, 689, 762, 318, 368, 710, 720, 710,
  3. 629, 168, 160, 689, 716, 731, 736, 729, 316, 729, 729, 710, 769, 290,
  4. 719, 680, 318, 389, 162, 289, 162, 718, 729, 319, 790, 680, 890, 362,
  5. 319, 760, 316, 729, 380, 319, 728, 716]
  6. def indices(partial):
  7. ind = []
  8. start = 0
  9. for c in partial:
  10. index = passcode[start:].find(c)
  11. if index == -1:
  12. return []
  13. ind.append(index + start)
  14. start = index + 1
  15. return ind
  16. def match(code):
  17. partials = (code, code[1:], code[:2], code[::2], code[0], code[1], code[2])
  18. for i, partial in enumerate(partials):
  19. ind = indices(partial)
  20. if ind:
  21. return partial, i, ind
  22. return None, None, None
  23. #codes.sort()
  24. codes = map(str, set(codes))
  25. passcode = codes.pop(0)
  26. print passcode
  27. while len(codes):
  28. possibilities = [(0, -1, [])]
  29. for index, code in enumerate(codes):
  30. partial, i, ind = match(code)
  31. if ind:
  32. #print code, partial, ind
  33. possibilities.append((index, i, ind, partial))
  34. possibilities.sort(lambda a, b: cmp(len(a[2]), len(b[2])))
  35. #print possibilities
  36. index, i, ind, partial = possibilities[-1]
  37. code = codes.pop(index)
  38. if i == 1:
  39. passcode = code[0] + passcode
  40. elif i == 2:
  41. passcode += code[2]
  42. elif i == 3:
  43. passcode = passcode[:ind[0]] + code[1] + passcode[ind[0]:]
  44. elif i == 4:
  45. passcode += code[1:]
  46. elif i == 5:
  47. passcode = code[0] + passcode + code[2]
  48. elif i == 6:
  49. passcode = code[:2] + passcode
  50. elif i == -1:
  51. passcode += code
  52. print code, partial, passcode
  53. #print len(passcode), len(codes) * 3, passcode
  54. #print passcode