자료구조, 알고리즘/문제풀이
[문제] 분수 합 1735번
민쓰
2018. 8. 16. 20:11
https://www.acmicpc.net/problem/1735
public class FractionSum {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a_n = scan.nextInt();
int a_d = scan.nextInt();
int b_n = scan.nextInt();
int b_d = scan.nextInt();
int d = a_d * b_d;
a_n = a_n * b_d;
b_n = b_n *a_d;
int n = a_n +b_n;
int gcd_num = gcd(n,d);
n = n/gcd_num;
d = d/gcd_num;
System.out.println(n +" "+d);
}
private static int gcd(int a, int b) {
if(b==0){
return a;
}
else{
return gcd(b, a%b);
}
}