View difference between Paste ID: 116gciNk and fszTiKLB

 #include <iostream>
 #include <iomanip>
 #include <cmath>
 using namespace std;
-
+
 bool isPrime(int number)
 {
-	for (int divisor = 2; divisor <= number / 2; divisor++)
+        for (int divisor = 2; divisor <= number / 2; divisor++)
-	{
+        {
-		if (number % divisor == 0)
+                if (number % divisor == 0)
-		{
+                {
-			return false;
+                        return false;
-		}
+                }
-	}
+        }
-	return true;
+        return true;
 }
 int intLen(int number)
 {
-	int len = 0;
+        int len = 0;
-	int temp = number;
+        int temp = number;
-	while (temp > 0)
+        while (temp > 0)
-	{
+        {
-		temp = temp / 10;
+                temp = temp / 10;
-		len++;
+                len++;
-	}
+        }
-	if (number == 0)
+        if (number == 0)
-		len = 1;
+                len = 1;
-
+
-	return len;
+        return len;
 }
-
+
 bool isPalindrome(int number)
 {
-		int length = intLen(number);
+                int length = intLen(number);
-		int n1 = number;
+
-
+                for (int i = length; i > 1; i--)
-		for (int i = length; i > 1; i--)
+                {
-		{
+                        int a = number / (pow(10, i-1));
-			int a = n1 % 10;
+                        int b = number % 10;
-			int n2 = n1 - a;
+                        cout << "\nnumber is: " << number << "\ti: " << i <<
-			i--;
+                                "\ta: " << a << "\tb: " << b << endl;
-			int b = n1 / (pow(10, i));
+
-			int n3 = n1 - (b * (pow(10, i)));
+                                if (a != b)
-			i--;
+                                {
-			cout << "\nn1 is: " << n1 << " \tn2 is: " << n2 << " \tn3 is: " << n3 << "\ti: " << i <<
+                                        return false;
-				"\ta: " << a << "\tb: " << b << "\tlength: " << length << endl;
+                                }
-
+						number /= 10;cout << "\nnumber is: " << number;
-				if (n2 != n3)
+						number -= b * (pow(10, i-1));cout << "\nnumber is: " << number;
-				{
+                }
-					return false;
+                return true;
-					break;
+
-				}
+
-		}
+
-		return true;
+
         const int NUMBER_OF_POINTS = 100;
-
+        int counter = 0;
         int number = 2;
 
-	const int NUMBER_OF_POINTS = 100;
+        while (counter < numberOfPrimes)
-	int counter = 0;
+        {
-	int number = 2;
+                if (isPrime(number) && isPalindrome(number))
-
+                {
-	while (counter < numberOfPrimes)
+                        counter++;
-	{
+                        if (counter % 10 == 0)
-		if (isPrime(number) && isPalindrome(number))
+                        {
-		{
+                                cout << setw(7) << number << endl;
-			counter++;
+                        }
-			if (counter % 10 == 0)
+                        else
-			{
+                                cout << setw(7) << number;
-				cout << setw(4) << number << endl;
+                }
-			}
+                number++;
-			else
+        }
-				cout << setw(4) << number;
+
-		}
+
-		number++;
+int main()
-	}
+
         cout << "First 100 Primes and Palindromes are \n";
-
+        printPrimePalindromes(100);
-	int main()
+        return 0;
-	{
+}