[백준 1193] 분수 찾기 (C++/Python)

C++)

#include <iostream>
#include <string>
using namespace std;

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int x;
	cin >> x;

	int i = 1;
	int sum = 1;

	while (sum < x) {
		i += 1;
		sum += i;
	}

	int pos = x - ((i - 1) * i / 2);
	string ans;

	if (i % 2 == 0)
		ans = to_string(pos) + "/" + to_string(i + 1 - pos);
	else
		ans = to_string(i + 1 - pos) + "/" + to_string(pos);

	cout << ans;

	return 0;
}

 

 

 

Python)

import sys

x = int(sys.stdin.readline().rstrip())

i = 1
sum = 1
while sum < x:
    i+=1
    sum += i

pos = int(x - ((i-1)*i/2))

if i % 2 == 0 :
    st = str(pos) + '/' + str(i+1-pos)
else:
    st = str(i+1-pos) + '/' + str(pos)

print(st)