Pagini recente » Cod sursa (job #3129024) | Cod sursa (job #2205944) | Cod sursa (job #2308176) | Cod sursa (job #5938) | Cod sursa (job #2667068)
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
const int N = 1001;
const int NL = 26;
const int M = 104659;
int dp[N][NL];
bool inco[NL][NL];
int main() {
int n, m;
in >> n >> m;
for(int i = 0; i < m; i++) {
char c1, c2;
in >> c1 >> c2;
inco[c1 - 'a'][c2 - 'a'] = inco[c2 - 'a'][c1 - 'a'] = true;
}
for(int j = 0; j < NL; j++) {
dp[1][j] = 1;
}
for(int i = 2; i <= n; i++) {
for(int j = 0; j < NL; j++) {
for(int k = 0; k < NL; k++) {
if(!inco[j][k]) {
dp[i][j] += dp[i-1][k];
dp[i][j] %= M;
}
}
}
}
int rez = 0;
for(int j = 0; j < NL; j++) {
rez += dp[n][j];
rez %= M;
}
out << rez;
out.close();
return 0;
}