Pagini recente » Cod sursa (job #2442144) | Cod sursa (job #2496953) | Cod sursa (job #182802) | Cod sursa (job #459841) | Cod sursa (job #2194078)
#include <cstdio>
#include <vector>
const int MAX_N = 1000;
const int SIGMA = 26;
const int MOD = 104659;
int d[1 + MAX_N][SIGMA];
bool ad[SIGMA][SIGMA];
int main() {
freopen("nrcuv.in", "r", stdin);
freopen("nrcuv.out", "w", stdout);
int n, m;
scanf("%d%d\n", &n, &m);
for (int i = 1; i <= m; i++) {
char ch1, ch2;
scanf("%c %c\n", &ch1, &ch2);
ad[ch1 - 'a'][ch2 - 'a'] = true;
ad[ch2 - 'a'][ch1 - 'a'] = true;
}
for (int j = 0; j < SIGMA; j++)
d[1][j] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < SIGMA; j++) {
for (int k = 0; k < SIGMA; k++) {
if (ad[j][k] == 0)
d[i][j] = (d[i][j] + d[i - 1][k]) % MOD;
}
}
}
int ans = 0;
for (int j = 0; j < SIGMA; j++)
ans = (ans + d[n][j]) % MOD;
printf("%d\n", ans);
return 0;
}