[백준알고리즘] 1193번 분수찾기 자바(JAVA)

  

 

 

 

 

소스 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Main {
 
    public static void main(String[] args) throws IOException {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    	int n = Integer.parseInt(br.readLine());
    	
    	int line = 0;
    	int cnt = 0;
    	
    	while(cnt < n) {
    		line++;
    		cnt = line * (line+1) / 2;
    	}
    	
    	if( line % 2 != 0) { 
    		int top = 1+(cnt-n); 
    		int bottom = line - (cnt-n); 
    		System.out.println(top+"/"+bottom); 
    	}else { 
    		int top = line - (cnt - n); 
    		int bottom = 1 + (cnt - n); 
    		System.out.println(top+"/"+bottom); 
    	}// end if
    }
}

 

 

출력 결과