/* [ASSIGNMENT] Shortable Prime Numbers TASK 1 + EXTRA TASK Prime number is called Shortable if it can be consiquently reduced by 1 digit (until sigle digit Prime rests) from any chosen in advance side and resulting number is also Prime. Shortable Prime can be called Left/Right/Full Shortable Prime if it can be reduced from left/right/both sides. For example: 13 -> 3 => 13 is Left Shortable Prime 31 -> 3 => 31 is Right Shortable Prime 3797 -> 797 -> 97 -> 7 and 3797 -> 379 -> 37 -> 3 => 3797 is Full Shortable Prime TASK 1: Write a code which checks if input number is Shortable Prime. Print out not only True or False but specify what kind of Shortable Prime it is: Left, Right or Full. Input: 3797 Output: Full Shortable Prime Input: 13 Output: Left Shortable Prime Input: 19 Output: Not a Shortable Prime EXTRA TASK: Print out not only numbers itself, but also its reducing process like it is shown in the example or any other way you like. :-) CLARIFICATION NOTES: - Single digit Primes are not Shortable Primes. - If number is Full Shortable Prime there is no need to print it also in lists of Left and Right Shortable Primes. */ #include #include using namespace std; bool isPrime(int x) { if (x == 1) return false; for (int i = 2; i*i <= x; i++) if (x%i == 0) return 0; return 1; } vector leftPath, rightPath; bool isRightShortable(int x) { if (x / 10 == 0) return false; while (x) { rightPath.push_back(x); if (!isPrime(x)) return false; x /= 10; } return true; } bool isLeftShortable(int x) { if (x / 10 == 0) return false; int y = 0,z = 1; while (x) { y = (x%10)*z + y; z *= 10; x /= 10; leftPath.push_back(y); if (!isPrime(y)) return false; } return true; } void printLeftPath() { cout<<"From left: "; cout<= 0; i--) cout<<" -> "< "<>x; solve(x); } //By Zhussupov

Shortable Prime (TASK1 + EXTRA TASK)