new_contents: #!/usr/bin/env python
  #-*-coding:utf-8-*-
  
  '''
  The number, 1406357289, is a 0 to 9 pandigital number
  because it is made up of each of the digits 0 to 9 in some order,
  but it also has a rather interesting sub-string divisibility property.
  
  Let d1 be the 1st digit, d2 be the 2nd digit, and so on.
  In this way, we note the following:
  
  d2d3d4=406 is divisible by 2
  d3d4d5=063 is divisible by 3
  d4d5d6=635 is divisible by 5
  d5d6d7=357 is divisible by 7
  d6d7d8=572 is divisible by 11
  d7d8d9=728 is divisible by 13
  d8d9d10=289 is divisible by 17
  
  Find the sum of all 0 to 9 pandigital numbers with this property.
  '''
  
  from itertools import permutations
  import timeit
  
  
  def loop(n):
      digits = []
      for s in get_pandigitals(n):
          if int(s[1:4]) % 2 == 0 \
                  and int(s[2:5]) % 3 == 0\
                  and int(s[3:6]) % 5 == 0\
                  and int(s[4:7]) % 7 == 0\
                  and int(s[5:8]) % 11 == 0\
                  and int(s[6:9]) % 13 == 0\
                  and int(s[7:10]) % 17 == 0:
              digits.append(int(s))
      return sum(digits)
  
  
  def get_pandigitals(n):
      return [''.join(s) for s in permutations([str(i) for i in xrange(n)], n)]
  
  
  if __name__ == '__main__':
      print loop(10)
      print timeit.Timer('problem_043.loop(10)', 'import problem_043').timeit(1)
  
subject: add problem 43