#include <stdio.h> int gcd(int m, int n) { int gcd = 1; for (int i = 2; i <= m && i <= n; i++) { if (m % i == 0 && n % i == 0) { gcd = i; } } return gcd; } int main() { int m = 12, n = 18; printf("%d 和 %d 的最大公约数是:%d\n", m, n, gcd(m, n)); return 0; }