#include <stdio.h>
#include <stdbool.h>
void find_primes(long limit, long *primes) {
long numbers[limit];
for (int i = 0; i < limit; i++) {
numbers[i] = i + 2;
}
for (int i = 0; i < limit; i++) {
if (numbers[i] != -1) {
for (long j = 2 * numbers[i] - 2; j < limit; j += numbers[i]) {
numbers[j] = -1;
}
}
}
int j = 0;
for (int i = 0; i < limit; i++) {
if(numbers[i] != -1){
primes[j++] = numbers[i];