/* [ASSIGNMENT] Shortable Prime Numbers TASK 2 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 2: Write a code which finds all Shortable Prime in a given range [A,B] and print them out grouped by Left, Right and Full Shortable Primes. Input: 1 10000 Output: Left Shortable Prime: ...find it... :-) Right Shortable Prime: ...find it... Full Shortable Prime: ...find it... 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; } bool isRightShortable(int x) { if (x / 10 == 0) return false; while (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; if (!isPrime(y)) return false; } return true; } string isShortable(int x) { bool left = isLeftShortable(x); bool right = isRightShortable(x); bool full = left && right; if (full) return "Full Shortable Prime"; if (left) return "Left Shortable Prime"; if (right) return "Right Shortable Prime"; return "Not a Shortable Prime"; } vector leftShortables, rightShortables, fullShortables; void solve(int a, int b) { for (int i = a; i <= b; i++) { string cur = isShortable(i); if (cur[0] == 'F') fullShortables.push_back(i); if (cur[0] == 'L') leftShortables.push_back(i); if (cur[0] == 'R') rightShortables.push_back(i); } } int main() { int a,b; cout<<"Enter A: "; cin>>a; cout<<"Enter B: "; cin>>b; solve(a,b); cout<<"Left Shortable Primes: "; for (int i = 0; i < leftShortables.size(); i++) cout<

Shortable Prime (TASK 2)