int CheckPrime(int k)
{
    int i=0;
	int m=(int)floor(sqrt(k));
	for(i=2;i<=m;i++)
	{
	    if((k%i)==0) return 0;// means k is composite
	}
	return 1; // means that k is prime
}

int CheckPrime2(int k,int *ans,int u)
{
        int i=0;
	int m;
        if(u<5) return CheckPrime(k);
        m=(int)floor(sqrt(k));
	for(i=0;i<u && ans[i]<=m;i++)
	{
	    if((k%ans[i])==0) return 0;// means k is composite
	}
	return 1; // means that k is prime
}


void FindPrime(int n, int *ans)
{
	int i=0,k=2;
	while(i<n)
	{
		if(CheckPrime2(k,ans,i)) // if k is the prime:
		{
			ans[i]=k;
			i++;
		}
		k++;
	}
}