golden hour
/usr/lib64/python2.7/Demo/scripts
⬆️ Go Up
Upload
File/Folder
Size
Actions
README
1009 B
Del
OK
beer.py
459 B
Del
OK
beer.pyc
703 B
Del
OK
beer.pyo
703 B
Del
OK
eqfix.py
6.16 KB
Del
OK
eqfix.pyc
4.52 KB
Del
OK
eqfix.pyo
4.52 KB
Del
OK
fact.py
1.11 KB
Del
OK
fact.pyc
1.14 KB
Del
OK
fact.pyo
1.14 KB
Del
OK
find-uname.py
1.18 KB
Del
OK
find-uname.pyc
1.47 KB
Del
OK
find-uname.pyo
1.47 KB
Del
OK
from.py
874 B
Del
OK
from.pyc
749 B
Del
OK
from.pyo
749 B
Del
OK
lpwatch.py
2.77 KB
Del
OK
lpwatch.pyc
2.54 KB
Del
OK
lpwatch.pyo
2.54 KB
Del
OK
makedir.py
510 B
Del
OK
makedir.pyc
732 B
Del
OK
makedir.pyo
732 B
Del
OK
markov.py
3.51 KB
Del
OK
markov.pyc
3.93 KB
Del
OK
markov.pyo
3.93 KB
Del
OK
mboxconvert.py
3.11 KB
Del
OK
mboxconvert.pyc
3.17 KB
Del
OK
mboxconvert.pyo
3.17 KB
Del
OK
morse.py
4.21 KB
Del
OK
morse.pyc
4.33 KB
Del
OK
morse.pyo
4.33 KB
Del
OK
newslist.doc
2.36 KB
Del
OK
newslist.py
11.17 KB
Del
OK
newslist.pyc
7.55 KB
Del
OK
newslist.pyo
7.55 KB
Del
OK
pi.py
888 B
Del
OK
pi.pyc
921 B
Del
OK
pi.pyo
921 B
Del
OK
pp.py
3.73 KB
Del
OK
pp.pyc
2.28 KB
Del
OK
pp.pyo
2.28 KB
Del
OK
primes.py
603 B
Del
OK
primes.pyc
921 B
Del
OK
primes.pyo
921 B
Del
OK
queens.py
2.19 KB
Del
OK
queens.pyc
2.95 KB
Del
OK
queens.pyo
2.95 KB
Del
OK
script.py
962 B
Del
OK
script.pyc
1.21 KB
Del
OK
script.pyo
1.21 KB
Del
OK
unbirthday.py
3.07 KB
Del
OK
unbirthday.pyc
2.93 KB
Del
OK
unbirthday.pyo
2.93 KB
Del
OK
update.py
2.69 KB
Del
OK
update.pyc
2.69 KB
Del
OK
update.pyo
2.69 KB
Del
OK
Edit: fact.py
#! /usr/bin/env python # 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 def fact(n): if n < 1: raise ValueError('fact() argument should be >= 1') if n == 1: return [] # special case res = [] # Treat even factors special, so we can use i += 2 later while n % 2 == 0: res.append(2) n //= 2 # Try odd numbers up to sqrt(n) limit = sqrt(n+1) i = 3 while i <= limit: if n % i == 0: res.append(i) n //= i limit = sqrt(n+1) else: i += 2 if n != 1: res.append(n) return res def main(): if len(sys.argv) > 1: source = sys.argv[1:] else: source = iter(raw_input, '') for arg in source: try: n = int(arg) except ValueError: print arg, 'is not an integer' else: print n, fact(n) if __name__ == "__main__": main()
Save