1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 | #include <stdio.h> #pragma warning(disable:4996) int a, b, ans_a, ans_b; void algo(int *gcd, int *lcm); int gcd1(int ga, int gb); int main() { scanf("%d %d", &a, &b); algo(&a, &b); return 0; } void algo(int *gcd, int *lcm) { int yom = ((*lcm) / (*gcd)), minSum = 0; int seem = (yom != 1) ? yom / 2 : 1; for (int i = 1; i <= seem; i++) { if (!(yom%i)) { int ansa = (i*(*gcd)), ansb = ((yom / i)*(*gcd)), tmp = ansa + ansb; if (minSum && (gcd1(ansa, ansb) == *gcd)) { if (minSum > tmp) { minSum = tmp; ans_a = ansa, ans_b = ansb; } } else if (gcd1(ansa, ansb) == *gcd) { minSum = tmp; ans_a = ansa, ans_b = ansb; } } } printf("%d %d\n", ans_a, ans_b); } int gcd1(int ga, int gb) { if (gb == 0) return ga; gcd1(gb, ga%gb); } |