#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 70;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
map <int,int> cnt[M][M];
ll n, m, ans;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; ++i){
string s;
cin >> s;
int mask = 0, tmp[M];
memset(tmp, -1, sizeof tmp);
for(int j = 0; j < m; ++j) if(s[j] != '?') mask |= (1 << j);
for(int mask2 = 0; mask2 < (1 << m); ++mask2){
if((mask & mask2) != mask2) continue;
int cur = 0;
for(int j = 0, p = 1; j < m; ++j, p *= 26) if((mask2 >> j) & 1) cur += p * (s[j] - 'a');
tmp[mask2] = cur;
}
for(int mask2 = 0; mask2 < (1 << m); ++mask2){
int res = (mask & mask2);
ans += cnt[mask2][res][tmp[res];
}
for(int mask2 = 0; mask2 < (1 << m); ++mask2) if(tmp[mask2] != -1) ++cnt[mask][mask2][tmp[mask2]];
}
cout << ans << endl;
return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)
Compilation message
parametriziran.cpp: In function 'int main()':
parametriziran.cpp:47:44: error: expected ']' before ';' token
47 | ans += cnt[mask2][res][tmp[res];
| ^
| ]
