diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-08-11 22:41:34 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-08-11 22:41:34 +0200 |
| commit | 1879caa1dd80cb11dd62403663917ad4bf7cc68e (patch) | |
| tree | ea41c6dd83a9f9bbfe0a891237674342de92d533 /python/003-prime_fact.py | |
| parent | 6b16d921543a62d880171791d39bcc58560785fa (diff) | |
| download | project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.tar.gz project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.tar.bz2 project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.zip | |
rename all file with 3 zero padding
Diffstat (limited to 'python/003-prime_fact.py')
| -rw-r--r-- | python/003-prime_fact.py | 19 |
1 files changed, 19 insertions, 0 deletions
diff --git a/python/003-prime_fact.py b/python/003-prime_fact.py new file mode 100644 index 0000000..6f73c10 --- /dev/null +++ b/python/003-prime_fact.py @@ -0,0 +1,19 @@ +# It work but la flemme de couper la boucle quand on a atteint le dernier facteur. +number = 600851475143 +prime_factors = [] + +end = False +while not end: + + for divisor in range(2, number + 1): + + if number % divisor == 0: + prime_factors.append(divisor) + number = int(number / divisor) + print(prime_factors) + if divisor == number: + end = True + break + + +print(prime_factors) |
