Problem Solving1257 [백준] 6147 Bookshelf - Greedy / Java • 문제 링크https://www.acmicpc.net/problem/6147 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;import java.util.Arrays;public class Main { public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = read(), b = read(); int[] arr = new int[n]; .. 2024. 5. 14. [백준] 25335 Gravity Hackenbush - Greedy / Java • 문제 링크https://www.acmicpc.net/problem/25335 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;public class Main { public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = read(), m = read(); while (n-- > 0) { read(); .. 2024. 5. 13. [백준] 16756 Pismo - Greedy / Java • 문제 링크https://www.acmicpc.net/problem/16756 • 풀이 코드import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.i.. 2024. 5. 12. [백준] 30088 공포의 면담실 - Greedy / Java • 문제 링크https://www.acmicpc.net/problem/30088 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;import java.util.Arrays;public class Main { public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = read(); long[] sums = new long[n]; w.. 2024. 5. 11. [백준] 13238 Bitcoin investment - Greedy / Java • 문제 링크https://www.acmicpc.net/problem/13238 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;public class Main { public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = read(), i = read(), j, max = 0; while (n-- > 1) { if (i .. 2024. 5. 10. [백준] 4852 Winter Festival - Graph Theory / Java • 문제 링크https://www.acmicpc.net/problem/4852 • 풀이 코드import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;import java.util.Set;import java.util.StringTokenizer;import java.util.TreeSet;public class Main {.. 2024. 5. 9. 이전 1 ··· 83 84 85 86 87 88 89 ··· 210 다음
