function isPrime(n: number) {
if (n === 0 || n === 1) return 0;
for (let i: number = 2; i <= Math.sqrt(n); i++) {
if (n % i === 0) {
return 0;
}
}
return 1;
}
const arr: number[] = [9, 8, 17, 5, 19, 22, 21, 13, 38, 500, 99, 31];
let sumprime: number = 0;
for (let i: number = 0; i < arr.length; i++) {
if (isPrime(arr[i])) { // 31 19 17 5 13
sumprime += arr[i];
}
}
console.log(sumprime);
/*
85
*/