1020

djs02027 · djs02027 · commit 449c0a71fdc3 · 2022-10-20T21:38:00.000+09:00
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/BOJ/gold/BOJ15661/BOJ15661.iml b/BOJ/gold/BOJ15661/BOJ15661.iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/BOJ/gold/BOJ15661/src/Main.java b/BOJ/gold/BOJ15661/src/Main.java
@@ -0,0 +1,61 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class Main {
+    static int N;
+    static int [][] table;
+    static int Minv =Integer.MAX_VALUE;
+    public static void main(String[] args) throws IOException {
+
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+        N= Integer.parseInt(br.readLine());
+        table = new int[N][N];
+        for (int i = 0; i < N; i++) {
+            st= new StringTokenizer(br.readLine());
+            int j=0;
+            while (st.hasMoreTokens()){
+                table[i][j]=Integer.parseInt(st.nextToken());
+                j++;
+            }
+        }
+        int [] team =new int [N];
+        FindTeam(team,0,0);
+        System.out.println(Minv);
+    }
+
+    private static void FindTeam(int[] team, int idx, int r) {
+        if(r>0 && r<N){
+            FindDiff(team);
+        }
+
+
+        for (int i = idx; i < N; i++) {
+                team[i]=1;
+                FindTeam(team,i+1 ,r+1);
+                team[i]=0;
+        }
+
+
+    }
+
+    private static void FindDiff(int[] team) {
+        int teamA=0;
+        int teamB=0;
+        for (int i = 0; i < team.length; i++) {
+            for (int j = i+1; j < team.length; j++) {
+                if(team[i]==1 && team[j]==1){
+                    teamA+=(table[i][j]+table[j][i]);
+                } else if (team[i]==0&&team[j]==0) {
+                    teamB+=(table[i][j]+table[j][i]);
+
+                }
+            }
+        }
+        int cac= Math.abs(teamA-teamB);
+        Minv=Math.min(Minv,cac);
+    }
+}
