Merge branch 'TecheerB:master' into master

Author: Gnu-Kenny

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;
+//     }
+// }

README.md

@@ -34,7 +34,7 @@
 |1주차 <br> (10.25 ~ 11.7)|정렬 <br> (정렬 알고리즘 <br> & 시간 복잡도)|스택/큐|[K 번째 수](https://programmers.co.kr/learn/courses/30/lessons/42748), <br> [수 정렬하기](https://www.acmicpc.net/problem/2750), [세 수 정렬](https://www.acmicpc.net/problem/2752)|[가장 큰 수](https://programmers.co.kr/learn/courses/30/lessons/42746), [H-Index](https://programmers.co.kr/learn/courses/30/lessons/42747), [시리얼 번호](https://www.acmicpc.net/problem/1431), <br> [공통 순열](https://www.acmicpc.net/problem/1622), [K번째 수 찾는 함수](https://www.acmicpc.net/problem/16455)|[전화번호 목록](https://www.acmicpc.net/problem/5052), <br> [버블 소트](https://www.acmicpc.net/problem/1377)|
 |2주차 <br> (11.8 ~ 11.14)|해시|힙|[완주하지 못한 선수](https://programmers.co.kr/learn/courses/30/lessons/42576), <br> [Duplicates](https://www.acmicpc.net/problem/15098)|[전화번호 목록](https://programmers.co.kr/learn/courses/30/lessons/42577), [위장](https://programmers.co.kr/learn/courses/30/lessons/42578), <br> [숫자 카드2](https://www.acmicpc.net/problem/10816), [듣보잡](https://www.acmicpc.net/problem/1764), [비밀번호 찾기](https://www.acmicpc.net/problem/17219)|[베스트 앨범](https://programmers.co.kr/learn/courses/30/lessons/42579), <br> [친구 네트워크](https://www.acmicpc.net/problem/4195)|
 |3주차 <br> (11.15 ~ 11.21)|완전 탐색|이분 탐색|[모의고사](https://programmers.co.kr/learn/courses/30/lessons/42840), [블랙잭](https://www.acmicpc.net/problem/2798), [분해합](https://www.acmicpc.net/problem/2231)|[소수 찾기](https://programmers.co.kr/learn/courses/30/lessons/42839), [카펫](https://programmers.co.kr/learn/courses/30/lessons/42842), [숫자야구](https://www.acmicpc.net/problem/2503), <br> [퇴사](https://www.acmicpc.net/problem/14501)|[테트로미노](https://www.acmicpc.net/problem/14500), [치킨배달](https://www.acmicpc.net/problem/15686)|
-|4주차 <br> (11.22 ~ 11.28)|DFS/BFS|그래프||||
+|4주차 <br> (11.22 ~ 11.28)|DFS/BFS|그래프|X|[타겟 넘버](https://programmers.co.kr/learn/courses/30/lessons/43165), [DFS와 BFS](https://www.acmicpc.net/problem/1260), [바이러스](https://www.acmicpc.net/problem/2606),<br> [섬의 개수](https://www.acmicpc.net/problem/4963), [미로 탐색](https://www.acmicpc.net/problem/2178)|[네트워크](https://programmers.co.kr/learn/courses/30/lessons/43162), [단어 변환](https://programmers.co.kr/learn/courses/30/lessons/43163), [여행경로](https://programmers.co.kr/learn/courses/30/lessons/43164), [연구소](https://www.acmicpc.net/problem/14502)|
 |5주차 <br> (11.29 ~ 12.5)|DP|Greedy||||
 
 <br>
@@ -45,9 +45,9 @@
 
 | 참여자 | 1주차 | 2주차 | 3주차 | 4주차 | 5주차 |
 | --- | --- | --- | --- | --- | --- |
-| EunjiShin |:white_check_mark:|:white_check_mark:||||
+| EunjiShin |:white_check_mark:|:white_check_mark:|:white_check_mark:|||
 | RyanLee |:white_check_mark:|||||
-| GnuPark ||||||
+| GnuPark |:white_check_mark:|:white_check_mark:|:white_check_mark:|||
 | YoungjinShin |:white_check_mark:|:white_check_mark:||||
 
 <br>