From 58c212fdd0c9fa70fca0eeecf4e3738044761f97 Mon Sep 17 00:00:00 2001
From: sh0723 <pshpark12345@naver.com>
Date: Wed, 1 Jul 2026 12:39:48 +0900
Subject: [PATCH] =?UTF-8?q?1062=20:=20=EA=B0=80=EB=A5=B4=EC=B9=A8=20solve?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/week4/BOJ1062/BOJ1062_V1.cpp | 60 ++++++++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 src/week4/BOJ1062/BOJ1062_V1.cpp

diff --git a/src/week4/BOJ1062/BOJ1062_V1.cpp b/src/week4/BOJ1062/BOJ1062_V1.cpp
new file mode 100644
index 0000000..163cb18
--- /dev/null
+++ b/src/week4/BOJ1062/BOJ1062_V1.cpp
@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N,K;
+int inp_arr[26];
+int ret = 0;
+int learned_setting(int num){
+    num |= (1 << ('a'-'a'));
+    num |= (1 << ('n'-'a'));
+    num |= (1 << ('t'-'a'));
+    num |= (1 << ('i'-'a'));
+    num |= (1 << ('c'-'a'));
+    return num;
+}
+void solve(int learned){
+    int tmp = 0;
+    for (int i=0; i<N; i++) {
+        if ((learned & inp_arr[i]) == inp_arr[i])
+            tmp++;
+    }
+
+    ret = max(ret, tmp);
+}
+void combi(int learned, int cnt, int n) {
+    if (cnt == K) {
+        solve(learned);
+        return;
+    }
+    for (int i=n; i<26; i++) {
+        if (learned & (1 << i)) continue;
+        combi(learned | (1 << i), cnt+1, i+1);
+    }
+}
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> N >> K;
+
+    for (int i=0; i<N; i++) {
+        string s;
+        cin >> s;
+        for (int j=0; j<s.length(); j++) {
+           inp_arr[i] |= (1 << (int)(s[j] - 'a'));
+        }
+    }
+
+    if (K < 5) {
+        cout << 0 << '\n';
+        return 0;
+    }
+
+    int learned = learned_setting(0);
+
+    combi(learned,5,0);
+
+    cout << ret << '\n';
+    return 0;
+}
\ No newline at end of file