Pagini recente » Cod sursa (job #2272290) | Cod sursa (job #2479870) | Cod sursa (job #1371852) | Cod sursa (job #2105346) | Cod sursa (job #3304870)
#include <bits/stdc++.h>
#define NMAX 1000
#define MMAX 26
#define MOD 104659
#define ll long long
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n, m, ans;
int dp[NMAX + 2][MMAX];
char c1, c2;
bool fr[MMAX][MMAX];
int main() {
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
fin >> n >> m;
while (m--) {
fin >> c1 >> c2;
fr[c1 - 'a'][c2 - 'a'] = fr[c2 - 'a'][c1 - 'a'] = 1;
}
for (int lit = 0; lit <= 25; lit++) {
dp[1][lit] = 1;
}
for (int i = 2; i <= n; i++) {
for (int lit_1 = 0; lit_1 <= 25; lit_1++) {
for (int lit_2 = 0; lit_2 <= 25; lit_2++) {
if (!fr[lit_1][lit_2]) {
dp[i][lit_1] += dp[i - 1][lit_2];
if (dp[i][lit_1] >= MOD) {
dp[i][lit_1] -= MOD;
}
}
}
}
}
for (int lit = 0; lit <= 25; lit++) {
ans += dp[n][lit];
if (ans >= MOD) {
ans -= MOD;
}
}
fout << ans;
return 0;
}