Problem Solving1256 [백준] 9196 정수 직사각형 - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/9196 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;import java.util.ArrayList;import java.util.Collections;import java.util.Iterator;import java.util.List;public class Main { static List list = new ArrayList(); public static void main(String[] args) throws IOException { BufferedWriter bw = new.. 2024. 7. 6. [백준] 30189 경우의 수의 합 - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/30189 • 풀이 코드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(), k = n + m + 1, cnt = 0; while (k-- > 0) for (in.. 2024. 7. 5. [백준] 15995 잉여역수 구하기 - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/15995 • 풀이 코드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)); bw.write(String.valueOf(calc(read(), read()))); bw.flush(); } private.. 2024. 7. 4. [백준] 27445 Gorani Command - Brute Force / Java • 문제 링크https://www.acmicpc.net/problem/27445 • 풀이 코드import java.io.BufferedWriter;import java.io.IOException;import java.io.OutputStreamWriter;public class Main { static Node[] arr; public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = read(), m = read(); arr = new Node[n + m - 1].. 2024. 7. 3. [백준] 1205 등수 구하기 - Implementation / Java • 문제 링크https://www.acmicpc.net/problem/1205 • 풀이 코드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(), p = read(), i = 0, j = 1, k; while (i k) break;.. 2024. 7. 2. [백준] 1769 3의 배수 - Implementation / Java • 문제 링크https://www.acmicpc.net/problem/1769 • 풀이 코드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 = ne.. 2024. 7. 1. 이전 1 ··· 74 75 76 77 78 79 80 ··· 210 다음
