Problem Solving1216 [백준] 10372 Alarm Clock - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/10372 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;public class Main { static int[] arr = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); bw.write(search(read())); .. 2025. 3. 5. [백준] 10472 공간을 만들어 봅시다 - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/10471 • 풀이 코드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)); StringBuilder sb = new StringBuilder(); boolean[] visit = new boolean[read(.. 2025. 3. 4. [백준] 24077 比較 (Comparison) - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/24077 • 풀이 코드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[] a = new int[read()], b = new int[read()]; for (int i = 0; i 32) n = (n 2025. 3. 3. [백준] 32942 그래프와 그래프 - Graph Theory / Java • 문제 링크https://www.acmicpc.net/problem/32942 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;import java.util.ArrayList;import java.util.List;public class Main { public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringBuilder sb = new StringBuil.. 2025. 3. 2. [백준] 24789 Railroad - Graph Theory / Java • 문제 링크https://www.acmicpc.net/problem/24789 • 풀이 코드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)); read(); bw.write(read() % 2 == 0 ? "possible" : "impossible"); bw.fl.. 2025. 3. 1. [백준] 17204 죽음의 게임 - Graph Theory / Java • 문제 링크https://www.acmicpc.net/problem/17204 • 풀이 코드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[] arr = new int[read()]; int k = read(); for (int i = 0; i 32) .. 2025. 2. 28. 이전 1 ··· 27 28 29 30 31 32 33 ··· 203 다음
