문제 주소https://algospot.com/judge/problem/read/CLOCKSYNC 예제 입력2 12 6 6 6 6 6 12 12 12 12 12 12 12 12 12 12 12 9 3 12 6 6 9 3 12 9 12 9 12 12 6 6 예제 출력2 9 깃허브 주소https://github.com/SeungHwan-Choi/Algorithm/blob/master/src/bruteforce/Clocksync.java import java.util.Scanner; public class Main { private static final int CNT_CLOCK = 16, CNT_BUTTON = 10, MIN = 9999; // int[버튼][시계] (1= 해당 버튼이 시계를 ) privat..
문제 주소https://algospot.com/judge/problem/read/BOARDCOVER 예제 입력3 3 7 #.....# #.....# ##...## 3 7 #.....# #.....# ##..### 8 10 ########## #........# #........# #........# #........# #........# #........# ########## 예제 출력0 2 1514 깃허브 주소https://github.com/SeungHwan-Choi/Algorithm/blob/master/src/bruteforce/BoardCover.java import java.util.Scanner; public class Main { // int[블록을 놓는 모양][모양에 따른 블록들의 상대좌..
문제 주소https://algospot.com/judge/problem/read/PICNIC 예제 입력3 2 1 0 1 4 6 0 1 1 2 2 3 3 0 0 2 1 3 6 10 0 1 0 2 1 2 1 3 1 4 2 3 2 4 3 4 3 5 4 5예제 출력1 3 4 깃허브 주소https://github.com/SeungHwan-Choi/Algorithm/blob/master/src/bruteforce/Picnic.java package bruteforce; import java.util.Scanner; public class Main { // 친구 관계를 담고 있는 변수 private static boolean[][] areFriends; public static void main(String[] ar..