查找 HCF 和 LCM 的 C 程序
2021-07-06 21:52:28
深夜i
--
--
查
找
C
F
C
M
序
查找 HCF 和 LCM 的 C 程序: 下面的代码查找两个整数的最大公因数和最小公倍数。 HCF 也称为最大公约数 (GCD) 或最大公因数 (GCF)。
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 程序。
程序输出:
使用递归查找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;
}
上一篇:
idea打包java可执行jar包
下一篇:
C 十进制转二进制
评论区