• 문제 링크
https://www.acmicpc.net/problem/2979
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
static int[] cnt = new int[101];
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int[] arr = {0, read(), read(), read()};
for (int i = 0; i < 3; i++) count(read(), read());
int sum = 0;
for (int i : cnt) sum += arr[i] * i;
bw.write(String.valueOf(sum));
bw.flush();
}
private static void count(int i, int j) {
while (i < j) cnt[i++]++;
}
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' 카테고리의 다른 글
[백준] 24771 Un-bear-able Zoo - Data Structure / Java (0) | 2024.11.24 |
---|---|
[백준] 9506 약수들의 합 - Implementation / Java (0) | 2024.11.23 |
[백준] 14719 빗물 - Implementation / Java (0) | 2024.11.21 |
[백준] 5355 화성 수학 - Implementation / Java (0) | 2024.11.20 |
[백준] 2846 오르막길 - Implementation / Java (0) | 2024.11.19 |
댓글