Project Euler -- 欧拉题集 F#及Haskell 版 - No.7, No.8

No7.

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

What is the 10 001st prime number?

Haskell:

isPrime x = primeAux x 2

        where primeAux x y | y > (round . sqrt . fromInteger $ x) = True
                           | x `mod` y == 0 = False
                           | otherwise      = primeAux x (y+1)

primes = filter isPrime [1..] --from 1, so 1 will be included in the [primes].

nthprime n =  primes !! n

F#:

let isPrime n=
     let upper = int (sqrt (float n))
     let rec auxPrime n m = if n % m = 0 then false
                               elif m > upper then true
                               else auxPrime n ( m + 1 )
     auxPrime n 2

let answer7 =
     let acc = ref 1
     let rec anwAux n =
               let t = isPrime n
               if t && !acc < 10000 then acc := !acc + 1; anwAux (n+1)
               elif t && !acc = 10000 then n
               else anwAux (n+1)
     anwAux 2

Answer: 104743

后语： Haskell 用lzay evaluation，构造出所有primes的集合。

No.8

Find the greatest product of five consecutive digits in the 1000-digit number.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

Haskell:

ans8 = maximum . map productOf5 . toXss

toXss []  = []
toXss (x:xs) = take 5 (x:xs) : toXss xs

productOf5 = product . map digitToInt

answer8 = ans8 "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"

F#：

let rec take n (xs:list<'T>) =
                 if List.length xs < n then xs
                 elif n = 0 then []
                 else  match xs with
                        | []      -> []
                        | y::ys -> y :: take (n-1) ys

let rec product ( xs : list<int> )= match xs with [] -> 1 | y::ys -> y * product ys

let digitToInt (c:char) = (int c) - (int '0')

let rec toXss xs =
     match xs with
           | []   -> []
           | _ -> if xs.Length < 5 then [xs]
                     else take 5 xs :: toXss xs.Tail

let productOf5 xs = xs |> toXss |> List.map (List.map digitToInt )  |> List.map product |> List.max

let answer8 = productOf5 (Seq.toList  "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450" )

Answer:  40824

后语： 将1000 digit 看做 string分组操作。

            F# 对seq的库函数比list多。

            Haskell 中 type String = [Char], 完全等价.

            F# 中，string 是用 array 来表示的，其转为 list<char> 时，要调用： Seq.toList

                         而list<char>转为 string 时：

              List.ofSeq xs |> List.toArray |> (fun s -> System.String s) 或者
              new string(xs |> Array.of_list)