Merge pull request #12 from EunjiShin/master

[3주차]

Author: EunjiShin

EunjiShin/PS/BOJ/완전탐색/분해합.java

@@ -0,0 +1,26 @@
+import java.io.*;
+
+public class problem2231 {
+    public static void main(String[] args) throws IOException{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+
+        for(int i=1; i<N; i++){
+            int number = i;
+            int sum = 0;
+
+            while(number != 0){
+                sum += number % 10;
+                number /= 10;
+            }
+
+            if(sum+i == N){
+                System.out.println(i);
+                return;
+            }
+        }
+
+        System.out.println(0);
+        
+    }
+}

EunjiShin/PS/BOJ/완전탐색/블랙잭.java

@@ -0,0 +1,32 @@
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class problem2798 {
+    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());
+
+        int [] number = new int[N];
+        st = new StringTokenizer(br.readLine(), " ");
+        for(int i=0; i<N; i++){
+            number[i] = Integer.parseInt(st.nextToken());
+        }
+
+        int sum = 0;
+        for(int i=0; i<N; i++){
+            for(int j=i+1; j<N; j++){
+                for(int n=j+1; n<N; n++){
+                    int numberSum = number[i] + number[j] + number[n];
+                    sum = (numberSum > sum)&&(M >= numberSum) ? numberSum : sum;
+                }
+            }
+        }
+
+        System.out.println(sum);
+
+
+    }
+}

EunjiShin/PS/programmers/완전탐색/모의고사.java

@@ -0,0 +1,80 @@
+import java.util.Arrays;
+
+class Solution {
+    public int[] solution(int[] answers) {
+        int[] answer = {};
+        int max = 0;
+        int count = 0;
+        
+        int[] a = new int[]{1,2,3,4,5};
+        int[] b = new int[]{2,1,2,3,2,4,2,5};
+        int[] c = new int[]{3,3,1,1,2,2,4,4,5,5};
+        
+        int[] score = new int[3];
+        
+        for(int i=0; i<answers.length; i++){
+            if(answers[i] == a[i%5]) score[0]++;
+            if(answers[i] == b[i%8]) score[1]++;
+            if(answers[i] == c[i%10]) score[2]++;
+        }
+        
+        max = Math.max(Math.max(score[0], score[1]), score[2]);
+        
+        for(int i=0; i<3; i++){
+            if(max == score[i]) count++;
+        }
+        answer = new int[count];
+        
+        int j = 0;
+        for(int i=0; i<3; i++){
+            if(score[i] == max) answer[j++] = i+1;
+        }
+        
+        
+        return answer;
+    }
+}
+
+// HashMap쓰면 더 빨라지지 않을까 싶었는데 절대 착각이었음..^^ 
+
+// import java.util.*;
+
+// class Solution {
+//     public int[] solution(int[] answers) {
+//         int[] answer = {};
+//         int max = 0;
+//         int count = 0;
+        
+//         int[] a = new int[]{1,2,3,4,5};
+//         int[] b = new int[]{2,1,2,3,2,4,2,5};
+//         int[] c = new int[]{3,3,1,1,2,2,4,4,5,5};
+        
+//         int[] score = new int[3];
+//         Map<Integer, Integer> score2 = new HashMap<>(){{
+//             put(0,0);
+//             put(1,0);
+//             put(2,0);
+//         }};
+        
+//         for(int i=0; i<answers.length; i++){
+//             if(answers[i] == a[i%5]) score2.put(0, score2.get(0)+1);
+//             if(answers[i] == b[i%8]) score2.put(1, score2.get(1)+1);
+//             if(answers[i] == c[i%10]) score2.put(2, score2.get(2)+1);
+//         }
+        
+//         max = Collections.max(score2.values());
+    
+//         for(int i=0; i<3; i++){
+//             if(max == score2.get(i)) count++;
+//         }
+//         answer = new int[count];
+        
+//         int j = 0;
+//         for(int i=0; i<3; i++){
+//             if(score2.get(i) == max) answer[j++] = i+1;
+//         }
+        
+        
+//         return answer;
+//     }
+// }