correctly label euler solutions

examples/puzzles/euler_12.zr

@@ -1,11 +1,21 @@
-func main[] : i64
-    let found: i64 = 0
+func num_divisors[n: i64] : i64
+    let end: i64 = math.isqrt(n)
 
+    let out: i64 = 0
+    for i in 1..end+1
+        if n % i == 0
+            out = out + 2
+
+    if end * end == n
+        out = out - 1
+    return out
+
+func main[] : i64
+    let n: i64 = 0
     let i: i64 = 1
     while true
-        if math.is_prime(i)
-            found = found + 1
-            if found == 10001
-                io.println_i64(i)
-                break
+        n = n + i
+        if num_divisors(n) > 500
+            io.println_i64(n)
+            break
         i = i + 1