summaryrefslogtreecommitdiffstats
path: root/Demo
diff options
context:
space:
mode:
authorGeorg Brandl <georg@python.org>2009-10-11 08:49:57 (GMT)
committerGeorg Brandl <georg@python.org>2009-10-11 08:49:57 (GMT)
commitedbc50cd0eb8156ba22d056ecd750d76f7651ec5 (patch)
tree87a55614bdfb2273b61113fba600a4af4b981c06 /Demo
parent5f8814dabd35b2e349ab2c9ea24c7275d8d4b020 (diff)
downloadcpython-edbc50cd0eb8156ba22d056ecd750d76f7651ec5.zip
cpython-edbc50cd0eb8156ba22d056ecd750d76f7651ec5.tar.gz
cpython-edbc50cd0eb8156ba22d056ecd750d76f7651ec5.tar.bz2
Merged revisions 75344 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk ........ r75344 | georg.brandl | 2009-10-11 10:48:28 +0200 (So, 11 Okt 2009) | 1 line Update primes script. ........
Diffstat (limited to 'Demo')
-rw-r--r--Demo/scripts/README2
-rwxr-xr-xDemo/scripts/primes.py30
2 files changed, 18 insertions, 14 deletions
diff --git a/Demo/scripts/README b/Demo/scripts/README
index 18f0de8..bf0f142 100644
--- a/Demo/scripts/README
+++ b/Demo/scripts/README
@@ -2,7 +2,7 @@ This directory contains a collection of executable Python scripts.
See also the Tools/scripts directory!
-beer.py Print the classic 'bottles of beer' list.
+beer.py Print the classic 'bottles of beer' list
eqfix.py Fix .py files to use the correct equality test operator
fact.py Factorize numbers
find-uname.py Search for Unicode characters using regexps
diff --git a/Demo/scripts/primes.py b/Demo/scripts/primes.py
index 0924aab..65da42e 100755
--- a/Demo/scripts/primes.py
+++ b/Demo/scripts/primes.py
@@ -2,26 +2,30 @@
# Print prime numbers in a given range
+def primes(min, max):
+ if 2 >= min:
+ print(2)
+ primes = [2]
+ i = 3
+ while i <= max:
+ for p in primes:
+ if i % p == 0 or p*p > i:
+ break
+ if i % p != 0:
+ primes.append(i)
+ if i >= min:
+ print(i)
+ i += 2
+
def main():
import sys
min, max = 2, 0x7fffffff
if sys.argv[1:]:
- min = int(eval(sys.argv[1]))
+ min = int(sys.argv[1])
if sys.argv[2:]:
- max = int(eval(sys.argv[2]))
+ max = int(sys.argv[2])
primes(min, max)
-def primes(min, max):
- if 2 >= min: print(2)
- primes = [2]
- i = 3
- while i <= max:
- for p in primes:
- if i%p == 0 or p*p > i: break
- if i%p != 0:
- primes.append(i)
- if i >= min: print(i)
- i = i+2
if __name__ == "__main__":
main()