Lista 8 - Exercício 13

include <stdio.h>
#include <stdlib.h>

int* primeGen(int quant);
int checkPrime(int num);

int main() {
    int i,quant,*primeVect;

    printf("Entre com a quantidade de numeros a ser gerados :\n");
    scanf("%d",&quant);

    primeVect = primeGen(quant);

    printf("\nLista de primos :\n");
    for (i = 0; i < quant; i++,primeVect++)
        printf("%d ",*primeVect);

    return 0;
}

int* primeGen(int quant) {
    int *vector,*q,i,var = 2,counter = 0;

    vector = (int*)malloc(sizeof(int)*quant);
    q = vector;

    for(i = var; counter < quant ; i++)
        if(checkPrime(i) == 1) {
            *q++ = i;
            counter++;
        }

    return vector;
}

int checkPrime(int num) {
    int i,counter = 0;

    for (i = 2; i < num; i++){
        if(num % i == 0) {
            counter++;
            break;
        }
    }
    if (counter == 0)
        return 1;
    else
        return 0;
}