분수 찾기

#include <iostream>
using namespace std;

int main()
{
	int n = 0;
	int SumCount = 0;
	int x;
	int numerator = 0;
	int denominator = 0;

	cin >> x;
	while (SumCount < x)
	{
		n++;
		SumCount = n * (n + 1) / 2;
	}

	if (n % 2 != 0)
	{
		numerator = n - (x - (n * (n - 1) / 2) - 1);
		denominator = 1 + (x - (n * (n - 1) / 2) - 1);
	}
	else
	{
		numerator = 1 + (x - (n * (n - 1) / 2) - 1);
		denominator = n - (x - (n * (n - 1) / 2) - 1);
	}

	cout << numerator << "/" << denominator << "\n";
	return 0;
}