수학

[백준] 11050.이항 계수 1(Java8)

문제 풀이 package solved2; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //이항 계수 1(nCr) BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()," "); int n = Integer.par..

[백준] 4153.직각삼각형(Java8)

문제 풀이 package solved2; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //직각삼각형 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; StringBuilder sb = new StringBuilder(); in..

[백준] 1009.분산처리(Java8)

문제 풀이 package Implementation; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //분산처리 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int t = Integer.parseInt(br.readLine());//테스트 케이스의 개수 StringTokenizer st; StringB..

[백준] 10162.전자레인지(Java8)

문제 풀이 package greedy; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException{ //전자레인지 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); int t = Integer.parseInt(br.readLine());//요리시간 int[] sec = {300, 60, 10};//A, B, C..

[백준] 2839.설탕 배달(Java8)

문제 풀이 package solved2; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException{ //설탕 배달 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine());//설탕의 무게 int min1 = 0;//봉지의 최소개수 while(true) { if(n % 5 == 0) { // 5로 나눠지는 경우 min..