Pagini recente » Cod sursa (job #134376) | Cod sursa (job #474765) | Cod sursa (job #690964) | Cod sursa (job #2629920) | Cod sursa (job #2492396)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
const int MOD = 104659;
int n, m;
int dp[1005][30];
bool r[30][30];
int main() {
in >> n >> m;
char a, b;
for (int i = 0; i < m; i++) {
in >> a >> b;
r[a - 'a'][b - 'a'] = 1;
r[b - 'a'][a - 'a'] = 1;
}
for (int i = 0; i < 26; i++) {
dp[0][i] = 1;
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < 26; j++) {
for (int k = 0; k < 26; k++) {
if (r[k][j] == 0) {
dp[i][j] += dp[i - 1][j];
}
dp[i][j] %= MOD;
}
}
}
int sum = 0;
for (int i = 0; i < 26; i++) {
sum += dp[n - 1][i];
sum %= MOD;
}
out << sum;
return 0;
}