old_contents: #!/usr/bin/env python
  #-*-coding:utf-8-*-
  
  '''
  '''
  
  import timeit
  
  
  def calc():
      pandigital = set()
      for i in range(1, 10000):
          for j in range(i, int(10000/i)+1):
              if ''.join(sorted(list(str(i) + str(j) + str(i*j)))) == '123456789':
                  pandigital.add(i*j)
      return sum(pandigital)
  
  if __name__ == '__main__':
      print calc()
      print timeit.Timer('problem_032.calc()', 'import problem_032').timeit(1)
  
new_contents: #!/usr/bin/env python
  #-*-coding:utf-8-*-
  
  '''
  We shall say that an n-digit number is pandigital
  if it makes use of all the digits 1 to n exactly once;
  for example, the 5-digit number, 15234, is 1 through 5 pandigital.
  
  The product 7254 is unusual, as the identity, 39 × 186 = 7254,
  containing multiplicand, multiplier, and product is 1 through 9 pandigital.
  
  Find the sum of all products whose multiplicand/multiplier/product
  identity can be written as a 1 through 9 pandigital.
  
  HINT: Some products can be obtained in more than one way so
  be sure to only include it once in your sum.
  '''
  
  import timeit
  
  
  def calc():
      pandigital = set()
      for i in range(1, 10000):
          for j in range(i, int(10000/i)+1):
              if ''.join(sorted(list(str(i) + str(j) + str(i*j)))) == '123456789':
                  pandigital.add(i*j)
      return sum(pandigital)
  
  if __name__ == '__main__':
      print calc()
      print timeit.Timer('problem_032.calc()', 'import problem_032').timeit(1)
  
subject: add prblem sentence