1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
/* The Computer Language Shootout
http://shootout.alioth.debian.org/
contributed by Isaac Gouy
*/
object nsieve {
def nsieve(m: Int, isPrime: Array[Boolean]) = {
var i = 2
while (i < m){ isPrime(i) = true; i = i+1 }
var count = 0
i = 2
while (i < m){
if (isPrime(i)){
var k = i+i
while (k < m){ isPrime(k) = false; k = k+i }
count = count + 1
}
i = i+1
}
count
}
def main(args: Array[String]) {
val n = Integer.parseInt(args(0))
val m = (1<<n)*10000
val flags = new Array[Boolean](m+1)
def printPrimes(m: Int) = {
def pad(i: Int, width: Int) = {
val s = i.toString
List.range(0, width - s.length)
.map((i) => " ") .foldLeft("")((a,b) => a+b) + s
}
Console.println("Primes up to " + pad(m,8) + pad(nsieve(m,flags),9))
}
printPrimes(m)
printPrimes( (1<<n-1)*10000 )
printPrimes( (1<<n-2)*10000 )
}
}
|
