素因数分解したかった

prime_decomposition.py

import math
def prime_decomposition(n):
  array = []
  primes = primetable(int(math.ceil(math.sqrt(n))))
  while n > 1:
    for p in primes:
      if n % p == 0:
        n /= p
        array.append(p)
        break
    else:
      array.append(n)
      break
    
  return array

def primetable(max):
  sq = math.sqrt(max)
  table = []

  t = range(0, max+1)
  t[0] = 0
  t[1] = 0
  p = 2
  while p <= sq:
    if t[p] != 0:
      j = p + p
      while j <= max:
        t[j] = 0
        j += p
    p += 1
  for p in t:
    if p != 0:
      table.append(p)
  return table

if __name__ == '__main__':
  print prime_decomposition(14)

yuizumi
おおお、ありがとうございます(´；ω；｀)
ちゃんと直してみたいと思います！！！