21xrx.com
2023-06-01 18:21:46 Thursday

##### 查找 HCF 和 LCM 的 C 程序
2021-07-06 21:52:28 深夜i     --     --
C F C M

## C 中两个数的 HCF

``````#include <stdio.h>

int main() {
int a, b, x, y, t, gcd, lcm;

printf("Enter two integers\n");
scanf("%d%d", &x, &y);

a = x;
b = y;

while (b != 0) {
t = b;
b = a % b;
a = t;
}

gcd = a;
lcm = (x*y)/gcd;

printf("Greatest common divisor of %d and %d = %d\n", x, y, gcd);
printf("Least common multiple of %d and %d = %d\n", x, y, lcm);

return 0;
}``````

## 使用递归查找hcf和lcm的C程序

``````#include <stdio.h>

long gcd(long, long);

int main() {
long x, y, hcf, lcm;

printf("Enter two integers\n");
scanf("%ld%ld", &x, &y);

hcf = gcd(x, y);
lcm = (x*y)/hcf;

printf("Greatest common divisor of %ld and %ld = %ld\n", x, y, hcf);
printf("Least common multiple of %ld and %ld = %ld\n", x, y, lcm);

return 0;
}``````
``````long gcd(long a, long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}``````

## 使用函数查找hcf和lcm的C程序

``````#include <stdio.h>

long gcd(long, long);

int main() {
long x, y, hcf, lcm;

printf("Enter two integers\n");
scanf("%ld%ld", &x, &y);

hcf = gcd(x, y);
lcm = (x*y)/hcf;

printf("Greatest common divisor of %ld and %ld = %ld\n", x, y, hcf);
printf("Least common multiple of %ld and %ld = %ld\n", x, y, lcm);

return 0;
}

long gcd(long x, long y) {
if (x == 0) {
return y;
}

while (y != 0) {
if (x > y)
x = x - y;
else
y = y - x;
}

return x;
}``````

#### 评论区

 {{item['qq_nickname']}} () 回复 回复