[1일 1문제] 백준 단계별로 풀어보기 5-7, 1-2번 (2.12~2.16)

2.12

문제번호 2292

package baekjoon;

import java.util.Scanner;

public class java_0212 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int count = 1;
		int range = 2;
		
		if(N==1) {
			System.out.println(1);
		} else {
			while(range<=N) {
				range=range+(6*count);
				count++;
			}
			System.out.println(count);
		}
		sc.close();
	}
}

 

2.13

문제번호 1193

package baekjoon;

import java.util.Scanner;

public class java_0213 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int X = sc.nextInt();
		
		int cross_count = 1, prev_count_sum = 0;
		 
		while (true) {
			if (X <= prev_count_sum + cross_count) {	
				if (cross_count % 2 == 1) {
					System.out.print((cross_count - (X - prev_count_sum - 1)) + "/" + (X - prev_count_sum));
					break;
				} else {
					System.out.print((X - prev_count_sum) + "/" + (cross_count - (X - prev_count_sum - 1)));
					break;
				}
			} else {
				prev_count_sum += cross_count;
				cross_count++;
			}
		}
		sc.close();
	}
}

 

2.14

문제번호 2869

package baekjoon;

import java.util.Scanner;

public class java_0214 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int A = sc.nextInt();
		int B = sc.nextInt();
		int V = sc.nextInt();
		
		int day = (V-B)/(A-B);
		
		if((V-B)%(A-B)!=0) {
			day++;
		}
		System.out.println(day);
		sc.close();
	}
}

 

2.15

문제번호 5086

package baekjoon;

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Scanner;

public class java_0215 {
	public static void main(String[] args) throws IOException {
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		Scanner sc = new Scanner(System.in);
		
        while(true){
        	int a = sc.nextInt();
        	int b = sc.nextInt();
        	
        	if(a==0 && b==0) {
        		break;
        	} 
        	
        	if(a>b) {
        		if(a%b==0) {
        			bw.write("multiple");
        		} else {
        			bw.write("neither");
        		}
        	} else {
        		if(b%a==0) {
        			bw.write("factor");
        		} else {
        			bw.write("neither");
        		}
        	}
        	bw.write("\n");
        }
        bw.flush();
        bw.close();
        sc.close();
	}
}

 

2.16

문제번호 2501

package baekjoon;

import java.util.Scanner;

public class java_0216 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int K = sc.nextInt();
		int count = 0;
		int i = 1;
		int result = 0;
		
		while(i<=N) {
			if(N%i == 0) {
				count++;
			}
			if(count == K) {
				result = i;
				break;
			}
			i++;
		}
		System.out.println(result);
		sc.close();
	}
}