Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Pi
import Control.Monad import System.IO pi_ = g(1,0,1,1,3,3) where g (q,r,t,k,n,l) = if 4*q+r-t < n*t then n : g (10*q, 10*(r-n*t), t, k, div (10*(3*q+r)) t - 10*n, l) else g (q*k, (2*q+r)*l, t*l, k+1, div (q*(7*k+2)+r*l) (t*l), l+2) digs = insertPoint digs' where insertPoint (x:xs) = x:'.':xs digs' = map (head . show) pi_ main = do hSetBuffering stdout $ BlockBuffering $ Just 80 forM_ digs putChar
run
|
edit
|
history
|
help
2
Please
log in
to post a comment.
Niet
Reader
haskell fibonacci
boolean functions of zero arguments in haskell
preparednessQuotient
Haskell Prime Factorizer
project euler 8, haskell
Haskell Tree example
Quicksort in Haskell
project euler 10, haskell
Please log in to post a comment.