• 문제 링크
https://www.acmicpc.net/problem/6811
• 풀이 코드
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();
int a = read(), b = read(), c = read(), n = read(), A = n / a, B = n / b, C = n / c, cnt = 0;
for (int i = 0; i <= A; i++) {
for (int j = 0; j <= B; j++) {
for (int k = 0; k <= C; k++) {
int sum = i * a + j * b + k * c;
if (sum <= n && sum > 0) {
sb.append(i).append(" Brown Trout, ").append(j).append(" Northern Pike, ").append(k).append(" Yellow Pickerel\n");
cnt++;
}
}
}
}
bw.write(sb.append("Number of ways to catch fish: ").append(cnt).toString());
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 32585 Building Pyramids - Brute Force / Java (0) | 2025.05.12 |
---|---|
[백준] 33541 2025는 무엇이 특별할까? - Brute Force / Java (0) | 2025.05.11 |
[백준] 33049 마작에서 가장 어려운 것 - Brute Force / Java (0) | 2025.05.09 |
[백준] 17127 벚꽃이 정보섬에 피어난 이유 - Brute Force / Java (0) | 2025.05.08 |
[백준] 1337 올바른 배열 - Implementation / Java (0) | 2025.05.07 |
댓글