//‫االعداد االولية بين رقمين‬

#include <iostream>
using namespace std;

int checkPrimeNumber(int);

int main() {
int n1, n2;
bool flag;

cout << "Enter two positive integers: ";

cin >> n1 >> n2;

// swapping n1 and n2 if n1 is greater than n2

if (n1 > n2) {
n2 = n1 + n2;
n1 = n2 - n1;
n2 = n2 - n1;
}

cout << "Prime numbers between " << n1 << " and " << n2 << " are: ";

for(int i = n1+1; i < n2; ++i) {

// If i is a prime number, flag will be equal to 1
flag = checkPrimeNumber(i);

if(flag)
cout << i << " ";
}

return 0;
}

// user-defined function to check prime number

int checkPrimeNumber(int n) {
bool isPrime = true;

// 0 and 1 are not prime numbers

if (n == 0 || n == 1) {
isPrime = false;
}
else {
for(int j = 2; j <= n/2; ++j) {
if (n%j == 0) {
isPrime = false;
break;
}
}
}

return isPrime;
}
__________________________________________________

//‫ايجاد القاسم المشترك االكبر بين رقمين‬

// C++ program to find GCD of two numbers
#include <iostream>
using namespace std;
// Recursive function to return gcd of a and b
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);

// Driver program to test above function

int main()
{
int a, b;
cout<<"Enter First NUMBER:";
cin>>a;
cout<<"Enter socand NUMBER:";
cin>>b;
cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b)<<endl;
return 0;
}
_________________
// C++ program to find GCD of two numbers
#include <iostream>
using namespace std;
// Recursive function to return gcd of a and b
int gcd(int a, int b)
{
// Everything divides 0
if (a == 0)
return b;
if (b == 0)
return a;

// base case
if (a == b)
return a;

// a is greater
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
}

// Driver program to test above function

int main()
{
int a, b;
cout<<"Enter First NUMBER:";
cin>>a;
cout<<"Enter socand NUMBER:";
cin>>b;
cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b)<<endl;
return 0;
}