最小公倍数最大公因数c++
时间: 2024-01-31 21:10:14 浏览: 36
以下是使用C++求解最小公倍数和最大公因数的示例代码:
1. 求最大公因数:
```cpp
#include <iostream>
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int a = 12;
int b = 18;
int result = gcd(a, b);
std::cout << "最大公因数: " << result << std::endl; // 输出:6
return 0;
}
```
2. 求最小公倍数:
```cpp
#include <iostream>
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int lcm(int a, int b) {
int gcdValue = gcd(a, b);
return (a * b) / gcdValue;
}
int main() {
int a = 12;
int b = 18;
int result = lcm(a, b);
std::cout << "最小公倍数: " << result << std::endl; // 输出:36
return 0;
}
```
相关问题
c++最大公因数最小公倍数
以下是使用C++求最大公因数和最小公倍数的示例代码:
```c++
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
int m, n;
cout << "输入两数:";
cin >> m >> n;
cout << "最大公因数(Greatest Common Divisor):" << gcd(m, n) << endl;
cout << "最小公倍数(Least Common Multiple):" << lcm(m, n) << endl;
return 0;
}
```
运行结果:
```
输入两数:12 18
最大公因数(Greatest Common Divisor):6
最小公倍数(Least Common Multiple):36
```
devc++最小公倍数
以下是使用C语言在DevC++中求最小公倍数的示例:
```c
#include <stdio.h>
#include <stdlib.h>
int main() {
int m, n, r;
int s;
printf("输入两数:");
scanf("%d %d", &m, &n);
s = m * n;
while(n != 0) {
r = m % n;
m = n;
n = r;
}
printf("最大公因数(Greatest Common Divisor):%d\n", m);
printf("最小公倍数(Least Common Multiple):%d\n", s/m);
return 0;
}
```
运行结果:
```
输入两数:4 6
最大公因数(Greatest Common Divisor):2
最小公倍数(Least Common Multiple):12
```