#include #include #include using namespace std; /* 1. Find the closest prime number to the given number 2. Find the smallest and the largest digit in the number 3. Find the greatest common divisor of those two numbers/digits 4. Find the lowest common denominator of those two numbers/ digits */ void digits (int num, int* min, int* max) { int digit; num = abs(num); *min=10; *max=0; while(num) { digit = num%10; if(digit < *min) *min=digit; if(digit > *max) *max=digit; num/=10; } } int isItPrime (int num) { for(int i=2; i<=sqrt(num); i++) { if(num%i ==0) return 0; } return 1; } int lcd (int a, int b) { int minNum= a> b? b: a; for(int i=minNum; i>=1; i--) { if(a%i==0 && b%i==0) return i; } } int gcd (int a, int b) { int maxNum= a>b ? a : b; for(int i=maxNum; i<=a*b; i++) { if(i%a==0 && i%b==0) return i; } } int main() { int num; int min, max; cin>> num; cout << "The closest prime number to our number is " ; for(int i=0; ; i++) { if(isItPrime (num + i)) { cout<< num+i<< endl; break; } if(isItPrime (num-i)) { cout<< num-i << endl; break; } } digits (num, &min, &max); cout<< "The largest and the smallest digits are "<< max << " and "<< min << endl; cout << "GCD is " << gcd (min, max) << endl; cout << "LCD is " << lcd (min, max) << endl; return 0; }

Numbers... all kinds of numbers