[백준-3036번/Java] 링

https://www.acmicpc.net/problem/3036

3036번: 링

 

* 최대공약수 이용 (유클리드 호제법)

import java.io.*;
import java.util.*;

public class Main {

	public static class SimpleFraction {
		int numerator;
		int denominator;

		public SimpleFraction(int numerator, int denominator) {
			int fraction_gcd = gcd(numerator, denominator);

			this.numerator = numerator / fraction_gcd;
			this.denominator = denominator / fraction_gcd;
		}

		@Override
		public String toString() {
			return this.numerator + "/" + this.denominator;
		}
	}

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

		int N = Integer.parseInt(br.readLine());
		StringTokenizer stk = new StringTokenizer(br.readLine(), " ");
		int[] arr = new int[N];

		for (int i = 0; i < arr.length; i++) {
			arr[i] = Integer.parseInt(stk.nextToken());
		}

		for (int i = 1; i < arr.length; i++) {
			System.out.println(new SimpleFraction(arr[0], arr[i]));
		}
	}

	public static int gcd(int a, int b) {
		int temp;
		if (a < b) {
			temp = a;
			a = b;
			b = temp;
		}
		int r = a % b;
		if (r == 0) {
			return b;
		}
		return gcd(b, r);
	}

}