Mode:
Duration:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
const std = @import("std");
fn isPrime(n: u32) bool {
if (n < 2) return false;
for (2..std.math.sqrtInt(u32, n)+1) |i| {
if (n % i == 0) return false;
}
return true;
}
pub fn main() void {
const nums: [3]u32 = [3]u32{7, 10, 13};
for (nums) |num| {
std.debug.print("{d} is {s}\n", .{num, if (isPrime(num)) "Prime" else "Not Prime"});
}
}Coding works best on desktop or with an external keyboard.