import scala.math.sqrt
def isPrime(n: Int): Int = {
if (n == 0 || n == 1) return 0
for (i <- 2 to sqrt(n).toInt) {
if (n % i == 0) {
return 0
}
}
return 1
}
val arr = List(9, 8, 17, 5, 19, 22, 21, 13, 38, 500, 99)
var sumprime = 0
for (i <- arr.indices) {
if (isPrime(arr(i)) == 1) { // 19 17 5 13
sumprime += arr(i)
}
}
println(sumprime)
/*
run:
54
*/