• 문제 링크
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 (int i = 0, j; i <= n; i++) if ((j = k - i) >= 0 && j <= m) cnt++;
bw.write(String.valueOf(cnt));
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' 카테고리의 다른 글
[백준] 15779 Zigzag - Brute Force / Java (0) | 2024.07.07 |
---|---|
[백준] 9196 정수 직사각형 - Brute Force / Java (0) | 2024.07.06 |
[백준] 15995 잉여역수 구하기 - Brute Force / Java (0) | 2024.07.04 |
[백준] 27445 Gorani Command - Brute Force / Java (0) | 2024.07.03 |
[백준] 1205 등수 구하기 - Implementation / Java (0) | 2024.07.02 |
댓글