mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-07-24 03:35:53 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 8

Adapt to mixed-mode arithmetic, and added a warning comment.

Browse source
This commit is contained in:
Guido van Rossum 1991-12-18 13:45:17 +00:00
parent 97dddba1bb
commit 1c8230b70d
1 changed files with 8 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

14
Demo/scripts/fact.py
View file

@ -1,7 +1,9 @@
#! /usr/local/python
# Factorize numbers, slowly.
# This version uses plain integers and is thus limited to 2**31-1.
# Factorize numbers.
# The algorithm is not efficient, but easy to understand.
# If there are large factors, it will take forever to find them,
# because we try all odd numbers between 3 and sqrt(n)...
import sys
from math import sqrt
@ -17,13 +19,13 @@ def fact(n):
res.append(2)
n = n/2
# Try odd numbers up to sqrt(n)
limit = int(sqrt(float(n+1)))
limit = sqrt(n+1)
i = 3
while i <= limit:
if n%i = 0:
res.append(i)
n = n/i
limit = int(sqrt(float(n+1)))
limit = sqrt(n+1)
else:
i = i+2
res.append(n)
@ -32,12 +34,12 @@ def fact(n):
def main():
if len(sys.argv) > 1:
for arg in sys.argv[1:]:
n = int(eval(arg))
n = eval(arg)
print n, fact(n)
else:
try:
while 1:
n = int(input())
n = input()
print n, fact(n)
except EOFError:
pass