[백준][1735번][유클리드 호제법] 분수 합
분수 합 https://www.acmicpc.net/problem/173512345678910111213141516171819202122232425262728293031323334#include int gcd(int n1, int n2){ if (n2%n1 == 0){ return n1; } else gcd(n2%n1, n1);} int main(void){ int a_u, a_d; int b_u, b_d; int gcd_num; int result_u, result_d; scanf("%d %d", &a_u, &a_d); scanf("%d %d", &b_u, &b_d); gcd_num = gcd(a_d, b_d); result_d = a_d*b_d / gcd_num; result_u = result_d ..
2016. 3. 23.