백준/백준-C++
1193번: 분수찾기
Beabletoet
2017. 1. 27. 12:22
#include <iostream>
using namespace std;
int main()
{
int X, line=0, i, up, down;
cin >> X;
for (i = 0; i < X; i += line)
++line;
if (line % 2 == 1)
{
down = line - i + X;
up = 1 + i - X;
}
else
{
up = line - i + X;
down = 1 + i - X;
}
cout << up << '/' << down;
}