본문 바로가기
Problem Solving/Baekjoon

[백준] 8295 Rectangles - Brute Force / Java

by graycode 2025. 1. 24.

 문제 링크

https://www.acmicpc.net/problem/8295

 

 풀이 코드

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(), cnt = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++) if ((i + j) * 2 >= p) cnt += (n - i + 1) * (m - j + 1);

        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;
    }

}

댓글