forked from yalza/DSA-code.ptit
-
Notifications
You must be signed in to change notification settings - Fork 0
/
DSA02025 - KÝ TỰ LẶP.cpp
57 lines (53 loc) · 1.83 KB
/
DSA02025 - KÝ TỰ LẶP.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define p(x) pair<x,x>
#define v(x) vector<x>
#define Tree node*
#define sz(a) a.size()
#define x first
#define y second
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define FOR(i, l, r) for (int i = l; i < r; i++)
#define FORX(i, l, r, x) for (int i = l; i < r; i += x)
#define FORD(i, l, r) for (int i = l; i >= r; i--)
#define correct(x, y, n, m) 0 <= (x)&&(x) < (n)& & 0 <= (y)&&(y) < (m)
#define cin(M, n) FOR(i, 0, n)cin >> M[i]
#define cout(M, n) FOR(i, 0, n)cout << M[i] << " "
#define rs(M, x) memset(M, x, sizeof(M))
#define reset() FOR(i, 0, 1001)A[i].clear(), check[i] = false
#define faster() cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
#define run() int t; cin >> t; while (t--)
#define pq(x) priority_queue<x>
#define neg_pq(x) priority_queue<x, vector<x>, greater<x>>
#define all(M) M.begin(), M.end()
using namespace std;
//_______________________NGUYỄN_NGỌC_TOÀN_______________________//
int n;
string M[100];
int res = INT_MAX;
bool check[1000];
int count(string a, string b) {
int f = 0;
for (auto c : a)for (auto v : b)if (c == v)f++;
return f;
}
void Try(int dem, int sum, int k) {
FOR(i, 1, n+1) {
if (!check[i]) {
check[i] = true;
if (dem == n) res = min(res, sum + count(M[k], M[i]));
else if (res > sum && dem < n)Try(dem + 1, sum + count(M[k], M[i]), i);
check[i] = false;
}
}
}
int main() {
faster();
cin >> n;
FOR(i, 1, n + 1)cin >> M[i];
Try(1, 0, 0);
cout << res << endl;
}
//__________________________B20DCPT173__________________________//