본문 바로가기

Programming/Algorithm

[C++] 백준 1193 : 분수찾기

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



#include <iostream>

using namespace std;


int main() {

int N;

cin >> N;

int group = 0;

int i = 1;

while(true){

if (group >= N) break;

group += i;

i++;

}

i--;

int m ,n;

m = n = 1;

if (i % 2 == 1) n = i;

else m = i;

for (int j = 0; j < (group - N); j++) {

if (i % 2 == 1) {

m++;

n--;

}

else {

m--;

n++;

}

}

cout << m << '/' << n;

}