[3036] 링

#include<iostream>
#include<vector>
using namespace std;
int gcd(int m, int n);
int main()
{
	int a, i;
	vector <int> v;
	cin >> a;
	for (i = 0; i < a; i++)
	{
		int r;
		cin >> r;
		v.push_back(r);
	}
	for (i = 1; i < a; i++)
	{
		int ring = gcd(v[0], v[i]);
		cout << v[0] / ring << "/" << v[i] / ring << endl;
	}
	return 0;
}
int gcd(int m, int n)
{
	if (m < n)
		return gcd(n, m%n);
	if (n == 0)
		return m;
	return gcd(n, m % n);
}