Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- #include <iomanip>
- using namespace std;
- bool isPrime(int number)
- {
- for (int divisor = 2; divisor <= number / 2; divisor++)
- {
- if (number % divisor == 0)
- {
- return false;
- }
- }
- return true;
- }
- //-------------------------------------------------------------
- char digitToChar(int d)
- {
- return static_cast<char>(d + '0');
- }
- //-------------------------------------------------------------
- string intToString(int number)
- {
- string s = "";
- while (number > 0)
- {
- s = digitToChar(number % 10) + s;
- number = number / 10;
- }
- if (s == "")
- s = digitToChar(0);
- return s;
- }
- //---------------------------------------------------------------
- bool isPalendrome(int number)
- {
- string s = intToString(number);
- int low = 0;
- int high = s.length() - 1;
- while (low < high)
- {
- if (s[low] != s[high])
- {
- return false;
- break;
- }
- low++;
- high--;
- }
- }
- //------------------------------------------------------------------
- void printTable(int points)
- {
- const int PAP = 10;
- int count = 0;
- int number = 2;
- while (count < points)
- {
- if (isPalendrome(number) && isPrime(number))
- {
- count++;
- if (count % PAP == 0)
- {
- cout << setw(8) << number << endl;
- }
- else
- {
- cout << setw(8) << number;
- }
- }
- number++;
- }
- }
- int main()
- {
- cout << " prime and pal \n" << endl;
- printTable(100);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement