목록백준알고리즘 풀이 (1)

DevBoi

[브루트포스] 백준 - 2798

package com.smith.BruteForce; import java.util.*; public class BOJ2798 { static int N =500; static List answerList = new ArrayList(); static int answer= Integer.MAX_VALUE; static int[] arr = {93,181,245,214,315,36,185,138,216,295}; static boolean[] check = new boolean[10]; public static void main(String[] args) { sol(0); System.out.println(answer); } public static void sol(int num) { if(answerLi..
Algorithm/[BruteForce] 2021. 10. 12. 18:17
이전 Prev 1 Next 다음