Простое число

RobertDeMilo

Oct 28th, 2023 (edited)

Never

Add comment

Not a member of Pastebin yet? Sign Up, it unlocks many cool features!

C++ 1.00 KB | None | 0 0

raw download clone embed print report

#include <iostream>
#include <iomanip>
#include <cstdlib>
using namespace std;
bool IsPrime(int n)
{
if (n < 2)
{
return false;
}
int i = 2;
while (i * i <= n)
{
if (n % i == 0)
{
return false;
}
++i;
}
return true;
}
int main() {
cout << boolalpha;
cout << IsPrime(97);
return 0;
}
///////////////////////////////////////////////////////////////////////////////////
#include <iostream>
using namespace std;
int main()
{
const int max_prime_number = 100;
bool the_prime_number;
cout << "2";
for (int prime_number = 3; prime_number <= max_prime_number; prime_number++)
{
the_prime_number = true;
for (int divisor = 2; the_prime_number && divisor < prime_number; divisor++)
{
if (prime_number % divisor == 0)
{
the_prime_number = false;
}
}
if (the_prime_number)
{
cout << ", " << prime_number;
}
}
cout << endl;
}

Add Comment

Please, Sign In to add comment