Heló! A LÉNYEG LENT LESZ! AZ lenne a kérdés, hogy tud-e valaki küldeni egy ilyen kész programot vagy egy kis segítséget hozzá?

int main ()

{

int n;

cout << "Enter an integer !"<<endl;

cin>>n;

if (n%2==0)

cout << n<< " is not prime number" << endl;

else if (n%2==1)

cout<<n<<" is a prime number"<< endl;

system("pause");

return 0;

}

Akkor ez jobb:

#include <iostream>

using namespace std;

int main ()

{

int n;

cout << "Enter an intger !"<<endl;

cin>>n;

if(n == 2)

cout<<"2 is the only even prime number"<<endl;

else if (n%2==0)

cout << n<< " is not prime number" << endl;

if ((n%3==0) || (n%5==0) || (n%7==0))

cout<< n<<" is prime number"<<endl;

else if (n%2==1)

cout<<n<<" is mot a prime number"<< endl;

system("pause");

return 0;

}

bool IsPrimeHelper(int number, int div, int to)

{

if (div >= to) { return true; }

if (number % div == 0) { return false; }

return IsPrimeHelper(number, div + 2, to);

}

bool IsPrime(int number)

{

if (number < 2) { return false; }

if (number == 2) { return true; }

if (number % 2 == 0) { return false; }

return IsPrimeHelper(number, 3, std::sqrt(number));

}

for (int i = 0; i < 1'000'000; ++i)

{

if(IsPrime(i))

{

// ...

}

}