Pagini recente » Cod sursa (job #203230) | Cod sursa (job #472780) | Cod sursa (job #3190390) | Cod sursa (job #804010) | Cod sursa (job #2114749)
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
const int N = 1001, MODULO = 104659;
int n, m, d[N][26];
bool c[26][26];
int main()
{
char a, b;
in >> n >> m;
for (int i = 0; i < m; i++) {
in >> a >> b;
c[a - 'a'][b - 'a'] = true;
c[b - 'a'][a - 'a'] = true;
}
for (int j = 0; j < 26; j++) d[1][j] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < 26; j++) {
for (int k = 0; k < 26; k++) {
if (!c[k][j]) {
d[i][j] += d[i - 1][k];
d[i][j] %= MODULO;
}
}
}
}
int s = 0;
for (int i = 0; i < 26; i++) {
s += d[n][i];
s %= MODULO;
}
out << s;
}