Scribd
Upload
107 views4 pages

CMMDC, CMMMC

The document contains 4 C++ programs that take input, perform while loops to find the greatest common divisor (GCD) of inputs, and output results. Program 1 finds the GCD of inputs a and b and outputs their product divided by the GCD. Program 2 finds the GCD of inputs a and b and outputs b and their product divided by the GCD. Program 3 finds the GCD of inputs a, b, and c and outputs the GCD. Program 4 finds the GCD of inputs x and y and outputs "DA" if the GCD is 1, and "NU" otherwise.

Uploaded by

alexandrupalade410
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
107 views4 pages

CMMDC, CMMMC

The document contains 4 C++ programs that take input, perform while loops to find the greatest common divisor (GCD) of inputs, and output results. Program 1 finds the GCD of inputs a and b and outputs their product divided by the GCD. Program 2 finds the GCD of inputs a and b and outputs b and their product divided by the GCD. Program 3 finds the GCD of inputs a, b, and c and outputs the GCD. Program 4 finds the GCD of inputs x and y and outputs "DA" if the GCD is 1, and "NU" otherwise.

Uploaded by

alexandrupalade410
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

#include <iostream>

using namespace std;


int a,b,x,y;
int main()
{
cin>>a>>b;
x=a;
y=b;
while (x!=y)
{ if (x>y)
x=x-y;
else
y=y-x;
}
cout<<a<<" "<<(a*b)/x;
return 0;
}
2.
#include <iostream>

using namespace std;


int a, b, rest, p;
int main()
{
cin>>a>>b;
rest=a%b;
p=a*b;
while (rest!=0)
{ a=b;
b=rest;
rest=a%10;
}
cout<<b<<" "<<p/b;
return 0;
}
3.
#include <iostream>

using namespace std;


int a,b,c;
int main()
{
cin>>a>>b>>c;
while(a!=b)
{ if(a>b)
a=a-b;
else
b=b-a;
}
while(a!=c)
{ if(a>c)
a=a-c;
else
c=c-a;
}
cout<<a;
return 0;
}
4.
#include <iostream>

using namespace std;


int x,y;
int main()
{
cin>>x>>y;
while (x!=y)
{ if (x>y)
x=x-y;
else
y=y-x;
}
if(x==1)
cout<<"DA";
else
cout<<"NU";
return 0;

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy