![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
/**//*
⑴a除以b,余数存于r;
⑵如果r不为0,则将b的值赋给a,r的值赋给b,重复⑴;否则执行⑶
⑶输出a的值,它就是最大公约数。
*/
#include <stdio.h>
#include <conio.h>
int divisor(int,int);
void main()
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
clrscr();
int a,b,d;
scanf("%d,%d",&a,&b);
if (a>b)
d=divisor(a,b);
else
d=divisor(b,a);
printf("a=%d,b=%d\n",a,b);
printf("d=%d",d);
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
int divisor(int a,int b)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int r;
do
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
r=a%b;
a=b;
b=r;
}while(r!=0);
return a;
}
posted @
2007-01-13 10:38
齐心
Views(
3003)
Comments()
Edit
收藏
举报