PATH:
usr
/
lib64
/
python2.7
/
Demo
/
scripts
#! /usr/bin/env python # Print digits of pi forever. # # The algorithm, using Python's 'long' integers ("bignums"), works # with continued fractions, and was conceived by Lambert Meertens. # # See also the ABC Programmer's Handbook, by Geurts, Meertens & Pemberton, # published by Prentice-Hall (UK) Ltd., 1990. import sys def main(): k, a, b, a1, b1 = 2, 4, 1, 12, 4 while True: # Next approximation p, q, k = k*k, 2*k+1, k+1 a, b, a1, b1 = a1, b1, p*a+q*a1, p*b+q*b1 # Print common digits d, d1 = a//b, a1//b1 while d == d1: output(d) a, a1 = 10*(a%b), 10*(a1%b1) d, d1 = a//b, a1//b1 def output(d): # Use write() to avoid spaces between the digits sys.stdout.write(str(d)) # Flush so the output is seen immediately sys.stdout.flush() if __name__ == "__main__": main()
[-] pi.pyo
[edit]
[-] eqfix.pyo
[edit]
[-] makedir.pyc
[edit]
[-] queens.py
[edit]
[-] queens.pyo
[edit]
[-] pp.py
[edit]
[-] unbirthday.py
[edit]
[-] update.pyo
[edit]
[-] fact.pyc
[edit]
[-] pp.pyc
[edit]
[-] primes.pyo
[edit]
[-] markov.pyc
[edit]
[-] eqfix.py
[edit]
[-] mboxconvert.pyo
[edit]
[+]
..
[-] newslist.py
[edit]
[-] README
[edit]
[-] newslist.pyc
[edit]
[-] markov.py
[edit]
[-] newslist.pyo
[edit]
[-] pi.pyc
[edit]
[-] morse.py
[edit]
[-] beer.pyc
[edit]
[-] newslist.doc
[edit]
[-] beer.pyo
[edit]
[-] primes.py
[edit]
[-] pi.py
[edit]
[-] find-uname.pyc
[edit]
[-] makedir.pyo
[edit]
[-] eqfix.pyc
[edit]
[-] mboxconvert.pyc
[edit]
[-] fact.py
[edit]
[-] unbirthday.pyc
[edit]
[-] script.pyo
[edit]
[-] primes.pyc
[edit]
[-] find-uname.pyo
[edit]
[-] lpwatch.pyo
[edit]
[-] morse.pyo
[edit]
[-] fact.pyo
[edit]
[-] morse.pyc
[edit]
[-] from.py
[edit]
[-] from.pyo
[edit]
[-] makedir.py
[edit]
[-] update.py
[edit]
[-] lpwatch.pyc
[edit]
[-] find-uname.py
[edit]
[-] script.pyc
[edit]
[-] queens.pyc
[edit]
[-] from.pyc
[edit]
[-] unbirthday.pyo
[edit]
[-] lpwatch.py
[edit]
[-] beer.py
[edit]
[-] markov.pyo
[edit]
[-] update.pyc
[edit]
[-] pp.pyo
[edit]
[-] mboxconvert.py
[edit]
[-] script.py
[edit]