Mode:
Duration:
1
2
3
4
5
6
7
8
9
10
11
12
bool isPrime(int n) {
if (n < 2) return false;
for (int i = 2; i*i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
int[] nums = {7, 10, 13};
foreach (int n in nums) {
stdout.printf("%d is %s\n", n, isPrime(n) ? "Prime" : "Not Prime");
}Coding works best on desktop or with an external keyboard.