You are on page 1of 2

Program for GCD of n numbers

In gcc
#include <iostream>
#include <stdio.h>
#include <conio>
using namespace std;
void algorithm(int *);
int main()
{
int a,b,c,a1[2],a2[100],n;
cout<<"Enter how many numbers u want to enter "<<endl;
cin>>n;
cout<<endl;
for(c=0;c<n;c++)
{
cout<<"Enter a number : "<<endl;
cin>>a2[c];
}
for(a=0;a<(n-1);a++)
{
for(b=a+1;b<n;b++)
{
if(a2[a]>a2[b])
{
c=a2[a];
a2[a]=a2[b];
a2[b]=c;
}
}
}
for(a=n-1;a>0;a--)
{
a1[0]=a2[a];
a1[1]=a2[a-1];
while(1)
{
algorithm(&a1[0]);
if(a1[1]==0)
{
a2[a-1]=a1[0];
a2[a]=0;
break;
}
}
}

cout<<"\nThe GCD = "<<a2[0]<<endl;


return 0;
getch();
}
void algorithm(int *a1)
{
int a,b;
a=*a1;
b=*(a1+1);
cout<<a<<" "<<b<<endl;
*a1 =b;
a1++;
*a1=a%b;
}

You might also like