백준 1193 : 분수 찾기

 

 

 

소스코드

#include <iostream>
using namespace std;
 
int main() {
 
    int index = 0;
    int n, i, r;
 
    cin >> n;
 
    for (i = 0; i < n; i += index) {
        ++index;
    }
 
    r = i - n;
 
    if (index % 2 == 1) {
        cout << r + 1 << " / " << index - r << endl;
    }
    else {
        cout << index - r << " / " << r + 1 << endl;
    }
    return 0;
}