github/euler
1
0
Fork 0
mirror of https://github.com/correl/euler.git synced 2024-11-27 19:19:50 +00:00
Code Issues Projects Releases Packages Wiki Activity

Completed problem 012

Browse source 
git-svn-id: file:///srv/svn/euler@37 e5f4c3ec-3c0c-11df-b522-21efaa4426b5
This commit is contained in:
Correl Roush 2010-04-12 15:53:16 +00:00
parent d29322f502
commit cb0cd33bfa
1 changed files with 12 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
e012.py
View file

@ -22,15 +22,23 @@ def product(l):
def factor(n):
primes = pfactor(n)
factors = []
factors = [1, n]
pow = {}
for p in primes:
if p not in pow.keys():
pow[p] = 0
pow[p] = pow[p] + 1
factors.append(p**pow[p])
for p in [f for f in factors if f < n / 2]:
for p in [f for f in factors if f > 1]:
f = n / p
if f not in factors:
factors.append(n / p)
combos = unique_combinations(factors, 2)
for c in combos:
f = product(c)
if f < n and n % f == 0 and f not in factors:
factors.append(f)
if n not in factors:
factors.append(n)
@ -42,7 +50,7 @@ if __name__ == '__main__':
i = i + 1
t = triangle(i)
f = factor(t)
print 'Checking triangle', i, t
print 'Checking triangle', i, t, len(f)
if len(f) > 500:
break