Pagini recente » Cod sursa (job #1904651) | Cod sursa (job #505177) | Cod sursa (job #423592) | Cod sursa (job #344017) | Cod sursa (job #3167038)
#include <fstream>
#define MOD 104659
using namespace std;
int n, m, d[1010][256];
char x, y;
bool a[256][256];
int main() {
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
fin >> n >> m;
for (int i = 1; i <= m; i++) {
fin >> x >> y;
a[x][y] = true;
}
for (int i = 'a'; i <= 'z'; i++) {
d[1][i] = 1;
}
for (int i = 2; i <= n; i++) {
for (int j = 'a'; j <= 'z'; j++) {
for (int t = 'a'; t <= 'z'; t++) {
if (!a[j][t] && !a[t][j]) {
d[i][t] += d[i - 1][j];
d[i][t] %= MOD;
}
}
}
}
for (int i = 'b'; i <= 'z'; i++) {
d[n]['a'] += d[n][i];
d[n]['a'] %= MOD;
}
fout << d[n]['a'];
return 0;
}