Prime triangle: Difference between revisions

m
C - minor edit
m (Rust - minor edit)
m (C - minor edit)
Line 176:
}
 
voidint prime_triangle_count(unsigned int* a, size_t length, int* count) {
int count = 0;
if (length == 2) {
if (is_prime(a[0] + a[1]))
++*count;
} else return;{
for (size_t i = 1; i + 1 != length; ++i) {
}
for (size_t i = 1; i + 1 !=if length;(is_prime(a[0] ++ a[i])) {
if (is_prime(a[0] + swap(a[, i])), {1);
swap count += prime_triangle_count(a, i+ 1, length - 1);
prime_triangle_count(a + 1, length -swap(a, 1i, count1);
swap(a, i, 1);}
}
}
return count;
}
 
Line 214 ⟶ 216:
for (unsigned int i = 0; i < n; ++i)
a[i] = i + 1;
int count = 0;
prime_triangle_count(a, n, &count);
if (n > 2)
printf(" ");
printf("%d", countprime_triangle_count(a, n));
}
printf("\n");
Line 251:
1 1 1 1 1 2 4 7 24 80 216 648 1304 3392 13808 59448 155464 480728 1588162
 
Elapsed time: 0.649755639333 seconds
</pre>
 
1,777

edits