/** Auti i askisi krataei mono tous protous apo enan pinaka 
kai tous bazei se allo pinaka **/
# include <stdio.h>
# include <stdlib.h>

int isPrime(int n)
{
	int i;
	for(i=2;i<n/2;i++)
	{
		if(n%i==0) return 0;
	}
	return 1;
}

int  *copyPrimes(int x[],int size,int *totalPrimes)
{
	int counterPrimes=0;
	int i;
	int *dest=NULL;
	int pos=0;
	for(i=0;i<size;i++)
	{
		if(isPrime(x[i])) counterPrimes++;
	}
	dest = (int *)malloc( sizeof(int) * counterPrimes);
	for(i=0;i<size;i++)
	{
		if(isPrime(x[i]))
		{
			dest[pos]=x[i];
			pos++;
		}
	}
	*totalPrimes = counterPrimes;
	return dest;
}

int main()
{
	int x[5]={10,7,11,5,12};
	int totalPrimes;
	int i;
	int *primeArray = copyPrimes(x,5,&totalPrimes);
	for(i=0;i<totalPrimes;i++)
	{
		printf("prime = %d \n",primeArray[i]);
	}
	free(primeArray);
	return 0;
}