18-mj010504

mj010504/Programmers/비밀코드해독.cpp

@@ -0,0 +1,51 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int m;
+bool isValid(vector<int> v, vector<vector<int>> q, vector<int> ans) {
+    for(int i = 0; i < q.size(); i++) {
+        auto tv = q[i];
+         int sum = 0;
+
+         int a = 0, b = 0;
+        while(a < m &&  b < m) {
+            if(v[a] == tv[b]) {
+                sum++;
+                a++; b++;
+            }
+
+            if(v[a] > tv[b]) b++;
+
+            if(v[a] < tv[b]) a++;
+        }
+
+
+        if(sum != ans[i]) return false;
+
+    }
+
+    return true;
+}
+
+
+
+int solution(int n, vector<vector<int>> q, vector<int> ans) {
+    int res = 0;
+    m =  q[0].size();
+
+    for(int a = 1; a <= n  - 4; a++) {
+        for(int b = a + 1; b <= n - 3; b++) {
+            for(int c = b + 1; c <= n - 2; c++) {
+                for(int d = c + 1; d <= n -1; d++) {
+                    for(int e = d + 1; e <= n; e++) {
+                        vector<int> v = {a, b, c, d, e};
+                        if(isValid(v, q, ans)) res++;
+                    }
+                }
+            }
+        }
+    }
+
+    return res;
+}

mj010504/README.md

@@ -10,3 +10,4 @@
  | 7차시 | 2025.05.20 |  분할정복  | [유전법칙](https://school.programmers.co.kr/learn/courses/15008/lessons/121685)|(https://github.com/AlgoLeadMe/AlgoLeadMe-15/pull/28)|
  | 8차시 | 2025.06.15 |  DP  | [개근상](https://www.acmicpc.net/problem/1563)|(https://github.com/AlgoLeadMe/AlgoLeadMe-15/pull/35)|
  | 17차시 | 2025.08.07 |  BFS  | [촌수 계산](https://www.acmicpc.net/problem/2644)|(https://github.com/AlgoLeadMe/AlgoLeadMe-15/pull/65)|
+ | 18차시 | 2025.08.07 |  조합  | [비밀 코드 해독](https://school.programmers.co.kr/learn/courses/30/lessons/388352)|(https://github.com/AlgoLeadMe/AlgoLeadMe-15/pull/69)|