-
Notifications
You must be signed in to change notification settings - Fork 5
/
PrimeEmirpTestFunctions.cpp
65 lines (54 loc) · 1.27 KB
/
PrimeEmirpTestFunctions.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <cmath>
#include <cstdlib>
bool isPrime(const std::size_t number);
bool isEmirp(const std::size_t number);
std::size_t reverseNumber(std::size_t number);
int main()
{
std::size_t number = 0;
std::cout << "Enter a number: ";
std::cin >> number;
if (isPrime(number))
{
std::cout << number << " is NOT a PRIME number.\n";
return EXIT_SUCCESS;
}
std::cout << number << " is a PRIME number.\n";
if (isEmirp(number))
{
std::cout << number << " is also an EMIRP number.\n";
}
else
{
std::cout << number << " is NOT an EMIRP number.\n";
}
return EXIT_SUCCESS;
}
bool isPrime(const std::size_t number)
{
const double squareRoot = sqrt(number);
for (std::size_t i = 2; i <= squareRoot; ++i)
{
if (number % i == 0)
{
return false;
}
}
return true;
}
bool isEmirp(const std::size_t number)
{
const std::size_t reversedNumber = reverseNumber(number);
return isPrime(reversedNumber);
}
std::size_t reverseNumber(std::size_t number)
{
std::size_t reversedNumber = 0;
while (number > 0)
{
reversedNumber = (reversedNumber * 10) + (number % 10);
number /= 10;
}
return reversedNumber;
}