[백준] 3036번 링 C++

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

#include <iostream>
#include <vector>

using namespace std;

int gcd(int a, int b)
{
	int c;
	while (b != 0)
	{
		c = a % b;
		a = b;
		b = c;
	}
	return a;
}

int main(void)
{
	int N, first_ring, tmp, gcd_val;
	vector<int> rings;
	cin >> N;
	cin >> first_ring;
	for (int i = 0; i < N - 1; i++)
	{
		cin >> tmp;
		rings.push_back(tmp);
	}
	for (int i = 0; i < rings.size(); i++)
	{
		gcd_val = gcd(first_ring, rings[i]);
		cout << first_ring / gcd_val << '/' << rings[i] / gcd_val << endl;
	}
	return 0;
}