lec24_Basicmath.cpp

//Prime no.
/*
#include<iostream>
using namespace std;

bool isPrime(int n) {

    if(n<=1)
    return false;

    for(int i=2; i<n; i++)
    {
        if(n%i==0)
        {
            return false;
        }
    }
    return true;
}

int countprime(int n)
{
    int cnt=0;
    vector<int> prime(n+1,true);
    prime[0]=prime[1]=false;

    for(int i =2;i<n;i++)
    {
        if(prime[i])
        {
            cnt++;
            for(int j=2*i;j<n;j+=i)
            {
                prime[j]=0;
            }


        }
    }
    return cnt;

}

int main() {

    int n;
    cin >> n;

    if(isPrime(n)) {
        cout << "It is a Prime Number" << endl;
    }
    else{
        cout << " It is not a Prime Number" << endl;
    }


    return 0;
}
*/

#include<iostream>
using namespace std;

int gcd(int a, int b) {
    

    if(a==0)
    return b;

    if(b==0)
    return a;

    while(a != b) {

        if(a>b)
        {
            a = a-b;
        }
        else{
            b = b-a;
        }
    }
    return a;
}

int main() {
    
    int a,b;
    cout << "Enter the Values of a and b" << endl;
    cin >> a >> b;

    int ans = gcd(a,b);

    cout << " The GCD of " << a << " & " << b << " is: " << ans << endl;



    return 0;
}