๐Ÿ•ธ Algorithm/๐Ÿ•ธ ๋ฐฑ์ค€ BaekJoon

[๋ฐฑ์ค€][java][1193][๋ถ„์ˆ˜์ฐพ๊ธฐ]

yeun.log 2024. 3. 21. 05:43
๋ฐ˜์‘ํ˜•

import java.util.Scanner;

// 1193	๋ถ„์ˆ˜์ฐพ๊ธฐ
public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int x = in.nextInt();
        in.close();
        int cnt = 0;
        int sum = 0;
        int a = 0;
        int b = 0;

        while (x > sum) {
            cnt++;
            sum += cnt;
        }

        // ์ง์ˆ˜์ผ ๊ฒฝ์šฐ
        if (cnt % 2 == 0) {
            a = cnt - (sum - x);
            b = cnt + ((sum - cnt) - x) + 1;
        }
        else {
            a = cnt + ((sum - cnt) - x) +1;
            b = cnt - (sum - x);
        }

        System.out.print(a + "/" + b);
    }
}

 

๋ฐ˜์‘ํ˜•