Finding LCM and GCD
#include "stdio.h"
void main()
{
int a[20],n,i,j,c,max,min;
unsigned long prod;
clrscr();
printf("Enter the no. of entries: ");
scanf("%d",&n);
printf("Enter the entries:");
for(i=0;i
a[i]=c;
else
{
printf("Invalid Entry");
return;
}
}
max=a[0];
for(i=0;i
max=a[i];
min=a[0];
for(i=0;i
{
if (min%i==0)
{
c=0;
for(j=0;j
if(a[j]%i==0)
c+=1;
}
if(c==n)
{
printf("The GCD of the nos: %d",i);
break;
}
}
getch();
}
Thursday, July 16, 2009
PROGRAM TO Finding LCM and GCD
Posted by bh.gaurav@rediff.com at 11:11 AM 0 comments
Subscribe to:
Comments (Atom)