Thank you to anyone who has already donated - your generous donations helped make three months of treatment possible.

My brother Nate continues to fight stage IV Hodgkin's lymphoma. He's just 31, with a wife and baby girl. They have no active income (since he's been unable to return to work), no insurance, and cannot afford the treatment he needs. Nate and his family need your help. Please consider a donation, every dollar helps. Thanks.

Read Nate's story Support Nate by buying an official Pastie t-shirt Hide this message

Document@2x
|
Chain_link@2x
|
Arrow_down@2x
|
Spiral_paper@2x
A A A

Haskell       Report abuse 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

import Control.Parallel

parfindDivisors :: Integer->[Integer]
parfindDivisors n = force f1 `par` (force f2 `pseq` (f1 ++ f2))
    where f1=filter g [1..(quot n 4)]
          f2=filter g [(quot n 4)+1..(quot n 2)]
          g z = n `rem` z == 0
          
force :: [a] -> ()
force xs = go xs `pseq` ()
    where go (_:xs) = go xs
          go [] = 1
          
findDivisors :: Integer->[Integer]
findDivisors n = filter g [1..(quot n 2)]
    where  g z = n `rem` z == 0
main = print (parfindDivisors 1000000000)