Zadahca 2

#include <iostream>

using namespace std;

bool isPrime(int n)
{
	// Corner case
	if (n <= 1)
		return false;

	// Check from 2 to n-1
	for (int i = 2; i < n; i++)
		if (n % i == 0)
			return false;

	return true;
}
// Function to check array size
int PrimeSizeCheck(int n)
{
	int cnt = 0;
	for (int i = 2; i <= n; i++) {
		if (isPrime(i))
			cnt++;
	}
	return cnt;
}

//Function to fill arr
void Primeinput(int n, int *primeArray,int sizeOfArr)
{
	int cntSize = 0;
	for (int i = 2; i <= n; i++) {
		if (isPrime(i))
			if (sizeOfArr > cntSize)
			{
				primeArray[cntSize] = i;
				cntSize++;
			}
			else
			{
				break;
			}
	}
}





int main()
{
	int numerK = 0;
	cout << "Vuvedete k i az shte namerq vsichki prosti chisla po malki ili ravni na k" << endl;
	cin >> numerK;

	int sizeOfArr = PrimeSizeCheck(numerK);
	int *PrimeArray = new int[sizeOfArr];
	Primeinput(numerK, PrimeArray, sizeOfArr); // fill

	int sumOfSimpleNum = 0;

	cout << "Sumata na vs prosti chisla na chetni pozicii: " << endl;
	for (int i = 0; i < sizeOfArr; i++)
	{
		if (i % 2 == 0)
		{
			cout << " " << PrimeArray[i+1] << " ";
			sumOfSimpleNum += PrimeArray[i+1];
		}
	}

	cout << endl << "Sumata ot tezi chisla e : " << sumOfSimpleNum << endl;





	delete[] PrimeArray;
	PrimeArray = NULL;
	return 0;
}