CMMMC (alg. lui Euclid)

include <iostream>

using namespace std;

int main ()
{
    int a,b,r,P;
    cout<<"a=";cin>>a;
    cout<<"b=";cin>>b;
    r=a%b;
    P=a*b;
    while (r!=0)
    {
        a=b;
        b=r;
        r=a%b;
    }
    cout<<"cmmmc="<<P/b;
    return 0;
}

CMMMC (sc repetate)

Acest algoritm va afișa cel mai mic multiplu comun a două numere.

#include <iostream>

using namesapce std;

int main ()
{
    int a,b,P;
    cout<<"a=";cin>>a;
    cout<<"b=";cin>>b;
    P=a*b;
    while (a!=b)
    {
        if (a>b) a=a-b;
        else b=b-a;
    }
    cout<<"cmmmc="<<P/a;
    return 0;
}

CMMDC (algoritmul lui Euclid)

include <iostream>

using namespace std;

int main ()
{
    int a,b,r;
    cout<<"a=";cin>>a;
    cout<<"b=";cin>>b;
    r=a%b;
    while (r!=0)
    {
        a=b;
        b=r;
        r=a%b;
    }
    cout<<"cmmdc="<<b;
    return 0;
}

CMMDC (scăderi repetate)

Acest algoritm va afișa cel mai mare divizor comun al două numere.

include <iostream>

using namespace std;

int main ()
{
    int a,b;
    cout<<"a=";cin>>a;
    cout<<"b=";cin>>b;
    while (a!=b)
    {
        if (a>b) a=a-b;
        else b=b-a;
    }
    cout<<"cmmdc="<<a;
    return 0;
}