//给出两个自然数。求最大公约数。
#include <stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);//输入两数a,b
int reminder=a%b;//余数reminder
// 特殊情况：如果其中一个为0，则最大公约数为另一个数
if (a == 0) {
printf("%d\n", b);
return 0;
}
if (b == 0) {
printf("%d\n", a);
return 0;
}
//正常情况：欧几里得法/辗转相除法：反复用较小数除较大数，直到余数为0
while(a!=0&&b!=0)
{
reminder=a%b;//被除数=a,除数=b
a = b; // 新的被除数 ← 旧的除数
b = reminder; // 新的除数 ← 余数
}
printf("%d\n", a);//输出最大公约数
return 0;
}
This code attempts to find the greatest common divisor (GCD) of two natural numbers using the Euclidean algorithm. It reads two integers, handles cases where one is zero, and then uses a loop to repeatedly replace numbers with remainders. However, there is a logical error in the loop that may produce incorrect results.
- The loop condition `while(a!=0&&b!=0)` is correct, but inside the loop you compute `reminder = a % b` before updating `a` and `b`. This means the first remainder is computed from the original `a` and `b`, but after the first iteration, `a` becomes the old `b` and `b` becomes the old remainder. The next iteration then uses the new `a` and `b` correctly. However, the initial `reminder` computed before the loop is never used, and the loop starts with the original `a` and `b` unchanged. This is not a bug, but the initial `reminder` line is unnecessary.
- The main issue is that after the loop ends, you print `a`. But consider what happens when the loop exits: it exits when either `a` or `b` becomes 0. In the Euclidean algorithm, the GCD is the non-zero value. However, your loop updates `a` and `b` in each iteration, and the final non-zero value could be in either variable. For example, if `a` becomes 0 first, then `b` holds the GCD, but you print `a` which is 0. You need to determine which variable holds the non-zero result after the loop.