브르투 포스

문제

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

내풀이

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import java.util.StringTokenizer;

public class b2798 {
	public static void main(String[] args) throws IOException {
		BufferedReader br  = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		
		int n = Integer.parseInt(st.nextToken());
		int m =Integer.parseInt(st.nextToken());
		
		st = new StringTokenizer(br.readLine());
		int[] arr = new int[n];
		
		for (int i = 0; i < n; i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		int max=0;
		
		
		
		for (int i = 0; i < n-2; i++) {
			for (int j = i+1; j < n-1; j++) {
				for (int k = j+1; k < n; k++) {
					int result = arr[i]+arr[j]+arr[k];
					
					if(result <=m)
					
						max =Math.max(max, result);	
				}
			}
		}
		System.out.println(max);	
	}
}

문제

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

내 풀이

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class B1018 {
	public static void main(String[] args) throws IOException {
		BufferedReader br  = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int m =Integer.parseInt(st.nextToken());
	
		char[][] arr =  new char[n][m];
		
		String line;
		for (int i = 0; i < n; i++) {
			line = br.readLine();
			for (int j = 0; j < m; j++) {
				arr[i][j]= line.charAt(j);
			}
		}
		
		//1. 체스판 자르기
		int sol =Integer.MAX_VALUE; // 정수의 최댓값
		for (int i = 0; i <= n-8; i++) {
			for (int j = 0; j <= m-8; j++) {
				int cursol=getSoltuion(i,j,arr); //i와 j번째로부터 시작하는 하나의 체스판을 칠하는 최소 비용을 구하는 함수
				if(sol>cursol) sol=cursol;
				
			}
			
		}
		System.out.println(sol);
		
	}

	private static int getSoltuion(int startRow, int startCol, char[][] arr) {
		String[] answer = {"WBWBWBWB","BWBWBWBW"};
		int whiteSol =0;
		for (int i = 0; i < 8; i++) {
			int row = startRow+i;
			for (int j = 0; j < 8; j++) {
				int col = startCol+j;
				if(arr[row][col] != answer[i%2].charAt(j)) {
					whiteSol++;
				}
				
			}
			
		}
		int result=Math.min(64-whiteSol, whiteSol);
		return result;
	}

}