C语言学习日志3-爱代码爱编程
欧几里德算法（辗转相除法）求最大公约数
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int a = 0;
int b = 0;
int c = 0;
scanf_s("%d", &a);
scanf_s("%d", &b);
do
{
if (a == 0 || b == 0)
{
c = a < b ? b : a;
}
else if (a == 0 && b == 0)
{
c = 0;
}
else
{
c = b;
b = a % b;
a = c;
}
} while (b!=0);
printf("zui da gong yu shu %d\n", c);
}
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。 本文链接： https://blog.csdn.net/qq_45318938/article/details/106276477